Neural node embeddings have recently emerged as a powerful representation for supervised learning tasks involving graph-structured data. We leverage this recent advance to develop a novel algorithm for unsupervised community discovery in graphs. Through extensive experimental studies on simulated and real-world data, we demonstrate that the proposed approach consistently improves over the current state-of-the-art. Specifically, our approach empirically attains the information-theoretic limits for community recovery under the benchmark stochastic block models for graph generation and exhibits better stability and accuracy over both spectral clustering and acyclic belief propagation in the community recovery limits.
Node Embedding via Word Embedding for Network Community Discovery
Weicong Ding,Christy Lin,P. Ishwar
Published 2016 in IEEE Transactions on Signal and Information Processing over Networks
ABSTRACT
PUBLICATION RECORD
- Publication year
2016
- Venue
IEEE Transactions on Signal and Information Processing over Networks
- Publication date
2016-11-09
- Fields of study
Mathematics, Physics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-45 of 45 references · Page 1 of 1
CITED BY
Showing 1-17 of 17 citing papers · Page 1 of 1