Steinar Laenen
5 papers · 2020–2025 · 2 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓
🌍
Conference Polyglot · Bronze
🏃
Academic Marathon · Sprint
🌉
Interdisciplinary Bridge · Silver
🗺️
Taxonomy Completionist
(11)
Venues
Research topics
Keywords
spectral clustering
(3)
graph clustering
(2)
cluster structure
(2)
episodic learning
(1)
hierarchical clustering
(1)
nearest neighbor
(1)
sparse approximation
(1)
clustering quality
(1)
kernel density estimation
(1)
directed graph
(1)
approximation algorithm
(1)
dynamic graph
(1)
approximation guarantee
(1)
dasgupta cost
(1)
dynamic data structure
(1)
prototypical network
(1)
similarity graph
(1)
matching network
(1)
nearest neighbour
(1)
query time
(1)
Papers
Dynamic Similarity Graph Construction with Kernel Density Estimation
ICML 2025
Dynamic Spectral Clustering with Provable Approximation Guarantee
ICML 2024
Nearly-Optimal Hierarchical Clustering for Well-Clustered Graphs
ICML 2023
On Episodes, Prototypical Networks, and Few-Shot Learning
NeurIPS 2021
Higher-Order Spectral Clustering of Directed Graphs
NeurIPS 2020