Data Clustering using a Hybrid of Fuzzy C-Means and Quantum-behaved Particle Swarm Optimization

• Published in: arXiv.org
• Main Authors: Sengupta, Saptarshi, Basak, Sanchita, Peters, Richard Alan
• Format: Paper Journal Article
• Language: English
• Published: Ithaca Cornell University Library, arXiv.org 15.12.2017
• Subjects: Algorithms; Clustering; Computer Science - Neural and Evolutionary Computing; Data mining; Datasets; Error analysis; Machine learning; Multidimensional data; Particle swarm optimization; Performance indices; Stagnation; Topology
• ISSN: 2331-8422
• DOI: 10.48550/arxiv.1712.05512

Fuzzy clustering has become a widely used data mining technique and plays an important role in grouping, traversing and selectively using data for user specified applications. The deterministic Fuzzy C-Means (FCM) algorithm may result in suboptimal solutions when applied to multidimensional data in real-world, time-constrained problems. In this paper the Quantum-behaved Particle Swarm Optimization (QPSO) with a fully connected topology is coupled with the Fuzzy C-Means Clustering algorithm and is tested on a suite of datasets from the UCI Machine Learning Repository. The global search ability of the QPSO algorithm helps in avoiding stagnation in local optima while the soft clustering approach of FCM helps to partition data based on membership probabilities. Clustering performance indices such as F-Measure, Accuracy, Quantization Error, Intercluster and Intracluster distances are reported for competitive techniques such as PSO K-Means, QPSO K-Means and QPSO FCM over all datasets considered. Experimental results indicate that QPSO FCM provides comparable and in most cases superior results when compared to the others.