Your search

This paper introduces an enhanced version of the Capuchin Search Algorithm (CapSA) called ECapSA. CapSA draws inspiration from the collective intelligence of Capuchin monkeys and has shown success in solving real-world problems. However, it may encounter challenges handling complex optimization tasks, such as premature convergence or being trapped in local optima. ECapSA employs a local escaping mechanism operating the abandonment limit concept to exploit potential solutions and introduce diversification trends. Additionally, the ECapSA algorithm is improved by integrating the principles of the cooperative island model, resulting in the iECapSA. This modification enables better management of population diversity and a more optimal balance between exploration and exploitation. The efficiency of iECapSA is validated through a series of experiments, including the IEEE-CEC2014 benchmark functions and training the feedforward neural network (FNN) on seven biomedical datasets. The performance of iECapSA is compared to other metaheuristic techniques, namely differential evolution (DE), sine cosine algorithm (SCA), and whale optimization algorithm (WOA). The results of the comparative study demonstrate that iECapSA is a strong contender and surpasses other training algorithms in most datasets, particularly in terms of its ability to avoid local optima and its improved convergence speed.

The Crow Search Algorithm (CSA) is a swarm-based metaheuristic algorithm that simulates the intelligent foraging behaviors of crows. While CSA effectively handles global optimization problems, it suffers from certain limitations, such as low search accuracy and a tendency to converge to local optima. To address these shortcomings, researchers have proposed modifications and enhancements to CSA’s search mechanism. One widely explored approach is the structured population mechanism, which maintains diversity during the search process to mitigate premature convergence. The island model, a common structured population method, divides the population into smaller independent sub-populations called islands, each running in parallel. Migration, the primary technique for promoting population diversity, facilitates the exchange of relevant and useful information between islands during iterations. This paper introduces an enhanced variant of CSA, called Enhanced CSA (ECSA), which incorporates the cooperative island model (iECSA) to improve its search capabilities and avoid premature convergence. The proposed iECSA incorporates two enhancements to CSA. Firstly, an adaptive tournament-based selection mechanism is employed to choose the guided solution. Secondly, the basic random movement in CSA is replaced with a modified operator to enhance exploration. The performance of iECSA is evaluated on 53 real-valued mathematical problems, including 23 classical benchmark functions and 30 IEEE-CEC2014 benchmark functions. A sensitivity analysis of key iECSA parameters is conducted to understand their impact on convergence and diversity. The efficacy of iECSA is validated by conducting an extensive evaluation against a comprehensive set of well-established and recently introduced meta-heuristic algorithms, encompassing a total of seventeen different algorithms. Significant differences among these comparative algorithms are established utilizing statistical tests like Wilcoxon’s rank-sum and Friedman’s tests. Experimental results demonstrate that iECSA outperforms the fundamental ECSA algorithm on 82.6% of standard test functions, providing more accurate and reliable outcomes compared to other CSA variants. Furthermore, Extensive experimentation consistently showcases that the iECSA outperforms its comparable algorithms across a diverse set of benchmark functions.

SESSION TITLE: Clinical Prediction and Diagnosis of OSA

The performance of any meta-heuristic algorithm depends highly on the setting of dependent parameters of the algorithm. Different parameter settings for an algorithm may lead to different outcomes. An optimal parameter setting should support the algorithm to achieve a convincing level of performance or optimality in solving a range of optimization problems. This paper presents a novel enhancement method for the salp swarm algorithm (SSA), referred to as enhanced SSA (ESSA). In this ESSA, the following enhancements are proposed: First, a new position updating process was proposed. Second, a new dominant parameter different from that used in SSA was presented in ESSA. Third, a novel lifetime convergence method for tuning the dominant parameter of ESSA using ESSA itself was presented to enhance the convergence performance of ESSA. These enhancements to SSA were proposed in ESSA to augment its exploration and exploitation capabilities to achieve optimal global solutions, in which the dominant parameter of ESSA is updated iteratively through the evolutionary process of ESSA so that the positions of the search agents of ESSA are updated accordingly. These improvements on SSA through ESSA support it to avoid premature convergence and efficiently find the global optimum solution for many real-world optimization problems. The efficiency of ESSA was verified by testing it on several basic benchmark test functions. A comparative performance analysis between ESSA and other meta-heuristic algorithms was performed. Statistical test methods have evidenced the significance of the results obtained by ESSA. The efficacy of ESSA in solving real-world problems and applications is also demonstrated with five well-known engineering design problems and two real industrial problems. The comparative results show that ESSA imparts better performance and convergence than SSA and other meta-heuristic algorithms.

