Coresets for kernel clustering

DOI10.1007/s10994-024-06540-zzbMath1548.68192MaRDI QIDQ6613883

Yubo Zhang, Shaofeng H.-C. Jiang, Jianing Lou, Robert Krauthgamer

Publication date: 3 October 2024

Published in: Machine Learning (Search for Journal in Brave)

zbMATH Keywords

clusteringkernel methodPTAScoreset

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
• Sublinear‐time approximation algorithms for clustering via random sampling
• On coresets for k-means and k-median clustering
• A PTAS for k-means clustering based on weak coresets
• Coresets for clustering in Euclidean spaces: importance sampling is nearly optimal
• Oblivious dimension reduction for k -means: beyond subspaces and the Johnson-Lindenstrauss lemma
• Comparing distributions and shapes using the kernel distance
• A unified framework for approximating and clustering data
• A new coreset framework for clustering

This page was built for publication: Coresets for kernel clustering