Distributed random swap: An efficient algorithm for minimum sum-of-squares clustering.
Olzhas KozbagarovRustam MussabayevPublished in: Inf. Sci. (2024)
Keyphrases
- learning algorithm
- dynamic programming
- times faster
- cost function
- detection algorithm
- computationally efficient
- preprocessing
- computational cost
- experimental evaluation
- high accuracy
- significant improvement
- particle swarm optimization
- cooperative
- clustering method
- classification algorithm
- randomly generated
- data sets
- locally optimal
- np hard
- search space
- search algorithm
- multi agent
- genetic algorithm
- worst case
- memory efficient
- single pass
- estimation algorithm
- decision trees
- multi robot
- memory requirements
- similarity measure
- matching algorithm
- objective function
- ant colony optimization
- segmentation algorithm
- theoretical analysis
- computational complexity
- distributed systems