OPTIMALITY OF SPECTRAL CLUSTERING IN THE GAUSSIAN MIXTURE MODEL
成果类型:
Article
署名作者:
Loeffler, Matthias; Zhang, Anderson Y.; Zhou, Harrison H.
署名单位:
Swiss Federal Institutes of Technology Domain; ETH Zurich; University of Pennsylvania; Yale University
刊物名称:
ANNALS OF STATISTICS
ISSN/ISSBN:
0090-5364
DOI:
10.1214/20-AOS2044
发表日期:
2021
页码:
2506-2530
关键词:
Community Detection
algorithm
Consistency
asymptotics
matrices
number
graphs
forms
摘要:
Spectral clustering is one of the most popular algorithms to group high-dimensional data. It is easy to implement and computationally efficient. Despite its popularity and successful applications, its theoretical properties have not been fully understood. In this paper, we show that spectral clustering is minimax optimal in the Gaussian mixture model with isotropic covariance matrix, when the number of clusters is fixed and the signal-to-noise ratio is large enough. Spectral gap conditions are widely assumed in the literature to analyze spectral clustering. On the contrary, these conditions are not needed to establish optimality of spectral clustering in this paper.