Adaptation of the Rounding Search-Based Algorithm for the k-Clustering Minimum Completion Problem.
Mhand HifiShohre SadeghsaPublished in: CoDIT (2020)
Keyphrases
- k means
- search space
- clustering method
- optimal solution
- search strategy
- learning algorithm
- hierarchical clustering
- search algorithm
- cost function
- linear programming
- data clustering
- computational cost
- dynamic programming
- worst case
- np hard
- expectation maximization
- detection algorithm
- probabilistic model
- preprocessing
- square error
- similarity measure
- search results clustering
- synthetic datasets
- search efficiency
- fine tuning
- search procedure
- neural network
- convergence rate
- input data
- high dimensional
- computational complexity
- data structure
- genetic algorithm