Improved Cuckoo Search Algorithm for Future Selection

2021 ◽  
Vol 9 (2) ◽  
pp. 113-123
Author(s):  
T. Mathi Murugan ◽  
◽  
E. Baburaj ◽  

The classification of high-dimensional dataset is challenging as it contains large amount irrelevant and noisy features. Thus, feature selection is performed in the dataset to eliminate these redundant features. It reduces the dimensionality of the dataset and increases the classification accuracy. Hence, for selecting the relevant features in high dimensional data, an improved cuckoo search algorithm (ICSA) was proposed in this paper. After feature selection, the dataset undergo classification using KNN classifier and SVM classifier. The experimental process illustrates that the improved cuckoo search algorithm effectively increases the classification accuracy by reducing the number of features in the dataset. For analysing the proposed algorithm, seven UCI repository dataset have been utilised. Also, the ICS algorithm is compared with other existing algorithms for the given dataset. From the investigation process, it was concluded that the proposed algorithm selects lesser number of features and also enhances the classification accuracy than the other existing algorithms.

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Maoxian Zhao ◽  
Yue Qin

For the low optimization accuracy of the cuckoo search algorithm, a new search algorithm, the Elite Hybrid Binary Cuckoo Search (EHBCS) algorithm, is improved by feature weighting and elite strategy. The EHBCS algorithm has been designed for feature selection on a series of binary classification datasets, including low-dimensional and high-dimensional samples by SVM classifier. The experimental results show that the EHBCS algorithm achieves better classification performances compared with binary genetic algorithm and binary particle swarm optimization algorithm. Besides, we explain its superiority in terms of standard deviation, sensitivity, specificity, precision, and F -measure.


2021 ◽  
pp. 100572
Author(s):  
Malek Alzaqebah ◽  
Khaoula Briki ◽  
Nashat Alrefai ◽  
Sami Brini ◽  
Sana Jawarneh ◽  
...  

2017 ◽  
Vol 116 ◽  
pp. 63-78 ◽  
Author(s):  
Geng Sun ◽  
Yanheng Liu ◽  
Ming Yang ◽  
Aimin Wang ◽  
Shuang Liang ◽  
...  

2018 ◽  
Vol 30 (4) ◽  
pp. 367-386 ◽  
Author(s):  
Liyang Xiao ◽  
Mahjoub Dridi ◽  
Amir Hajjam El Hassani ◽  
Wanlong Lin ◽  
Hongying Fei

Abstract In this study, we aim to minimize the total waiting time between successive treatments for inpatients in rehabilitation hospitals (departments) during a working day. Firstly, the daily treatment scheduling problem is formulated as a mixed-integer linear programming model, taking into consideration real-life requirements, and is solved by Gurobi, a commercial solver. Then, an improved cuckoo search algorithm is developed to obtain good quality solutions quickly for large-sized problems. Our methods are demonstrated with data collected from a medium-sized rehabilitation hospital in China. The numerical results indicate that the improved cuckoo search algorithm outperforms the real schedules applied in the targeted hospital with regard to the total waiting time of inpatients. Gurobi can construct schedules without waits for all the tested dataset though its efficiency is quite low. Three sets of numerical experiments are executed to compare the improved cuckoo search algorithm with Gurobi in terms of solution quality, effectiveness and capability to solve large instances.


Author(s):  
Wenjie Wang ◽  
Congcong Chen ◽  
Yuting Cao ◽  
Jian Xu ◽  
Xiaohua Wang

Background: Dexterity is an important index for evaluating the motion performance of a robot. The size of the robot connecting rods directly affects the performance of flexibility. Objective: The purpose of this study is to provide an overview of optimal design methods from many pieces of literature and patents, and propose a new optimal design method for ensuring the robot completes its tasks flexibly and efficiently under workspace constraints. Methods: The kinematics and working space of the robot are analyzed to determine the range of motion of each joint. Then, a dexterity index is established based on the mean value of the global spatial condition number. Finally, an improved cuckoo algorithm is proposed, which changes the step size control factor with the number of iterations. Taking the dexterity index as the objective optimization function and the working radius as the constraint condition, the improved cuckoo search algorithm is used to optimize the size of the robot rod. Results: The improved cuckoo algorithm and proposed rod size optimized method are fully evaluated by experiments and comparative studies. The optimization design process shows that the proposed method has better solution accuracy and faster convergence speed. The optimized design results show that the robot's dexterity index has increased by 26.1%. Conclusion: The proposed method has better solution accuracy and faster convergence speed. The method was suitable for optimizing the rod parameters of the robot, and it was very meaningful to improve the motion performance of the robot.


Sign in / Sign up

Export Citation Format

Share Document