Sleep apnea is a sleeping disorder affecting more than 20 % of all American adults, associated with intermittent air passageway obstruction during sleep. This results in intermittent hypoxia, sympathetic activation, and an interruption of sleep with various health consequences. The diagnosis of sleep apnea traditionally involves the performance of overnight polysomnography, where oxygen, heart rate, and breathing, among other physiologic variables, are continuously monitored during sleep at a sleep center. However, these sleep studies are expensive and impose access issues, given the number of patients who need to be diagnosed. There is hence utility in having an effective triage system to screen for OSA to utilize polysomnography better. In this study, we plan to explore using several machine learning algorithms to utilize pre-screening symptoms to diagnose obstructive sleep apnea (OSA). Per our experimental results, it was found that Decision Tree Classifier (DTC) and Random Forest (RF) provided the highest classification accuracies compared to other algorithms such as Logistic Regression (LR), Support Vector Machines (SVM), Gradient Boosting Classifier (GBC), Gaussian Naive Bayes (GNB), K Neighbors Classifier (KNC), and Artificial Neural Networks (ANN).

Over recent decades, research in Artificial Intelligence (AI) has developed a broad range of approaches and methods that can be utilized or adapted to address complex optimization problems. As real-world problems get increasingly complicated, this requires an effective optimization method. Various meta-heuristic algorithms have been developed and applied in the optimization domain. This paper used and ameliorated a promising meta-heuristic approach named Crow Search Algorithm (CSA) to address numerical optimization problems. Although CSA can efficiently optimize many problems, it needs more searchability and early convergence. Its positioning updating process was improved by supporting two adaptive parameters: flight length (fl) and awareness probability (AP) to tackle these curbs. This is to manage the exploration and exploitation conducts of CSA in the search space. This process takes advantage of the randomization of crows in CSA and the adoption of well-known growth functions. These functions were recognized as exponential, power, and S-shaped functions to develop three different improved versions of CSA, referred to as Exponential CSA (ECSA), Power CSA (PCSA), and S-shaped CSA (SCSA). In each of these variants, two different functions were used to amend the values of fl and AP. A new dominant parameter was added to the positioning updating process of these algorithms to enhance exploration and exploitation behaviors further. The reliability of the proposed algorithms was evaluated on 67 benchmark functions, and their performance was quantified using relevant assessment criteria. The functionality of these algorithms was illustrated by tackling four engineering design problems. A comparative study was made to explore the efficacy of the proposed algorithms over the standard one and other methods. Overall results showed that ECSA, PCSA, and SCSA have convincing merits with superior performance compared to the others.

The goal of the ambient intelligence system is not only to enhance the way people communicate with the surrounding environment but also to advance safety measures and enrich human lives. In this paper, we introduce an integrated ambient intelligence system (IAmIS) to perceive the presence of people, identify them, determine their locations, and provide suitable interaction with them. The proposed framework can be applied in various application domains such as a smart house, authorisation, surveillance, crime prevention, and many others. The proposed system has five components: body detection and tracking, face recognition, controller, monitor system, and interaction modules. The system deploys RGB cameras and Kinect depth sensors to monitor human activity. The developed system is designed to be fast and reliable for indoor environments. The proposed IAmIS can interact directly with the environment or communicate with humans acting on the environment. Thus, the system behaves as an intelligent agent. The system has been deployed in our research lab and can recognise lab members and guests to the lab as well as track their movements and have interactions with them depending upon their identity and location within the lab.

