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.
Download full-text PDF |
Source |
---|---|
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC11364528 | PMC |
http://dx.doi.org/10.1038/s41598-024-70489-1 | DOI Listing |
Sci Rep
January 2025
Department of Computer Science and Engineering, Symbiosis Institute of Technology, Symbiosis University Pune, Pune, India.
A novel approach is introduced for designing a miniaturized wearable antenna. Utilizing Taguchi's philosophy typically entails numerous experimentations runs, but our method significantly reduces these by employing a quasi-Newton approach with gradient descent to estimate process parameter ranges. This hybrid technique expedites convergence by streamlining experiments.
View Article and Find Full Text PDFCerebellum
January 2025
Department of Neuroscience and Physiology, Grossman School of Medicine, NYU Neuroscience Institute, New York University, New York, NY, 10016, USA.
Sci Adv
January 2025
Department of Nuclear Engineering, University of Tennessee, Knoxville, TN 37996, USA.
Metastable phases can exist within local minima in the potential energy landscape when they are kinetically "trapped" by various processing routes, such as thermal treatment, grain size reduction, chemical doping, interfacial stress, or irradiation. Despite the importance of metastable materials for many technological applications, little is known about the underlying structural mechanisms of the stabilization process and atomic-scale nature of the resulting defective metastable phase. Investigating ion-irradiated and nanocrystalline zirconia with neutron total scattering experiments, we show that metastable tetragonal ZrO consists of an underlying structure of ferroelastic, orthorhombic nanoscale domains stabilized by a network of domain walls.
View Article and Find Full Text PDFNat Commun
December 2024
Department of Electronics and Information Convergence Engineering, Kyung Hee University, Yongin-si, Republic of Korea.
Self-assembled configurations are versatile for applications in which liquid-mediated phenomena are employed to ensure that static or mild physical interactions between assembling blocks take advantage of local energy minima. For granular materials, however, a particle's momentum in air leads to random collisions and the formation of disordered phases, eventually producing jammed configurations when densely packed. Therefore, unlike fluidic self-assembly, the self-assembly of dry particles typically lacks programmability based on density and ordering symmetry and has thus been limited in applications.
View Article and Find Full Text PDFNeural Netw
December 2024
Department of Electrical and Computer Engineering, University of Alabama, Tuscaloosa, 35401, AL, US.
In this paper we present three neurocontrol problems where the analytic policy gradient via back-propagation through time is used to train a simulated agent to maximise a polynomial reward function in a simulated environment. If the environment includes terminal barriers (e.g.
View Article and Find Full Text PDFEnter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!