scientific article; zbMATH DE number 7053357
From MaRDI portal
Publication:5743480
Recommendations
- Approximation algorithms for projective clustering
- scientific article; zbMATH DE number 1445346
- Efficient approximation algorithms for clustering point-sets
- Linear-time approximation schemes for clustering problems in any dimensions
- Automata, Languages and Programming
- On cluster points of alternating projections
- Projected Gustafson-Kessel Clustering Algorithm and Its Convergence
- scientific article; zbMATH DE number 2069435
- Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space
- scientific article; zbMATH DE number 2065610
Cites work
- A PTAS for k-means clustering based on weak coresets
- A unified framework for approximating and clustering data
- Approximate clustering via core-sets
- Approximating extent measures of points.
- Bi-criteria linear-time approximations for generalized k-mean/median/center
- Coresets and sketches for high dimensional subspace approximation problems
- Coresets for Discrete Integration and Clustering
- Efficient subspace approximation algorithms
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Geometric optimization and sums of algebraic functions
- High-dimensional shape fitting in linear time
- How to get close to the median shape
- scientific article; zbMATH DE number 1947381 (Why is no real title available?)
- scientific article; zbMATH DE number 797449 (Why is no real title available?)
- scientific article; zbMATH DE number 5019895 (Why is no real title available?)
- Linear-time approximation schemes for clustering problems in any dimensions
- On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
- On coresets for k-means and k-median clustering
- Robust shape fitting via peeling and grating coresets
- Sampling Algorithms and Coresets for \ell_p Regression
- Sampling-based dimension reduction for subspace approximation
- Subgradient and sampling algorithms for _1 regression
- Universal \({\epsilon}\)-approximators for integrals
Cited in
(11)- Faster coreset construction for projective clustering via low-rank approximation
- Learning big (image) data via coresets for dictionaries
- On the sensitivity of shape fitting problems
- Core-sets: updated survey
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
- Projective clustering in high dimensions using core-sets
- Approximation algorithms for projective clustering
- scientific article; zbMATH DE number 1445346 (Why is no real title available?)
- On geometric prototype and applications
- A unified framework for approximating and clustering data
- Turning big data into tiny data: coresets for unsupervised learning problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743480)
