49 citations · 113 across the 20 of their papers we have counts for
24 papers
Nearly-Optimal Hierarchical Clustering for Well-Clustered Graphs
Steinar Laenen, Bogdan-Adrian Manghiuc, He Sun
This paper presents two efficient hierarchical clustering (HC) algorithms with respect to Dasgupta's cost function. For any input graph with a clear cluster-structure, our desi…
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…
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\…
Hierarchical Clustering: -Approximation for Well-Clustered Graphs
Bogdan-Adrian Manghiuc, He Sun
Hierarchical clustering studies a recursive partition of a data set into clusters of successively smaller size, and is a fundamental problem in data analysis. In this work we study…
Local Algorithms for Finding Densely Connected Clusters
Peter Macgregor, He Sun
Local graph clustering is an important algorithmic technique for analysing massive graphs, and has been widely applied in many research fields of data science. While the objective…