Publication:
A New Approach in Metaheuristic Clustering: COOT Clustering

dc.contributor.authorİşeri, İsmail
dc.contributor.authorKayhan, Gökhan
dc.date.accessioned2025-12-11T01:48:08Z
dc.date.issued2024
dc.departmentOndokuz Mayıs Üniversitesien_US
dc.department-tempOndokuz Mayıs Üniversitesi,Ondokuz Mayıs Üniversitesien_US
dc.description.abstractAs a result of technological advancements, the increase in vast amounts of data in today's world has made artificial intelligence and data mining significantly crucial. In this context, the clustering process, which aims to explore hidden patterns and meaningful relationships within complex datasets by grouping similar features to conduct more effective analyses, holds vital importance. As an alternative to classical clustering methods that face challenges such as large volumes of data and computational complexities, a metaheuristic clustering method utilizing Coot Optimization (COOT), a swarm intelligence-based algorithm, has been proposed. COOT, inspired by the hunting stages of eagles and recently introduced into the literature, is a metaheuristic method. Through the proposed COOT metaheuristic clustering method, the aim is to contribute to the literature by leveraging COOT's robust exploration and exploitation processes, utilizing its dynamic and flexible structure. Comprehensive experimental clustering studies were conducted to evaluate the consistency and effectiveness of the COOT-based algorithm using randomly generated synthetic data and the widely used Iris dataset in the literature. The same datasets underwent analysis using the traditional clustering algorithm K-Means, renowned for its simplicity and computational speed, for comparative purposes. The performance of the algorithms was assessed using cluster validity measures such as Silhouette Global, Davies-Bouldin, Krznowski-Lai, and Calinski-Harabasz indices, along with the Total Squared Error (SSE) objective function. Experimental results indicate that the proposed algorithm performs clustering at a competitive level with K-Means and shows potential, especially in multidimensional datasets and real-world problems. Despite not being previously used for clustering purposes, the impressive performance of COOT in some tests compared to the K-Means algorithm showcases its success and potential to pioneer different studies aimed at expanding its usage in the clustering domain.en_US
dc.identifier.doi10.21541/apjess.1418885
dc.identifier.endpage67en_US
dc.identifier.issn2822-2385
dc.identifier.issue2en_US
dc.identifier.startpage59en_US
dc.identifier.trdizinid1237962
dc.identifier.urihttps://doi.org/10.21541/apjess.1418885
dc.identifier.urihttps://search.trdizin.gov.tr/en/yayin/detay/1237962/a-new-approach-in-metaheuristic-clustering-coot-clustering
dc.identifier.urihttps://hdl.handle.net/20.500.12712/46399
dc.identifier.volume12en_US
dc.language.isoenen_US
dc.relation.ispartofAcademic Platform Journal of Engineering and Smart Systems (Online)en_US
dc.relation.publicationcategoryMakale - Ulusal Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectBilgisayar Bilimlerien_US
dc.subjectYazılım Mühendisliğien_US
dc.subjectBilgisayar Bilimlerien_US
dc.subjectYapay Zekaen_US
dc.titleA New Approach in Metaheuristic Clustering: COOT Clusteringen_US
dc.typeArticleen_US
dspace.entity.typePublication

Files