Sublinear time approximate clustering
From MaRDI portal
Recommendations
Cited in
(18)- A sublinear-time approximation scheme for bin packing
- Quantum speed-up for unsupervised learning
- \(k\)-means genetic algorithms with greedy genetic operators
- A framework for statistical clustering with constant time approximation algorithms for \(K\)-median and \(K\)-means clustering
- Computing exact clustering posteriors with subset convolution
- Sublinear‐time approximation algorithms for clustering via random sampling
- Linear-time approximation schemes for clustering problems in any dimensions
- Agnostic clustering
- Testing of Clustering
- Sublinear-time Algorithms
- Approximation algorithms for stochastic clustering
- Automata, Languages and Programming
- scientific article; zbMATH DE number 7651177 (Why is no real title available?)
- Bi-criteria sublinear time algorithms for clustering with outliers in high dimensions
- Bi-criteria sublinear time algorithms for clustering with outliers in high dimensions
- A new conceptual clustering framework
- Small space representations for metric min-sum k-clustering and their applications
- Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
This page was built for publication: Sublinear time approximate clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768331)
