Coresets for Kernel Clustering
Shaofeng H.-C. Jiang, Robert Krauthgamer, Jianing Lou, Yubo, Zhang

TL;DR
This paper introduces a new coreset construction for kernel k-Means clustering that reduces computational complexity, enabling faster algorithms with maintained accuracy for non-linear clustering tasks.
Contribution
It presents a general, size-efficient coreset for kernel k-Means that improves upon previous results and can be constructed in near-linear time, facilitating faster clustering algorithms.
Findings
Coreset size is polynomial in k and 1/ε.
Algorithms achieve near-linear time complexity.
Coresets enable faster kernel k-Means++ and spectral clustering.
Abstract
We devise coresets for kernel -Means with a general kernel, and use them to obtain new, more efficient, algorithms. Kernel -Means has superior clustering capability compared to classical -Means, particularly when clusters are non-linearly separable, but it also introduces significant computational challenges. We address this computational issue by constructing a coreset, which is a reduced dataset that accurately preserves the clustering costs. Our main result is a coreset for kernel -Means that works for a general kernel and has size . Our new coreset both generalizes and greatly improves all previous results; moreover, it can be constructed in time near-linear in . This result immediately implies new algorithms for kernel -Means, such as a -approximation in time near-linear in , and a streaming algorithm using space…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Machine Learning and ELM · Stochastic Gradient Optimization Techniques
