2 citations · 3 across the 4 of their papers we have counts for
4 papers
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…
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…
Spectral Toolkit of Algorithms for Graphs: Technical Report (1)
Peter Macgregor, He Sun
Spectral Toolkit of Algorithms for Graphs (STAG) is an open-source library for efficient spectral graph algorithms, and its development starts in September 2022. We have so far fin…
A Tighter Analysis of Spectral Clustering, and Beyond
Peter Macgregor, He Sun
This work studies the classical spectral clustering algorithm which embeds the vertices of some graph into using eigenvectors of some matrix of $G…