Data clustering using particle swarm optimization
By D. V. D. Merwe, Andries Petrus Engelbrecht. The 2003 Congress on Evolutionary Computation, 2003. CEC '03., 2003
854 citations recorded by the source corpus.
Subfields: Artificial Intelligence
View Paper: https://www.semanticscholar.org/paper/ad9a9f90da491c4060ae2e770e73f40242878288
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Zong Woo Geem
- Bernd Meyer
- Ganapati Panda
- Satyasai Jagannath Nanda
- Julia Handl
- Thomas E. Potok
- Paul J. Palathingal
- Xiaohui Cui
Citations in the corpus
- A survey on nature inspired metaheuristic algorithms for partitional clustering (2014, methodology): “The hybrid algorithm based on K-means and PSO is proposed by van der Merwe and Engelhrecht [220] in 2003.”
- Document clustering using particle swarm optimization (2005, methodology): “Merwe’s research [15] indicates that utilizing the PSO algorithm’s optimal ability, if given enough time, the PSO clustering algorithm could generate more compact clustering results from the low dimensional dataset than the traditional K-means clustering algorithm.”
- Music-Inspired Harmony Search Algorithm (2009, methodology): “Particle swarm optimization (PSO) [44] is another computational intelligence method that has been applied to image clustering and other low dimensional datasets in [39, 45, 46] and to document clustering in [42].”
- Ant-based and swarm-based clustering (2007, methodology): “In contrast to ( van der Merwe and Engelbrecht 2003 ), they use k -means also as a post-process.”