Approximation algorithms for projective clustering
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1445346
- scientific article; zbMATH DE number 7053357
- Approximation schemes for clustering problems
- scientific article; zbMATH DE number 2069435
- Exact and approximation algorithms for clustering
- scientific article; zbMATH DE number 1629976
- An approximation algorithm for a problem of cluster analysis
- Approximation algorithms for min-sum \(p\)-clustering
- scientific article; zbMATH DE number 1303609
- Approximation algorithms for stochastic clustering
Cited in
(15)- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Dynamic coresets
- scientific article; zbMATH DE number 7053357 (Why is no real title available?)
- A two-phase heuristic for the bottleneck \(k\)-hyperplane clustering problem
- Almost optimal solutions to \(k\)-clustering problems
- Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem
- scientific article; zbMATH DE number 1947381 (Why is no real title available?)
- scientific article; zbMATH DE number 7662168 (Why is no real title available?)
- Projective clustering in high dimensions using core-sets
- Projected Gustafson-Kessel Clustering Algorithm and Its Convergence
- scientific article; zbMATH DE number 1445346 (Why is no real title available?)
- Approximation algorithms for orthogonal line centers
- Core-sets: updated survey
- Minimum-width double-slabs and widest empty slabs in high dimensions
- Approximation algorithms for orthogonal line centers
This page was built for publication: Approximation algorithms for projective clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4808316)
