A New Scalability of Hybrid Fuzzy C-Means Algorithm
In this paper, a new scalability of hybrid fuzzy clustering algorithm that incorporates the Fuzzy C-means into the Quantum-behaved Particle Swarm Optimization algorithm is proposed. The QPSO has less parameters and higher convergent capability of the global optimizing than Particle Swarm Optimizatio...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | In this paper, a new scalability of hybrid fuzzy clustering algorithm that incorporates the Fuzzy C-means into the Quantum-behaved Particle Swarm Optimization algorithm is proposed. The QPSO has less parameters and higher convergent capability of the global optimizing than Particle Swarm Optimization algorithm. So the iteration algorithm is replaced by the new hybrid algorithm based on the gradient descent of FCM, which makes the algorithm have a strong global searching capacity and avoids the local minimum problems of FCM and avoids depending on the initialization values. The simulation result proves that compared with other algorithms, the new algorithm not only has the favorable convergence capability of the global optimizing but also has been obviously improved the clustering effect. |
---|---|
DOI: | 10.1109/AICI.2010.252 |