scholarly journals Enhanced Feature Subset Selection Using Niche Based Bat Algorithm

Computation ◽  
2019 ◽  
Vol 7 (3) ◽  
pp. 49 ◽  
Author(s):  
Noman Saleem ◽  
Kashif Zafar ◽  
Alizaa Sabzwari

Redundant and irrelevant features disturb the accuracy of the classifier. In order to avoid redundancy and irrelevancy problems, feature selection techniques are used. Finding the most relevant feature subset that can enhance the accuracy rate of the classifier is one of the most challenging parts. This paper presents a new solution to finding relevant feature subsets by the niche based bat algorithm (NBBA). It is compared with existing state of the art approaches, including evolutionary based approaches. The multi-objective bat algorithm (MOBA) selected 8, 16, and 248 features with 93.33%, 93.54%, and 78.33% accuracy on ionosphere, sonar, and Madelon datasets, respectively. The multi-objective genetic algorithm (MOGA) selected 10, 17, and 256 features with 91.28%, 88.70%, and 75.16% accuracy on same datasets, respectively. Finally, the multi-objective particle swarm optimization (MOPSO) selected 9, 21, and 312 with 89.52%, 91.93%, and 76% accuracy on the above datasets, respectively. In comparison, NBBA selected 6, 19, and 178 features with 93.33%, 95.16%, and 80.16% accuracy on the above datasets, respectively. The niche multi-objective genetic algorithm selected 8, 15, and 196 features with 93.33%, 91.93%, and 79.16 % accuracy on the above datasets, respectively. Finally, the niche multi-objective particle swarm optimization selected 9, 19, and 213 features with 91.42%, 91.93%, and 76.5% accuracy on the above datasets, respectively. Hence, results show that MOBA outperformed MOGA and MOPSO, and NBBA outperformed the niche multi-objective genetic algorithm and the niche multi-objective particle swarm optimization.

Author(s):  
Javad Ansarifar ◽  
Reza Tavakkoli-Moghaddam ◽  
Faezeh Akhavizadegan ◽  
Saman Hassanzadeh Amin

This article formulates the operating rooms considering several constraints of the real world, such as decision-making styles, multiple stages for surgeries, time windows for resources, and specialty and complexity of surgery. Based on planning, surgeries are assigned to the working days. Then, the scheduling part determines the sequence of surgeries per day. Moreover, an integrated fuzzy possibilistic–stochastic mathematical programming approach is applied to consider some sources of uncertainty, simultaneously. Net revenues of operating rooms are maximized through the first objective function. Minimizing a decision-making style inconsistency among human resources and maximizing utilization of operating rooms are considered as the second and third objectives, respectively. Two popular multi-objective meta-heuristic algorithms including Non-dominated Sorting Genetic Algorithm and Multi-Objective Particle Swarm Optimization are utilized for solving the developed model. Moreover, different comparison metrics are applied to compare the two proposed meta-heuristics. Several test problems based on the data obtained from a public hospital located in Iran are used to display the performance of the model. According to the results, Non-dominated Sorting Genetic Algorithm-II outperforms the Multi-Objective Particle Swarm Optimization algorithm in most of the utilized metrics. Moreover, the results indicate that our proposed model is more effective and efficient to schedule and plan surgeries and assign resources than manual scheduling.


2018 ◽  
Vol 10 (01) ◽  
pp. 1850009 ◽  
Author(s):  
Zhe Xiong ◽  
Xiao-Hui Li ◽  
Jing-Chang Liang ◽  
Li-Juan Li

In this study, a novel multi-objective hybrid algorithm (MHGH, multi-objective HPSO-GA hybrid algorithm) is developed by crossing the heuristic particle swarm optimization (HPSO) algorithm with a genetic algorithm (GA) based on the concept of Pareto optimality. To demonstrate the effectiveness of the MHGH, the optimizations of four unconstrained mathematical functions and four constrained truss structural problems are tested and compared to the results using several other classic algorithms. The results show that the MHGH improves the convergence rate and precision of the particle swarm optimization (PSO) and increases its robustness.


Author(s):  
Basabi Chakraborty

Selecting an optimum subset of features from a large set of features is an important pre- processing step for pattern classification, data mining, or machine learning applications. Feature subset selection basically comprises of defining a criterion function for evaluation of the feature subset and developing a search strategy to find the best feature subset from a large number of feature subsets. Lots of mathematical and statistical techniques have been proposed so far. Recently biologically inspired computing is gaining popularity for solving real world problems for their more flexibility compared to traditional statistical or mathematical techniques. In this chapter, the role of Particle Swarm Optimization (PSO), one of the recently developed bio-inspired evolutionary computational (EC) approaches in designing algorithms for producing optimal feature subset from a large feature set, is examined. A state of the art review on Particle Swarm Optimization algorithms and its hybrids with other soft computing techniques for feature subset selection are presented followed by author’s proposals of PSO based algorithms. Simple simulation experiments with benchmark data sets and their results are shown to evaluate their respective effectiveness and comparative performance in selecting best feature subset from a set of features.


2014 ◽  
Vol 20 (1) ◽  
pp. 188-192 ◽  
Author(s):  
Amir Rajabi Behjat ◽  
Aida Mustapha ◽  
Hossein Nezamabadi-Pour ◽  
Md. Nasir Sulaiman ◽  
Norwati Mustapha

Sign in / Sign up

Export Citation Format

Share Document