SavedAdd your journal

Journals / Hacettepe Journal of Mathematics and Statistics / 2019 / Cilt: 48 - Sayı: 3

Improving fuzzy c-means clustering via quantum-enhanced weighted superposition attraction algorithm

Adil BAYKASOĞLU
İlker GÖLCÜK
Fehmi Burçin ÖZSOYDAN
Pages
859–882
Publication Date
2019-06-15
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

The results point out significant improvements over the traditional fuzzy c-means algorithm.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Fuzzy clustering has become an important research field in pattern recognition and data analysis.
📊
Key Findings & Data:Due to its high converging capability and practicality, WSA algorithm has been employed in order to enhance performance of fuzzy-c means clustering.
💡
Conclusion & Impact:The results point out significant improvements over the traditional fuzzy c-means algorithm.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Fuzzy c-means clustering · Metaheuristics · Pattern recognition

Abstract

Fuzzy clustering has become an important research field in pattern recognition and data analysis. As supporting unsupervised mode of learning, fuzzy clustering brings about unique opportunities to reveal structural relationships in data. Fuzzy c-means clustering is one of the widely preferred clustering algorithms in the literature. However, fuzzy c-means clustering algorithm has a major drawback that it can get trapped at some local optima. In order to overcome this shortcoming, this study employs a new generation metaheuristic algorithm. Weighted Superposition Attraction Algorithm (WSA) is a novel swarm intelligence-based method that draws inspiration from the superposition principle of physics in combination with the attracted movement of agents. Due to its high converging capability and practicality, WSA algorithm has been employed in order to enhance performance of fuzzy-c means clustering. Comprehensive experimental study has been conducted on publicly available datasets obtained from UCI machine learning repository. The results point out significant improvements over the traditional fuzzy c-means algorithm.

🔖

Cite This Article

BAYKASOĞLU, A., GÖLCÜK, İ., ÖZSOYDAN, F. B. (2019). Improving fuzzy c-means clustering via quantum-enhanced weighted superposition attraction algorithm. Hacettepe Journal of Mathematics and Statistics, Cilt: 48 - Sayı: 3, 859–882. https://ajindex.com/articles/669371

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (15)

  1. Alam, S., Dobbie, G., Koh, Y.S., Riddle, P., and Rehman, S.U. Research on particle swarm optimization based clustering: A systematic review of literature and techniques, Swarm and Evolutionary Computation 17, 1-13, 2014.
  2. Bandyopadhyay, S. and Maulik, U. An evolutionary technique based on K-Means algorithm for optimal clustering in RN, Information Sciences 146 (1), 221-237, 2002.
  3. Baykasolu, A. and Akpinar,. Weighted Superposition Attraction (WSA): A swarm intel- ligence algorithm for optimization problems Part 1: Unconstrained optimization, Applied Soft Computing 56, 520-540, 2017.
  4. Baykasolu, A. and Akpinar,. Weighted Superposition Attraction (WSA): A swarm intelli- gence algorithm for optimization problems Part 2: Constrained optimization, Applied Soft Computing 37, 396-415, 2015.
  5. Baykasolu, A. and Ozsoydan, F.B. Dynamic optimization in binary search spaces via weighted superposition attraction algorithm, Expert Systems with Applications 96 157-174, 2018.
  6. Belacel, N., Hansen, P., and Mladenovic, N. Fuzzy J-Means: a new heuristic for fuzzy clustering, Pattern Recognition 35 (10), 2193-2200, 2002.
  7. Bezdek, J.C., Fuzzy Mathematics in Pattern Classification, Cornell University: Ithaca, NY, 1973.
  8. Bezdek, J.C., Ehrlich, R., and Full, W. FCM: The fuzzy c-means clustering algorithm, Computers and Geosciences 10 (2), 191-203, 1984.
  9. Bezdek, J.C. Pattern Recognition with Fuzzy Objective Function Algorithms (Plenum Press, New York, 1981).
  10. Bezdek, J.C. Cluster Validity with Fuzzy Sets, Journal of Cybernetics 3 (3), 58-73, 1973.
  11. Blackwell, T., Branke, J., and Li, X., Particle swarms for dynamic optimization problems, in Swarm Intelligence, Springer. p. 193-217, 2008.
  12. Blackwell, T. and Branke, J., Multi-swarm Optimization in Dynamic Environments, in Ap- plications of Evolutionary Computing: EvoWorkshops, Springer Berlin Heidelberg: Berlin, Heidelberg. p. 489-500, 2004.
  13. Chen, M.-Y. and Linkens, D.A. Rule-base self-generation and simplification for data-driven fuzzy models. in 10th IEEE International Conference on Fuzzy Systems, 2001.
  14. Derrac, J., García, S., Molina, D., and Herrera, F. A practical tutorial on the use of nonpara- metric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms, Swarm and Evolutionary Computation 1 (1), 3-18, 2011.
  15. Filho, T.M.S., Pimentel, B.A., Souza, R.M.C.R., and Oliveira, A.L.I. Hybrid methods for fuzzy clustering based on fuzzy c-means and improved particle swarm optimization, Expert Systems with A