Search Results for author:
Found 2 papers, 2 papers with code
Breathing K-Means
For larger values of m, e. g., m = 20, breathing k-means likely is the new SOTA for the k-means problem.
The k-means-u* algorithm: non-local jumps and greedy retries improve k-means++ clustering
First we introduce the k-means-u algorithm which starts from a result of k-means++ and attempts to improve it with a sequence of non-local "jumps" alternated by runs of standard k-means.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
