A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem
From MaRDI portal
Publication:3186861
DOI10.1134/S199047891602006XzbMath1349.62274OpenAlexW2400745965MaRDI QIDQ3186861
Vladimir Khandeev, Alexander Kel'Manov, Sergey Khamidullin
Publication date: 12 August 2016
Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s199047891602006x
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms and problem complexity (68Q25)
Related Items (2)
A randomized algorithm for a sequence 2-clustering problem ⋮ An approximation algorithm for a problem of partitioning a sequence into clusters with constraints on their cardinalities
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- NP-hardness of Euclidean sum-of-squares clustering
- 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
- Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters
- Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem
- Machine Learning
- On the complexity of some cluster analysis problems
- Complexity of certain problems of searching for subsets of vectors and cluster analysis
- On the complexity of some data analysis problems
- An Introduction to Statistical Learning
- On complexity of some problems of cluster analysis of vector sequences
- An approximating polynomial algorithm for a sequence partitioning problem
- An FPTAS for a vector subset search problem
- A Posteriori Joint Detection and Discrimination of Pulses in a Quasiperiodic Pulse Train
This page was built for publication: A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem
