2 citations · 5 across the 12 of their papers we have counts for
Showing 2023 · cs.DSShow all
2 papers · 2 filters
cs.DS2023
Fast Approximation of Similarity Graphs with Kernel Density Estimation
Peter Macgregor, He Sun
Constructing a similarity graph from a set of data points in is the first step of many modern clustering algorithms. However, typical constructions of a similari…
cs.DS2023★ 1 cited
Fast and Simple Spectral Clustering in Theory and Practice
Peter Macgregor
Spectral clustering is a popular and effective algorithm designed to find clusters in a graph . In the classical spectral clustering algorithm, the vertices of are embed…