25 citations · 71 across the 13 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2023★ 1 cited
Spectral Clustering on Large Datasets: When Does it Work? Theory from Continuous Clustering and Density Cheeger-Buser
Timothy Chu, Gary Miller, Noel Walkington
Spectral clustering is one of the most popular clustering algorithms that has stood the test of time. It is simple to describe, can be implemented using standard linear algebra, an…
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…