Coresets for kernel clustering
- 22 April 2024
- journal article
- research article
- Published by Springer Nature in Machine Learning
- Vol. 113 (8) , 5891-5906
Abstract
No abstract availableKeywords
All Related Versions
This publication has 24 references indexed in Scilit:
- Coresets for Clustering in Excluded-minor Graphs and Beyond2021
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective ClusteringSIAM Journal on Computing, 2020
- Strong Coresets for k-Median and Subspace Approximation: Goodbye Dimension2018
- Efficient Kernel Clustering Using Random Fourier Features2012
- Universal ε-approximators for integrals2010
- Sublinear‐time approximation algorithms for clustering via random samplingRandom Structures & Algorithms, 2006
- Evaluation of the performance of clustering algorithms in kernel-induced feature spacePattern Recognition, 2005
- Nonnegative Lagrangian Relaxation of K-Means and Spectral Clustering2005
- A large scale clustering scheme for kernel K-Means2003
- Mercer kernel-based clustering in feature spaceIEEE Transactions on Neural Networks, 2002