A review on spectral clustering and stochastic block models
From MaRDI portal
Publication:2132025
DOI10.1007/s42952-021-00112-wzbMath1485.62077OpenAlexW3134792429MaRDI QIDQ2132025
Publication date: 27 April 2022
Published in: Journal of the Korean Statistical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s42952-021-00112-w
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Probabilistic graphical models (62H22)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Estimating the Number of Clusters in a Data Set Via the Gap Statistic
- Pseudo-likelihood methods for community detection in large sparse networks
- Impact of regularization on spectral clustering
- Selection of the number of clusters via the bootstrap method
- Spectral clustering and the high-dimensional stochastic blockmodel
- Automatically finding clusters in normalized cuts
- Finding good approximate vertex and edge partitions is NP-hard
- On semidefinite relaxations for the block model
- A nonparametric view of network models and Newman–Girvan and other modularities
- Consistent selection of the number of clusters via crossvalidation
- Model-Based Clustering, Discriminant Analysis, and Density Estimation
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Stability-Based Validation of Clustering Solutions
- A Sober Look at Clustering Stability
- Lower Bounds for the Partitioning of Graphs
- The elements of statistical learning. Data mining, inference, and prediction
This page was built for publication: A review on spectral clustering and stochastic block models