Improving Spectral Clustering Using the Asymptotic Value of the Normalized Cut

DOI10.1080/10618600.2019.1593180OpenAlexW3100549952WikidataQ128194922 ScholiaQ128194922MaRDI QIDQ3391218

David P. Hofmeyr

Publication date: 28 March 2022

Published in: Journal of Computational and Graphical Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.09975

zbMATH Keywords

cluster number determinationlow density separationself-tuning clustering

Mathematics Subject Classification ID

Statistics (62-XX)

Related Items (2)

Latent structure blockmodels for Bayesian spectral graph clustering ⋮ Learning low-dimensional nonlinear structures from high-dimensional noisy data: an integral operator approach

Uses Software

• R
• AS 136
• pdfCluster
• clusfind

Cites Work

• Unnamed Item
• Unnamed Item
• Estimating the Number of Clusters in a Data Set Via the Gap Statistic
• Algorithm AS 136: A K-Means Clustering Algorithm
• Generalized density clustering
• An advancement in clustering via nonparametric density estimation
• Data-driven density derivative estimation, with applications to nonparametric clustering and bump hunting
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Consistency of Cheeger and Ratio Graph Cuts
• 10.1162/153244303321897735
• The elements of statistical learning. Data mining, inference, and prediction

This page was built for publication: Improving Spectral Clustering Using the Asymptotic Value of the Normalized Cut