Sciweavers

KDD
2009
ACM
182views Data Mining» more  KDD 2009»
15 years 2 days ago
Scalable graph clustering using stochastic flows: applications to community discovery
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...
Venu Satuluri, Srinivasan Parthasarathy