On complexity of some problems of cluster analysis of vector sequences
DOI10.1134/S1990478913030095zbMATH Open1324.68047OpenAlexW2019101440MaRDI QIDQ5263810FDOQ5263810
Artem Pyatkin, A. V. Kel'manov
Publication date: 17 July 2015
Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1990478913030095
clusteringalgorithmic complexityEuclidean vector sequenceminimum sum of the squares of distancesrestriction on vector indices
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cited In (13)
- On the complexity of some cluster analysis problems
- A randomized algorithm for two-cluster partition of a set of vectors
- An approximation algorithm for a problem of partitioning a sequence into clusters with constraints on their cardinalities
- Complexity of the weighted max-cut in Euclidean space
- A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem
- An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors
- On the complexity of some Euclidean optimal summing problems
- Momentopes, the complexity of vector partitioning, and Davenport-Schinzel sequences
- Approximation algorithm for the problem of partitioning a sequence into clusters
- An approximation polynomial-time algorithm for a sequence bi-clustering problem
- On the complexity and approximability of some Euclidean optimal summing problems
- A randomized algorithm for a sequence 2-clustering problem
- Sequence spaces \(M(\phi)\) and \(N(\phi)\) with application in clustering
This page was built for publication: On complexity of some problems of cluster analysis of vector sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5263810)
