IADIS AC · 2005 · 169 citations · 13 references
ComputingVisualizationGraph VisualizationKnowledge NetworksNetwork VisualizationCommunity DetectionCommunity StructureGraph AlgorithmsGraph MiningGraph TheoryNetwork CentralityDensityNetwork Community DetectionNetwork Community StructureOverlapping Community DetectionSubgraph ExtractionSubgraph Isomorphism
We present a new approach to the problem of finding communities: a community is a subset of actors who induce a locally optimal subgraph with respect to a density function defined on subsets of actors. Two different subsets with significant overlap can both be locally optimal, and in this way we may obtain overlapping communities. We design, implement, and test two novel efficient algorithms, RaRe and IS, which find communities according to our definition. These algorithms are shown to work effectively on both synthetic and real-world graphs, and also are shown to outperform a well-known k-neighborhood heuristic.
13
The Structure and Function of Complex Networks
Michael Newman · SIAM Review · 2003 · 18.7K citations · Full text
The PageRank Citation Ranking : Bringing Order to the Web
Lawrence M. Page, Sergey Brin, Rajeev Motwani et al. · 1999 · 12.7K citations
Finding groups in data: an introduction to cluster analysis
Choice Reviews Online · 1991 · 10.6K citations
Algorithms for Clustering Data
Warren S. Sarle, Anil K. Jain, Richard C. Dubes · Technometrics · 1990 · 7.8K citations