Research map / Learning theory and algorithms / Clustering
Efficient Incomplete Multiple Kernel Clustering With Approximation Theoretical Guarantees
Weixuan Liang, Yi Zhang, Xuesong Xu, Xiaolong Li, Ke Liang, sihang zhou, Jiyuan Liu, Xinwang Liu
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
- Multiple Kernel k-Means with Incomplete Kernels (AAAI 2017 · similarity 0.93)
- Incomplete Multiple Kernel Alignment Maximization for Clustering (TPAMI 2021 · similarity 0.93)
- COKE: Core Kernel for More Efficient Approximation of Kernel Weights in Multiple Kernel Clustering (ICML 2025 · similarity 0.91)
- Incremental Nyström-based Multiple Kernel Clustering (AAAI 2025 · similarity 0.91)
- Scalable Multiple Kernel Clustering: Learning Clustering Structure from Expectation (ICML 2024 · similarity 0.89)
- Low-Rank Kernel Tensor Learning for Incomplete Multi-View Clustering (AAAI 2024 · similarity 0.89)
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.