Robotic systems have been evolving since decades and touching almost all aspects of life, either for leisure or critical applications. Most of traditional robotic systems operate in well-defined environments utilizing pre-configured on-board processing units. However, modern and foreseen robotic applications ask for complex processing requirements that exceed the limits of on-board computing power. Cloud computing and the related technologies have high potential to overcome on-board hardware restrictions and can improve the performance efficiency. This research highlights the advancements in robotic systems with focus on cloud robotics as an emerging trend. There exists an extensive amount of effort to leverage the potentials of robotic systems and to handle arising shortcomings. Moreover, there are promising insights for future breed of intelligent, flexible, and autonomous robotic systems in the Internet of Things era.

Design of the Proportional-Integral-Derivative (PID) controller for an industrial process represents a challenge due to process complexity and non-linearity. Traditional methods such as Ziegler-Nichols (ZN) for PID controller tuning do not provide an optimal gain; thus, might leave the system with potential instability condition and cause significant losses and damages to the system. This paper investigates the merits of evolutionary and swarm-based optimization algorithms in fine-tuning the parameters of a PID controller. Here, Genetic Algorithms (GAs) and Particle Swarm Optimization (PSO) algorithm were utilized to optimize the PID controller for a DC motor system. Various fitness functions were provided for the presented algorithms to compute the performance of the controller. A new fitness function was proposed to achieve an outstanding control response for the DC motor system. Results demonstrate the efficacy of the proposed methods in improving closed loop system response.

Barcode-less fruit recognition technology has revolutionized the checkout process by eliminating manual barcode scanning. This technology automatically identifies and adds fruit items to the purchase list, significantly reducing waiting times at the cash register. Faster checkouts enhance customer convenience and optimize operational efficiency for retailers. Adding barcode to fruits require using adhesives on the fruit surface that may cause health hazards. Leveraging deep learning techniques for barcode-less fruit recognition brings valuable advantages to industries, including advanced automation, enhanced accuracy, and increased efficiency. These benefits translate into improved productivity, cost reduction, and superior quality control. This study introduces a Convolutional Neural Network (CNN) designed explicitly for automatic fruit recognition, even in challenging real-world scenarios. The proposed method assists fruit sellers in accurately identifying and distinguishing between different types of fruit that may exhibit similarities. A dataset that includes 44,406 images of different fruit types is used to train and test our technique. Employing a CNN, the developed model achieves an impressive classification accuracy of 97.4% during the training phase and 88.6% during the testing phase respectively, showcasing its effectiveness in precise fruit recognition.

Data classification is a challenging problem. Data classification is very sensitive to the noise and high dimensionality of the data. Being able to reduce the model complexity can help to improve the accuracy of the classification model performance. Therefore, in this research, we propose a novel feature selection technique based on Binary Harris Hawks Optimizer with Time-Varying Scheme (BHHO-TVS). The proposed BHHO-TVS adopts a time-varying transfer function that is applied to leverage the influence of the location vector to balance the exploration and exploitation power of the HHO. Eighteen well-known datasets provided by the UCI repository were utilized to show the significance of the proposed approach. The reported results show that BHHO-TVS outperforms BHHO with traditional binarization schemes as well as other binary feature selection methods such as binary gravitational search algorithm (BGSA), binary particle swarm optimization (BPSO), binary bat algorithm (BBA), binary whale optimization algorithm (BWOA), and binary salp swarm algorithm (BSSA). Compared with other similar feature selection approaches introduced in previous studies, the proposed method achieves the best accuracy rates on 67% of datasets.

AbstractThe autonomous navigation of robots in unknown environments is a challenge since it needs the integration of a several subsystems to implement different functionality. It needs drawing a map of the environment, robot map localization, motion planning or path following, implementing the path in real-world, and many others; all have to be implemented simultaneously. Thus, the development of autonomous robot navigation (ARN) problem is essential for the growth of the robotics field of research. In this paper, we present a simulation of a swarm intelligence method is known as Particle Swarm Optimization (PSO) to develop an ARN system that can navigate in an unknown environment, reaching a pre-defined goal and become collision-free. The proposed system is built such that each subsystem manipulates a specific task which integrated to achieve the robot mission. PSO is used to optimize the robot path by providing several waypoints that minimize the robot traveling distance. The Gazebo simulator was used to test the response of the system under various envirvector representing a solution to the optimization problem.onmental conditions. The proposed ARN system maintained robust navigation and avoided the obstacles in different unknown environments. vector representing a solution to the optimization problem.

