Peter Macgregor

most citedA Tighter Analysis of Spectral Clustering, and Beyond

2 citations · 3 across the 4 of their papers we have counts for

collaborators

Showing cs.DSShow all

4 papers · 1 filter

cs.DS2024

Polynomial-Time Algorithms for Weaver's Discrepancy Problem in a Dense Regime

Ben Jourdan, Peter Macgregor, He Sun

Given $v_{1}, \dots, v_{m} \in C^{d}$ with $∥ v_{i} ∥^{2} = α$ for all $i \in [m]$ as input and suppose $\sum_{i = 1}^{m} ∣ ⟨ u, v_{i} ⟩ ∣^{2} = 1$ for every unit vector $u\in\mathbb…

cs.DS2023

Fast Approximation of Similarity Graphs with Kernel Density Estimation

Peter Macgregor, He Sun

Constructing a similarity graph from a set $X$ of data points in $R^{d}$ 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 $k$ clusters in a graph $G$ . In the classical spectral clustering algorithm, the vertices of $G$ are embed…

cs.DS2022★ 2 cited

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 $G = (V_{G}, E_{G})$ into $R^{k}$ using $k$ eigenvectors of some matrix of $G…