Robust multiobjective evolutionary feature subset selection algorithm for binary classification using machine learning techniques

Date

2017-06-07

Author

Deniz, Ayca
Kiziloz, Hakan Ezgi
Dokeroglu, Tansel
Coşar, Ahmet

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

271
views

0
downloads

This study investigates the success of a multiobjective genetic algorithm (GA) combined with state-of-the-art machine learning (ML) techniques for the feature subset selection (FSS) in binary classification problem (BCP). Recent studies have focused on improving the accuracy of BCP by including all of the features, neglecting to determine the best performing subset of features. However, for some problems, the number of features may reach thousands, which will cause too much computation power to be consumed during the feature evaluation and classification phases, also possibly reducing the accuracy of the results. Therefore, selecting the minimum number of features while preserving and/or increasing the accuracy of the results at a high level becomes an important issue for achieving fast and accurate binary classification. Our multiobjective evolutionary algorithm includes two phases, FSS using a GA and applying ML techniques for the BCP. Since exhaustively investigating all of the feature subsets is intractable, a GA is preferred for the first phase of the algorithm for intelligently detecting the most appropriate feature subset. The GA uses multiobjective crossover and mutation operators to improve a population of individuals (each representing a selected feature subset) and obtain (near-) optimal solutions through generations. In the second phase of the algorithms, the fitness of the selected subset is decided by using state-of-the-art ML techniques; Logistic Regression, Support Vector Machines, Extreme Learning Machine, K-means, and Affinity Propagation. The performance of the multiobjective evolutionary algorithm (and the ML techniques) is evaluated with comprehensive experiments and compared with state-of-the-art algorithms, Greedy Search, Particle Swarm Optimization, Tabu Search, and Scatter Search. The proposed algorithm was observed to be robust and it performed better than the existing methods on most of the datasets.

Subject Keywords

Multiobjective feature selection, Evolutionary algorithm, Binary classification, Supervised/unsupervised machine learning

URI

https://hdl.handle.net/11511/30566

Journal

NEUROCOMPUTING

DOI

https://doi.org/10.1016/j.neucom.2017.02.033

Collections

Graduate School of Natural and Applied Sciences, Article

Suggestions

OpenMETU
Core

An interactive preference based multiobjective evolutionary algorithm for the clustering problem Demirtaş, Kerem; Özdemirel, Nur Evin; Karasakal, Esra; Department of Industrial Engineering (2011) We propose an interactive preference-based evolutionary algorithm for the clustering problem. The problem is highly combinatorial and referred to as NP-Hard in the literature. The goal of the problem is putting similar items in the same cluster and dissimilar items into different clusters according to a certain similarity measure, while maintaining some internal objectives such as compactness, connectivity or spatial separation. However, using one of these objectives is often not sufficient to detect differ...
Multiobjective evolutionary feature subset selection algorithm for binary classification Deniz Kızılöz, Firdevsi Ayça; Coşar, Ahmet; Dökeroğlu, Tansel; Department of Computer Engineering (2016) This thesis investigates the performance of multiobjective feature subset selection (FSS) algorithms combined with the state-of-the-art machine learning techniques for binary classification problem. Recent studies try to improve the accuracy of classification by including all of the features in the dataset, neglecting to determine the best performing subset of features. However, for some problems, the number of features may reach thousands, which will cause too much computation power to be consumed during t...
Comparison of Facial Alignment Techniques: With Test Results on Gender Classification Task Kaya, Tunç Güven (2014-08-24) In this paper, different facial alignment techniques are revised in terms of their effects on machine learning algorithms. This paper, investigates techniques that are widely accepted in literature and measures their effect on gender classification task. There is no special reason on selecting gender classification task, any other task could have been chosen. In audience measurement systems, many important demographics, i.e. gender, age, facial expression, can be measured by using machine learning algorithm...
A new framework of multi-objective evolutionary algorithms for feature selection and multi-label classification of video data Karagoz, Gizem Nur; Yazıcı, Adnan; Dokeroglu, Tansel; Coşar, Ahmet (2020-06-01) There are few studies in the literature to address the multi-objective multi-label feature selection for the classification of video data using evolutionary algorithms. Selecting the most appropriate subset of features is a significant problem while maintaining/improving the accuracy of the prediction results. This study proposes a framework of parallel multi-objective Non-dominated Sorting Genetic Algorithms (NSGA-II) for exploring a Pareto set of non-dominated solutions. The subsets of non-dominated featu...
Gene reordering and concurrency in genetic algorithms Şehitoğlu, Onur Tolga; Üçoluk, Göktürk; Department of Computer Engineering (2002) This study first introduces an order-free chromosome encoding to enhance the performance of genetic algorithms by learning the linkage of building blocks in non-binary encodings. The method introduces a measure called affinity which is based on the statistical properties of gene valuations in the population. It uses the affinity values of the local and global gene pairs to construct a global permutation with tight building block positioning. Method is tested and experimental results are shown for a group of...

Citation Formats

A. Deniz, H. E. Kiziloz, T. Dokeroglu, and A. Coşar, “Robust multiobjective evolutionary feature subset selection algorithm for binary classification using machine learning techniques,” NEUROCOMPUTING, pp. 128–146, 2017, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/30566.