Improving Spectral Clustering Using the Asymptotic Value of the Normalized Cut

DOI10.1080/10618600.2019.1593180MaRDI QIDQ3391218zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Cites work

• 10.1162/153244303321897735
• Algorithm AS 136: A K-Means Clustering Algorithm
• An advancement in clustering via nonparametric density estimation
• Consistency of Cheeger and ratio graph cuts
• Data-driven density derivative estimation, with applications to nonparametric clustering and bump hunting
• Estimating the number of clusters in a data set via the gap statistic
• Generalized density clustering
• scientific article; zbMATH DE number 1333614 (Why is no real title available?)
• scientific article; zbMATH DE number 4001209 (Why is no real title available?)
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• The elements of statistical learning. Data mining, inference, and prediction

Cited in

(2)

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

Describes a project that uses

Uses Software

• pdfCluster
• AS 136
• clusfind
• R

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3391218)