Research map / Learning theory and algorithms / Clustering

Fast Approximation of Similarity Graphs with Kernel Density Estimation

NeurIPS 2023 · Learning theory and algorithms › Clustering · approach: Spectral clustering algorithms · 1 citations (OpenAlex)

Read the paperCheck your idea against 108,967 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

• Dynamic Similarity Graph Construction with Kernel Density Estimation (ICML 2025 · similarity 0.92)
• Twin Learning for Similarity and Clustering: A Unified Kernel Approach (AAAI 2017 · similarity 0.90)
• Hierarchical Clustering: $O(1)$-Approximation for Well-Clustered Graphs (NeurIPS 2021 · similarity 0.89)
• COKE: Core Kernel for More Efficient Approximation of Kernel Weights in Multiple Kernel Clustering (ICML 2025 · similarity 0.88)
• Graph Minimum Factor Distance and Its Application to Large-Scale Graph Data Clustering (ICML 2025 · similarity 0.87)
• Scalable Multiple Kernel Clustering: Learning Clustering Structure from Expectation (ICML 2024 · similarity 0.86)