Journals / Politeknik Dergisi / 2022 / Cilt: 25 - Sayı: 4

The Adaptation of Gray Wolf Optimizer to Data Clustering

Bozkurt Optimizasyon Yönteminin Veri Kümelemeye Uyarlanması

Pages
1761–1767
Publication Date
2022-12-16
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 show that GWO can be used for data clustering successfully.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Data Clustering stands for a group of methods classifying patterns into groups and retrieving similarities or dissimilarities of a collection of objects.
📊
Key Findings & Data:The performance of GWO was compared to the other algorithms used as clustering.
💡
Conclusion & Impact:The results show that GWO can be used for data clustering successfully.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Veri kümeleme · meta-sezgisel optimizasyon · bozkurt kurt optimizasyonu

Abstract

Data Clustering stands for a group of methods classifying patterns into groups and retrieving similarities or dissimilarities of a collection of objects. Clustering is used for pattern recognition, machine learning, etc. One of the approaches to clustering is optimization. The aim of the optimization is finding the best solution in the search space of a problem as much as possible. Many optimization methods were modified to solve clustering problems in literature. Gray Wolf Optimizer (GWO) is one of the nature-inspired meta-heuristic algorithms simulating the hunting of gray wolves. GWO has applied to solve several optimization issues in different fields. In this study, GWO was examined in the case of data clustering. GWO was modified to get better clustering results and applied to well-known benchmark data sets. The performance of GWO was compared to the other algorithms used as clustering. The results show that GWO can be used for data clustering successfully.

Özet

Veri Kümeleme, veri desenlerini gruplar halinde sınıflandıran ve bir nesne benzerliklerini veya farklılıklarını ayrıştıran bir yöntemlerdir. Kümeleme, örüntü tanıma, makine öğrenimi vb. için kullanılır. Veri Kümelemeye yönelik yaklaşımlardan biri de optimizasyondur. Optimizasyonun amacı, bir problemin arama alanında mümkün olan en iyi çözümün bulunmasıdır. Literatürdeki kümeleme problemlerini çözmek için birçok optimizasyon yöntemi uyarlanmıştır. Bozkurt Optimizasyonu (BO), boz kurtların avlanmasını simüle eden doğadan ilham alan sezgi ötesi algoritmalardan biridir. BO, farklı alanlardaki çeşitli optimizasyon sorunlarına başarılı çözüm üretmektedir. Bu çalışmada BO, veri kümeleme için incelenmiştir. BO, daha iyi kümeleme sonuçları elde etmek için değiştirilerek, iyi bilinen veri kümelerine kıyaslama amacıyla uygulanmıştır. BO'nun performansı, kümeleme olarak kullanılan diğer algoritmalarla karşılaştırılmıştır. Sonuçlar, BO'nun veri kümeleme için başarıyla kullanılabileceğini göstermektedir.

🔖

Cite This Article

TEKEREK, A., DÖRTERLER, M. (2022). The Adaptation of Gray Wolf Optimizer to Data Clustering. Politeknik Dergisi, Cilt: 25 - Sayı: 4, 1761–1767. https://ajindex.com/articles/880131

📄 Full Text PDF Viewer

📄

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

References (16)

  1. Barbakh, W., Wu, Y., Fyfe, C., “Review of clustering algorithms”, Non-Standard Parameter Adaptation for Exploratory Data Analysis, Springer, Berlin Heidelberg, 7–28, (2009)
  2. Han, J., Kamber, M., “Data Mining: Concepts and Techniques”, Academic Press, (2006)
  3. Jain, A.K., “Data clustering: 50 years beyond K-means”, Pattern Recognition Letters 31: 651–666, (2010)
  4. Evangelou, I. E., Hadjimitsis, D. G., Lazakidou, A. A., Clayton, C., “Data Mining and Knowledge Discovery in Complex Image Data using Artificial Neural Networks”, Workshop on Complex Reasoning an Geographical Data, Cyprus, (2001)
  5. Andrews, H. C., “Introduction to Mathematical Techniques in Pattern Recognition”, John Wiley & Sons, New York, (1972)
  6. Topaloglu, N., “Revised: Finger print classification based on gray-level fuzzy clustering co-occurrence matrix”, Energy Education Science and Technology Part A: Energy Science and Research, 31(3): 1307-1316, (2013)
  7. Sakar, B. E., Isenkul, M. E., Sakar, C. O., Sertbas, A., Gurgen, F., Delil, S., Kursun, O., “Collection and analysis of a Parkinson speech dataset with multiple types of sound recordings”. IEEE Journal of Biomedical and Health Informatics, 17(4): 828-834, (2013)
  8. Mo, H. J., & White, S. D., “An analytic model for the spatial clustering of dark matter haloes”, Monthly Notices of the Royal Astronomical Society, 282(2): 347-361, (1996)
  9. Yeung, K. Y., Haynor, D. R., Ruzzo, W. L., “Validating clustering for gene expression data”, Bioinformatics, 17(4): 309-318, (2001)
  10. Rao, M. R., “Cluster Analysis and Mathematical Programming”, Journal of the American Statistical Association, 22: 622-626, (1971)
  11. Hatamlou, A., “Black hole: A new heuristic optimization approach for data clustering”, Information sciences, 222: 175-184, (2013)
  12. Jain, A.K., Murty, M.N., Flynn, P.J., “Data clustering: a review”, Computing Surveys, ACM, 264–323, (1999)
  13. Liu, Y., Yi, Z., Wu, H., Ye, M., Chen, K., “A tabu search approach for the minimum sum-of-squares clustering problem”, Information Sciences, 178: 2680–2704, (2008)
  14. Liu, R., Jiao, L., Zhang, X., Li, Y., “Gene transposon based clone selection algorithm for automatic clustering”, Information Sciences, 204: 1–22, (2012)
  15. Maulik, U., Bandyopadhyay, S., “Genetic algorithm-based clustering technique”, Pattern Recognition, 33: 1455–1465, (2000)
  16. Maulik, U., Bandyopadhyay, S., “Fuzzy partitioning using a real-coded variable-length genetic algorithm for pixel