Worst-case and smoothed analysis of k-means clustering with Bregman divergences
From MaRDI portal
Publication:2968098
DOI10.20382/jocg.v4i1a5zbMath1404.68197OpenAlexW2166752738MaRDI QIDQ2968098
Publication date: 9 March 2017
Full work available at URL: https://doi.org/10.20382/jocg.v4i1a5
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Measures of information, entropy (94A17) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic, Smoothed Analysis of Local Search Algorithms, Clustering in Hilbert’s Projective Geometry: The Case Studies of the Probability Simplex and the Elliptope of Correlation Matrices