15 citations · 19 across the 5 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2025
Dynamic Similarity Graph Construction with Kernel Density Estimation
Steinar Laenen, Peter Macgregor, He Sun
In the kernel density estimation (KDE) problem, we are given a set of data points in , a kernel function $k: \mathbb{R}^d \times \mathbb{R}^d \rightarrow \mathbb{…
cs.DS2024
Dynamic Spectral Clustering with Provable Approximation Guarantee
Steinar Laenen, He Sun
This paper studies clustering algorithms for dynamically evolving graphs , in which new edges (and potential new vertices) are added into a graph, and the underlying clust…
cs.DS2023★ 2 cited
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…