Research map / Learning theory and algorithms / Clustering
Adaptive Clustering Using Kernel Density Estimators
Ingo Steinwart, Bharath K. Sriperumbudur, Philipp Thomann
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- DBSCAN: Optimal Rates For Density-Based Cluster Estimation (JMLR 2019 · similarity 0.90)
- Kernel Clustering: Density Biases and Solutions (TPAMI 2017 · similarity 0.90)
- Scalable Multiple Kernel Clustering: Learning Clustering Structure from Expectation (ICML 2024 · similarity 0.88)
- Dynamic Similarity Graph Construction with Kernel Density Estimation (ICML 2025 · similarity 0.87)
- Clustering with Non-adaptive Subset Queries (NeurIPS 2024 · similarity 0.86)
- COKE: Core Kernel for More Efficient Approximation of Kernel Weights in Multiple Kernel Clustering (ICML 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
