Search Results for author:
Found 1 papers, 0 papers with code
Online k-means Clustering
The specific formulation we use is the $k$-means objective: At each time step the algorithm has to maintain a set of k candidate centers and the loss incurred is the squared distance between the new point and the closest center.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
