2 citations · 5 across the 12 of their papers we have counts for
4 papers · 1 filter
On Learning the Structure of Clusters in Graphs
Peter Macgregor
Graph clustering is a fundamental problem in unsupervised learning, with numerous applications in computer science and in analysing real-world data. In many real-world applications…
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…
Finding Bipartite Components in Hypergraphs
Peter Macgregor, He Sun
Hypergraphs are important objects to model ternary or higher-order relations of objects, and have a number of applications in analysing many complex datasets occurring in practice.…
Is the Algorithmic Kadison-Singer Problem Hard?
Ben Jourdan, Peter Macgregor, He Sun
We study the following problem: let be some constant, and be vectors such that for any $i\…