High-Dimensional Wide Gap k-Means Versus Clustering Axioms

2022/11/30 by Mieczysław A. Kłopotek, Kłopotek, Mieczysław A.
Computer Science · #Face and Expression Recognition #Advanced Clustering Algorithms Research #Data Management and Algorithms

paper · pdf · doi:10.48550/arxiv.2211.17036

Abstract

Kleinberg's axioms for distance based clustering proved to be contradictory. Various efforts have been made to overcome this problem. Here we make an attempt to handle the issue by embedding in high-dimensional space and granting wide gaps between clusters.

Related

• Wide Gaps and Clustering Axioms
• On the Discrepancy Between Kleinberg's Clustering Axioms and k-Means Clustering Algorithm Behavior
• The k-means-u* algorithm: non-local jumps and greedy retries improve k-means++ clustering
• Clustering Based on Pairwise Distances When the Data is of Mixed Dimensions
• An Objective for Hierarchical Clustering in Euclidean Space and its Connection to Bisecting K-means