Search Results for author:
Found 1 papers, 0 papers with code
On Approximability of Clustering Problems Without Candidate Centers
In practice and historically, k-means is thought of in a continuous setting, namely where the centers can be located anywhere in the metric space.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
