Exact Linear-Time Algorithm for Parameterized K-Means Problem with Optimized Number of Clusters in the 1D Case.
Alexander Kel'manovVladimir I. KhandeevPublished in: NUMTA (2) (2019)
Keyphrases
- k means
- cluster centers
- computational complexity
- fuzzy k means
- clustering algorithm
- dynamic programming
- spectral clustering
- expectation maximization
- cluster analysis
- hierarchical clustering
- data clustering
- worst case
- cluster validity
- preprocessing
- clustering method
- np hard
- memory requirements
- space complexity
- synthetic datasets
- cost function
- arbitrary shaped
- detection algorithm
- segmentation algorithm
- probabilistic model
- constrained clustering
- fuzzy clustering algorithm
- rough k means