articleJul 13, 2013Closed access
SPECTRAL CLUSTERING AND THE HIGH-DIMENSIONAL STOCHASTIC BLOCKMODEL
University of California, Berkeley
Abstract
Networks or graphs can easily represent a diverse set of data sources that are characterized by interacting units or actors. Social networks, representing people who communicate with each other, are one example. Communities or clusters of highly connected actors form an essential feature in the structure of several empirical networks. Spectral clustering is a popular and computationally feasible method to discover these communities.The Stochastic Block Model (Holland et al., 1983) is a social network model with well defined communities; each node is a member of one community. For a network generated from the Stochastic Block Model, we bound the number of nodes "misclustered" by spectral clustering. The…
Citation impact
798
total citations
- FWCI
- 43.86
- Percentile
- 100%
- References
- 60
Citations per year
Authors
3Topics & keywords
Topics
Keywords
- Spectral clustering
- Cluster analysis
- Laplacian matrix
- Mathematics
- Eigenvalues and eigenvectors
- Theoretical computer science
- Clustering coefficient
- Stochastic block model
UN Sustainable Development Goals
- Reduced inequalities
No related works found for this paper.