Wide gaps and Kleinberg's clustering axioms for k-means

DOI10.61822/AMCS-2024-0010MaRDI QIDQ6567108zbMATH OpenFDO

Authors Mieczysław Kłopotek

Publication date 4 July 2024

Published in International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

zbMATH Keywords

clusterabilityclustering axiomsclustering theory

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Computational aspects of data analysis and big data (68T09)

Recommendations

• On the discrepancy between Kleinberg's clustering axioms and \(k\)-means clustering algorithm behavior
• Clustering algorithm consistency in fixed dimensional spaces
• In-The-Limit Clustering Axioms
• Good (K-means) clusterings are unique (up to small perturbations)
• Stability of k-Means Clustering

Cites work

• scientific article; zbMATH DE number 6381735 (Why is no real title available?)
• A feasible \(k\)-means kernel trick under non-Euclidean feature space
• Axioms for graph clustering quality functions
• Center-based \(l_1\)-clustering method
• Clustering based on eigenvectors of the adjacency matrix
• GrDBSCAN: a granular density-based clustering algorithm
• Hierarchical clustering: objective functions and algorithms
• On the discrepancy between Kleinberg's clustering axioms and \(k\)-means clustering algorithm behavior
• Richness fallacy
• Some boundary conditions for a monotone analysis of symmetric matrices
• The analytical solution of the additive constant problem
• The effectiveness of Lloyd-type methods for the \(k\)-means problem

Cited in

(1)

• On the discrepancy between Kleinberg's clustering axioms and \(k\)-means clustering algorithm behavior

This page was built for publication: Wide gaps and Kleinberg's clustering axioms for \(k\)-means

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