An Efficient Heuristic Applied to the K-means Algorithm for the Clustering of Large Highly-Grouped Instances.
Joaquín Pérez OrtegaMiguel Angel HidalgoNoé Alejandro Castro-SánchezRodolfo A. Pazos RangelOcotlán Díaz-ParraVíctor Olivares-PeregrinoNelva Nely Almanza OrtegaPublished in: Computación y Sistemas (2018)
Keyphrases
- k means
- clustering algorithm
- clustering method
- data clustering
- rough k means
- hierarchical clustering
- dynamic programming
- cluster analysis
- fuzzy k means
- expectation maximization
- unsupervised clustering
- spectral clustering
- randomly generated
- simulated annealing
- objective function
- optimal solution
- detection algorithm
- document clustering
- bin packing
- clustering approaches
- packing problem
- hierarchical clustering algorithm
- closest string
- tabu search
- probabilistic model
- fuzzy clustering algorithm
- hierarchical agglomerative clustering
- np hard
- clustering ensemble
- initial solution
- lower and upper bounds
- solution quality
- learning algorithm
- ant colony optimization
- particle swarm optimization
- semi supervised