Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space
From MaRDI portal
Publication:2332640
Recommendations
- A randomized algorithm for two-cluster partition of a set of vectors
- On the complexity of some quadratic Euclidean 2-clustering problems
- A randomized algorithm for a sequence 2-clustering problem
- NP-hardness of some quadratic Euclidean 2-clustering problems
- On the complexity of some Euclidean problems of partitioning a finite set of points
Cites work
- A fully polynomial-time approximation scheme for a special case of a balanced 2-clustering problem
- A randomized algorithm for two-cluster partition of a set of vectors
- An approximation scheme for a problem of search for a vector subset
- An FPTAS for a vector subset search problem
- An introduction to statistical learning. With applications in R
- Approximation scheme for the problem of weighted 2-clustering with a fixed center of one cluster
- Data mining. The textbook
- Deep learning
- Finding k points with minimum diameter and related problems
- scientific article; zbMATH DE number 3584897 (Why is no real title available?)
- scientific article; zbMATH DE number 3617544 (Why is no real title available?)
- NP-completeness of some problems of a vectors subset choice
- NP-hardness of some quadratic Euclidean 2-clustering problems
- On the complexity of some quadratic Euclidean 2-clustering problems
- P-Complete Approximation Problems
- Pattern recognition and machine learning.
- Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center
- Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems
- Robust methods for data reduction
- Solving some vector subset problems by Voronoi diagrams
Cited in
(5)- An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors
- A randomized algorithm for two-cluster partition of a set of vectors
- Randomized Algorithm of Finding the True Number of Clusters Based on Chebychev Polynomial Approximation
- scientific article; zbMATH DE number 7053357 (Why is no real title available?)
- Efficient approximation algorithms for clustering point-sets
This page was built for publication: Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2332640)
