Author of the publication

Applying latent dirichlet allocation to group discovery in large graphs.

, and . SAC, page 1456-1461. ACM, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Applying latent dirichlet allocation to group discovery in large graphs., and . SAC, page 1456-1461. ACM, (2009)Ranking Information in Networks., and . SBP, volume 6589 of Lecture Notes in Computer Science, page 268-275. Springer, (2011)Literature Search through Mixed-Membership Community Discovery., and . SBP, volume 6007 of Lecture Notes in Computer Science, page 70-78. Springer, (2010)Metric forensics: a multi-level approach for mining volatile graphs., , , , , , , and . KDD, page 163-172. ACM, (2010)Computing Exact Vertex Eccentricity on Massive-Scale Distributed Graphs., , , and . CLUSTER, page 257-267. IEEE Computer Society, (2018)It's who you know: graph mining using recursive structural features., , , , , , and . KDD, page 663-671. ACM, (2011)RolX: structural role extraction & mining in large graphs., , , , , , , , and . KDD, page 1231-1239. ACM, (2012)HCDF: A Hybrid Community Discovery Framework., , , and . SDM, page 754-765. SIAM, (2010)EP-MEANS: an efficient nonparametric clustering of empirical probability distributions., , and . SAC, page 893-900. ACM, (2015)Role-dynamics: fast mining of large dynamic networks., , , and . WWW (Companion Volume), page 997-1006. ACM, (2012)