An Iterative Randomized Rounding Algorithm for the k-Clustering Minimum Completion Problem with an Application in Telecommunication Field.
Mhand HifiShohre SadeghsaPublished in: SAI (1) (2021)
Keyphrases
- k means
- dynamic programming
- detection algorithm
- learning algorithm
- clustering algorithm
- cost function
- linear programming
- iterative optimization
- distance metric
- matching algorithm
- computational cost
- preprocessing
- experimental evaluation
- np hard
- clustering method
- square error
- synthetic and real datasets
- knapsack problem
- hierarchical clustering
- search algorithm
- simulated annealing
- high accuracy
- worst case
- optimization algorithm
- expectation maximization
- particle swarm optimization
- data clustering
- neural network
- synthetic datasets
- decision trees