Coresets for kernel clustering
From MaRDI portal
Recommendations
- A FAST k-MEANS IMPLEMENTATION USING CORESETS
- On coresets for k-means and k-median clustering
- Near-optimal coresets of kernel density estimates
- A streaming algorithm for k-means with approximate coreset
- Turning big data into tiny data: constant-size coresets for k-means, PCA and projective clustering
Cites work
- A new coreset framework for clustering
- A PTAS for k-means clustering based on weak coresets
- A unified framework for approximating and clustering data
- Comparing distributions and shapes using the kernel distance
- Coresets for clustering in Euclidean spaces: importance sampling is nearly optimal
- Coresets for clustering in excluded-minor graphs and beyond
- scientific article; zbMATH DE number 6381735 (Why is no real title available?)
- scientific article; zbMATH DE number 6999914 (Why is no real title available?)
- Oblivious dimension reduction for \(k\)-means: beyond subspaces and the Johnson-Lindenstrauss lemma
- On coresets for k-means and k-median clustering
- Scalable kernel \(k\)-means clustering with Nyström approximation: relative-error bounds
- Scikit-learn: machine learning in Python
- Sublinear‐time approximation algorithms for clustering via random sampling
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
- Universal \({\epsilon}\)-approximators for integrals
This page was built for publication: Coresets for kernel clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6613883)
