Autor: |
Saleem Malik, S Gopal Krishna Patro, Chandrakanta Mahanty, Ayodele Lasisi, Osamah J. Al-sareji |
Jazyk: |
angličtina |
Rok vydání: |
2024 |
Předmět: |
|
Zdroj: |
Scientific Reports, Vol 14, Iss 1, Pp 1-15 (2024) |
Druh dokumentu: |
article |
ISSN: |
2045-2322 |
DOI: |
10.1038/s41598-024-70489-1 |
Popis: |
Abstract The field of data exploration relies heavily on clustering techniques to organize vast datasets into meaningful subgroups, offering valuable insights across various domains. Traditional clustering algorithms face limitations in terms of performance, often getting stuck in local minima and struggling with complex datasets of varying shapes and densities. They also require prior knowledge of the number of clusters, which can be a drawback in real-world scenarios. In response to these challenges, we propose the "hybrid raven roosting intelligence framework" (HRIF) algorithm. HRIF draws inspiration from the dynamic behaviors of roosting ravens and computational intelligence. What distinguishes HRIF is its effective capacity to adeptly navigate the clustering landscape, evading local optima and converging toward optimal solutions. An essential enhancement in HRIF is the incorporation of the Gaussian mutation operator, which adds stochasticity to improve exploration and mitigate the risk of local minima. This research presents the development and evaluation of HRIF, showcasing its unique fusion of nature-inspired optimization techniques and computational intelligence. Extensive experiments with diverse benchmark datasets demonstrate HRIF's competitive performance, particularly its capability to handle complex data and avoid local minima, resulting in accurate clustering outcomes. HRIF's adaptability to challenging datasets and its potential to enhance clustering efficiency and solution quality position it as a promising solution in the world of data exploration. |
Databáze: |
Directory of Open Access Journals |
Externí odkaz: |
|
Nepřihlášeným uživatelům se plný text nezobrazuje |
K zobrazení výsledku je třeba se přihlásit.
|