k-MLE, k-Bregman, k-VARs: Theory, Convergence, Computation
Abstract
We develop hard clustering based on likelihood rather than distance and prove convergence. We also provide simulations and real data examples.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.