Fast algorithm for detecting community structure in networks.
TLDR
An algorithm is described which gives excellent results when tested on both computer-generated and real-world networks and is much faster, typically thousands of times faster, than previous algorithms.Abstract:
Many networks display community structure--groups of vertices within which connections are dense but between which they are sparser--and sensitive computer algorithms have in recent years been developed for detecting this structure. These algorithms, however, are computationally demanding, which limits their application to small networks. Here we describe an algorithm which gives excellent results when tested on both computer-generated and real-world networks and is much faster, typically thousands of times faster, than previous algorithms. We give several example applications, including one to a collaboration network of more than 50,000 physicists.read more
Citations
More filters
Journal ArticleDOI
Automated sub-zoning of water distribution systems
TL;DR: In this article, the authors compared the performance of three classes of unsupervised learning algorithms from graph theory for practical sub-zoning of WDS: global clustering, community structure and graph partitioning.
Journal ArticleDOI
Community Discovery Method in Networks Based on Topological Potential: Community Discovery Method in Networks Based on Topological Potential
Posted Content
Metrics for Community Analysis: A Survey
TL;DR: A comprehensive and structured overview of the start-of-the-art metrics used for the detection and the evaluation of community structure and conducts experiments on synthetic and real-world networks to present a comparative analysis of these metrics in measuring the goodness of the underlying community structure.
Book ChapterDOI
A novel similarity-based modularity function for graph partitioning
TL;DR: This paper proposes a novel similarity-based definition of the quality of a partitioning of a graph and demonstrates that this definition largely overcomes the "hub" problem and outperforms existing approaches on complicated graphs.
Proceedings ArticleDOI
Unsupervised Word Acquisition from Speech using Pattern Discovery
Alex Park,James Glass +1 more
TL;DR: An unsupervised method for automatically discovering words from speech using a combination of acoustic pattern discovery, graph clustering, and baseform searching that may prove useful for applications such as vocabulary initialization, speech summarization, or augmentation of existing recognition systems.
References
More filters
疟原虫var基因转换速率变化导致抗原变异[英]／Paul H, Robert P, Christodoulou Z, et al//Proc Natl Acad Sci U S A
TL;DR: PfPMP1）与感染红细胞、树突状组胞以及胎盘的单个或多个受体作用，在黏附及免疫逃避中起关键的作�ly.
Journal ArticleDOI
Statistical mechanics of complex networks
TL;DR: In this paper, a simple model based on the power-law degree distribution of real networks was proposed, which was able to reproduce the power law degree distribution in real networks and to capture the evolution of networks, not just their static topology.
Journal ArticleDOI
The Structure and Function of Complex Networks
TL;DR: Developments in this field are reviewed, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.
Journal ArticleDOI
Community structure in social and biological networks
Michelle Girvan,Mark Newman +1 more
TL;DR: This article proposes a method for detecting communities, built around the idea of using centrality indices to find community boundaries, and tests it on computer-generated and real-world graphs whose community structure is already known and finds that the method detects this known structure with high sensitivity and reliability.
Journal ArticleDOI
Finding and evaluating community structure in networks.
TL;DR: It is demonstrated that the algorithms proposed are highly effective at discovering community structure in both computer-generated and real-world network data, and can be used to shed light on the sometimes dauntingly complex structure of networked systems.