15 citations · 19 across the 5 of their papers we have counts for
5 papers
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{…
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…
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…
On Episodes, Prototypical Networks, and Few-shot Learning
Steinar Laenen, Luca Bertinetto
Episodic learning is a popular practice among researchers and practitioners interested in few-shot learning. It consists of organising training in a series of learning problems (or…
Higher-Order Spectral Clustering of Directed Graphs
Steinar Laenen, He Sun
Clustering is an important topic in algorithms, and has a number of applications in machine learning, computer vision, statistics, and several other research disciplines. Tradition…