The next‐generation K‐means algorithm
From MaRDI portal
Publication:4970423
DOI10.1002/sam.11379OpenAlexW2801677142WikidataQ64123093 ScholiaQ64123093MaRDI QIDQ4970423
Publication date: 14 October 2020
Published in: Statistical Analysis and Data Mining: The ASA Data Science Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/sam.11379
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Robust constrained fuzzy clustering
- Criteria for unconstrained global optimization
- On some significance tests in cluster analysis
- Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
- A fast algorithm for clusterwise linear regression
- A central limit theorem for k-means clustering
- Mixed Models
- Statistical Significance of Clustering for High-Dimension, Low–Sample Size Data
- Model-based linear clustering
- Linear Model Methodology
- A Criterion for Determining the Number of Groups in a Data Set Using Sum-of-Squares Clustering
- Asymptotic behaviour of classification maximum likelihood estimates
- Model-Based Gaussian and Non-Gaussian Clustering
- Multivariate linear regression for heterogeneous data
- Mixture Model-Based Classification
- Testing Statistical Hypotheses
- Center-based l1–clustering method
- On clustering validation techniques
- Statistical Significance for Hierarchical Clustering
This page was built for publication: The next‐generation K‐means algorithm