Efficient and Reliable Clustering by Parallel Random Swap Algorithm.
Libero NigroFranco CicirelliPasi FräntiPublished in: DS-RT (2022)
Keyphrases
- k means
- parallel implementation
- np hard
- preprocessing
- detection algorithm
- computationally efficient
- data clustering
- highly efficient
- clustering method
- dynamic programming
- experimental evaluation
- computational cost
- recognition algorithm
- cost function
- significant improvement
- randomly generated
- computational complexity
- particle swarm optimization
- times faster
- distance metric
- matching algorithm
- hierarchical clustering
- optimization algorithm
- unsupervised learning
- expectation maximization
- clustering quality
- single pass
- data structure
- learning algorithm
- density based clustering algorithm
- pruning strategy
- synthetic and real datasets
- simulated annealing
- lower bound
- objective function
- bayesian networks
- clustering algorithm