Research map / Learning theory and algorithms / Clustering

Boosting Spectral Clustering on Incomplete Data via Kernel Correction and Affinity Learning

NeurIPS 2023 · Learning theory and algorithms › Clustering · approach: Subspace clustering

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

• A Simple Approach to Automated Spectral Clustering (NeurIPS 2022 · similarity 0.88)
• RS3CIS: Robust Single-Step Spectral Clustering with Intrinsic Subspace (AAAI 2019 · similarity 0.88)
• One-Step Spectral Clustering via Dynamically Learning Affinity Matrix and Subspace (AAAI 2017 · similarity 0.88)
• Highly Efficient Rotation-Invariant Spectral Embedding for Scalable Incomplete Multi-View Clustering (AAAI 2025 · similarity 0.86)
• Low-Rank Kernel Tensor Learning for Incomplete Multi-View Clustering (AAAI 2024 · similarity 0.85)
• Equivalence between Graph Spectral Clustering and Column Subset Selection (Student Abstract) (AAAI 2024 · similarity 0.85)