Travelled to:1 × China
1 × Spain
3 × USA
Collaborated with:T.Eliassi-Rad B.Gallagher H.Tong L.Akoglu C.Faloutsos L.Li K.Maruhashi B.A.Prakash S.Basu D.Koutra
Talks about:graph (4) mine (3) structur (2) larg (2) nonparametr (1) distribut (1) discoveri (1) dirichlet (1) approach (1) volatil (1)
Person: Keith Henderson
DBLP: Henderson:Keith
Contributed to:
2015
2012201120102009Wrote 5 papers:
- SAC-2015-HendersonGE #clustering #empirical #named #parametricity #performance #probability
- EP-MEANS: an efficient nonparametric clustering of empirical probability distributions (KH, BG, TER), pp. 893–900.
- KDD-2012-HendersonGETBAKFL #graph #mining #named #scalability
- RolX: structural role extraction & mining in large graphs (KH, BG, TER, HT, SB, LA, DK, CF, LL), pp. 1231–1239.
- KDD-2011-HendersonGLAETF #graph #mining #recursion #using
- It’s who you know: graph mining using recursive structural features (KH, BG, LL, LA, TER, HT, CF), pp. 663–671.
- KDD-2010-HendersonEFALMPT #approach #forensics #graph #metric #mining #multi
- Metric forensics: a multi-level approach for mining volatile graphs (KH, TER, CF, LA, LL, KM, BAP, HT), pp. 163–172.
- SAC-2009-HendersonE #graph #scalability
- Applying latent dirichlet allocation to group discovery in large graphs (KH, TER), pp. 1456–1461.