k-MLE, k-Bregman, k-VARs: Theory, Convergence, Computation

2024/09/11 by Zuogong Yue, Yue, Zuogong, Victor Solo +1
Computer Science · #Anomaly Detection Techniques and Applications

paper · pdf · doi:10.48550/arxiv.2409.06938

Abstract

We develop hard clustering based on likelihood rather than distance and prove convergence. We also provide simulations and real data examples.

Related

• Big-Data Clustering: K-Means or K-Indicators?
• Asymptotics for The k-means
• Optimal interval clustering: Application to Bregman clustering and statistical mixture learning
• The k-means-u* algorithm: non-local jumps and greedy retries improve k-means++ clustering
• Probably certifiably correct k-means clustering