Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem
- 1 February 2016
- journal article
- Published by Pleiades Publishing Ltd in Computational Mathematics and Mathematical Physics
- Vol. 56 (2), 334-341
- https://doi.org/10.1134/s0965542516020111
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- A randomized algorithm for two-cluster partition of a set of vectorsComputational Mathematics and Mathematical Physics, 2015
- An Introduction to Statistical LearningPublished by Springer Science and Business Media LLC ,2013
- Machine LearningPublished by Cambridge University Press (CUP) ,2012
- An approximation algorithm for solving a problem of cluster analysisJournal of Applied and Industrial Mathematics, 2011
- Data clustering: 50 years beyond K-meansPattern Recognition Letters, 2009
- NP-hardness of Euclidean sum-of-squares clusteringMachine Learning, 2009
- Off-line detection of a quasi-periodically recurring fragment in a numerical sequenceProceedings of the Steklov Institute of Mathematics, 2008
- On the complexity of a search for a subset of “similar” vectorsDoklady Mathematics, 2008
- A posteriori detecting a quasiperiodic fragment in a numerical sequencePattern Recognition and Image Analysis, 2008
- Cluster Analysis and Mathematical ProgrammingJournal of the American Statistical Association, 1971