A randomized algorithm for a sequence 2-clustering problem

DOI10.1134/S0965542518120138zbMath1423.68584OpenAlexW2913603022MaRDI QIDQ2420934

Alexander Kel'Manov, Vladimir Khandeev, Sergey Khamidullin

Publication date: 7 June 2019

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0965542518120138

zbMATH Keywords

partitioningasymptotic accuracyrandomized algorithmNP-hardnesssequenceeuclidean spaceminimum sum-of-squared distances

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Randomized algorithms (68W20)

Uses Software

• PRMLT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An approximation polynomial-time algorithm for a sequence bi-clustering problem
• Off-line detection of a quasi-periodically recurring fragment in a numerical sequence
• Posterior detection of a given number of identical subsequences in a quasi-periodic sequence
• A randomized algorithm for two-cluster partition of a set of vectors
• Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem
• Complexity of certain problems of searching for subsets of vectors and cluster analysis
• A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem
• On complexity of some problems of cluster analysis of vector sequences
• An approximating polynomial algorithm for a sequence partitioning problem
• A Posteriori Joint Detection and Discrimination of Pulses in a Quasiperiodic Pulse Train

This page was built for publication: A randomized algorithm for a sequence 2-clustering problem