On the discrepancy between Kleinberg's clustering axioms and \(k\)-means clustering algorithm behavior
From MaRDI portal
Publication:6134326
DOI10.1007/s10994-023-06308-xarXiv1702.04577OpenAlexW4322725973MaRDI QIDQ6134326
Robert A. Kłopotek, Mieczysław Kłopotek
Publication date: 22 August 2023
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.04577
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A feasible \(k\)-means kernel trick under non-Euclidean feature space
- Clustering algorithm consistency in fixed dimensional spaces
- A Survey of Statistical Network Models
- A local search approximation algorithm for k-means clustering
- The effectiveness of lloyd-type methods for the k-means problem
This page was built for publication: On the discrepancy between Kleinberg's clustering axioms and \(k\)-means clustering algorithm behavior