Validating clusters with the lower bound for sum-of-squares error
From MaRDI portal
Publication:2517864
Recommendations
Cites work
- K-medoids and other criteria for crisp clustering
- A variable-selection heuristic for K-means clustering
- An Algorithm for Euclidean Sum of Squares Classification
- Applied Multivariate Analysis
- Combinatorial data analysis. Optimization by dynamic programming
- Estimating the number of clusters in a data set via the gap statistic
- Finding Groups in Data
- scientific article; zbMATH DE number 3942813 (Why is no real title available?)
- scientific article; zbMATH DE number 3678973 (Why is no real title available?)
- scientific article; zbMATH DE number 3469876 (Why is no real title available?)
- scientific article; zbMATH DE number 3579840 (Why is no real title available?)
- scientific article; zbMATH DE number 1348600 (Why is no real title available?)
- scientific article; zbMATH DE number 467196 (Why is no real title available?)
- scientific article; zbMATH DE number 1835269 (Why is no real title available?)
- scientific article; zbMATH DE number 1821111 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Note on Grouping
- OCLUS: an analytic method for generating clusters with known overlap
- On Grouping for Maximum Homogeneity
- Pattern classification.
- Pattern recognition by an adaptive process of sample set construction
Cited in
(2)
This page was built for publication: Validating clusters with the lower bound for sum-of-squares error
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2517864)