16 search results - page 1 / 4 » Scalable graph clustering using stochastic flows: applicatio... |
KDD
2009
ACM
14 years 5 months ago
2009
ACM
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...
PVLDB
2010
13 years 3 months ago
2010
The identification of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ...
KDD
2009
ACM
13 years 9 months ago
2009
ACM
This paper aims at discovering community structure in rich media social networks, through analysis of time-varying, multi-relational data. Community structure represents the laten...
CIKM
2008
Springer
13 years 6 months ago
2008
Springer
Every piece of textual data is generated as a method to convey its authors' opinion regarding specific topics. Authors deliberately organize their writings and create links, ...
CCS
2009
ACM
14 years 5 months ago
2009
ACM
Botnets are networks of compromised computers infected with malicious code that can be controlled remotely under a common command and control (C&C) channel. Recognized as one ...