19 citations · 23 across the 13 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2020
Weighted Cheeger and Buser Inequalities, with Applications to Clustering and Cutting Probability Densities
Timothy Chu, Gary L. Miller, Noel J. Walkington +1
In this paper, we show how sparse or isoperimetric cuts of a probability density function relate to Cheeger cuts of its principal eigenfunction, for appropriate definitions of `spa…
cs.LG2017
Clustering Stable Instances of Euclidean k-means
Abhratanu Dutta, Aravindan Vijayaraghavan, Alex Wang
The Euclidean k-means problem is arguably the most widely-studied clustering problem in machine learning. While the k-means objective is NP-hard in the worst-case, practitioners ha…