Research map / Learning theory and algorithms / Kernels and regression theory
Enhancing Kernel Power $K$-means: Scalable and Robust Clustering with Random Fourier Features and Possibilistic Method
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
- Refined Learning Bounds for Kernel and Approximate $k$-Means (NeurIPS 2021 · similarity 0.89)
- Optimal Neighborhood Kernel Clustering with Multiple Kernels (AAAI 2017 · similarity 0.89)
- Tight Kernel Query Complexity of Kernel Ridge Regression and Kernel $k$-means Clustering (ICML 2019 · similarity 0.89)
- Scalable Multiple Kernel Clustering: Learning Clustering Structure from Expectation (ICML 2024 · similarity 0.87)
- COKE: Core Kernel for More Efficient Approximation of Kernel Weights in Multiple Kernel Clustering (ICML 2025 · similarity 0.86)
- Incremental Nyström-based Multiple Kernel Clustering (AAAI 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.