Diabetes mellitus is a chronic disease affecting over 38.4 million adults worldwide. Unfortunately, 8.7 million were undiagnosed. Early detection and diagnosis of diabetes can save millions of people’s lives. Significant benefits can be achieved if we have the means and tools for the early diagnosis and treatment of diabetes since it can reduce the ratio of cardiovascular disease and mortality rate. It is urgently necessary to explore computational methods and machine learning for possible assistance in the diagnosis of diabetes to support physician decisions. This research utilizes machine learning to diagnose diabetes based on several selected features collected from patients. This research provides a complete process for data handling and pre-processing, feature selection, model development, and evaluation. Among the models tested, our results reveal that Random Forest performs best in accuracy (i.e., 0.945%). This emphasizes Random Forest’s efficiency in precisely helping diagnose and reduce the risk of diabetes.

In this paper, we provide a consistent, inexpensive, and easy to use graphical user interface (GUI) smart phone application named Sleep Apnea Screener (SAS) that can diagnosis Obstructive Sleep Apnea (OSA) based on demographic data such as: gender, age, height, BMI, neck circumference, waist, etc., allowing a tentative diagnosis of OSA without the need for overnight tests. The developed smart phone application can diagnosis sleep apnea using a model trained with 620 samples collected from a sleep center in Corpus Christi, TX. Two machine learning classifiers (i.e., Logistic Regression (LR) and Support Vector Machine (SVM)) were used to diagnosis OSA. Our preliminary results show that at-home OSA screening is indeed possible, and that our application is effective method for covering large numbers of undiagnosed cases.

Background: In the United States, chronic obstructive pulmonary disease (COPD) is a significant cause of mortality. As far as we know, it is a chronic, inflammatory lung condition that cuts off airflow to the lungs. Many symptoms have been reported for such a disease: breathing problems, coughing, wheezing, and mucus production. Patients with COPD might be at risk, since they are more susceptible to heart disease and lung cancer. Methods: This study reviews COPD diagnosis utilizing various machine learning (ML) classifiers, such as Logistic Regression (LR), Gradient Boosting Classifier (GBC), Support Vector Machine (SVM), Gaussian Naïve Bayes (GNB), Random Forest Classifier (RFC), K-Nearest Neighbors Classifier (KNC), Decision Tree (DT), and Artificial Neural Network (ANN). These models were applied to a dataset comprising 1603 patients after being referred for a pulmonary function test. Results: The RFC has achieved superior accuracy, reaching up to 82.06% in training and 70.47% in testing. Furthermore, it achieved a maximum F score in training and testing with an ROC value of 0.0.82. Conclusions: The results obtained with the utilized ML models align with previous work in the field, with accuracies ranging from 67.81% to 82.06% in training and from 66.73% to 71.46% in testing.

SESSION TITLE: Clinical Prediction and Diagnosis of OSA

Image clustering presents a hot topic that researchers have chased extensively. There is always a need to a promising clustering technique due to its vital role in further image processing steps. This paper presents a compelling clustering approach for brain tumors and breast cancer in Magnetic Resonance Imaging (MRI). Driven by the superiority of nature-inspired algorithms in providing computational tools to deal with optimization problems, we propose Flower Pollination Algorithm (FPA) and Crow Search Algorithm (CSA) to present a clustering method for brain tumors and breast cancer. Evaluation clustering results of CSA and FPA were judged using two apposite criteria and compared with results of K-means, fuzzy c-means and other metaheuristics when applied to cluster the same benchmark datasets. The clustering method-based CSA and FPA yielded encouraging results, significantly outperforming those obtained by K-means and fuzzy c-means and slightly surpassed those of other metaheuristic algorithms.