Welcome to the InfoSci Platform
Reference Hub2
Feature Selection and Knapsack Problem Resolution Based on a Discrete Backtracking Optimization Algorithm

Feature Selection and Knapsack Problem Resolution Based on a Discrete Backtracking Optimization Algorithm

Khadoudja Ghanem, Abdesslem Layeb
Copyright: © 2021 |Volume: 12 |Issue: 2 |Pages: 15
ISSN: 1942-3594|EISSN: 1942-3608|EISBN13: 9781799860778|DOI: 10.4018/IJAEC.2021040101
Cite Article Cite Article

MLA

Ghanem, Khadoudja, and Abdesslem Layeb. "Feature Selection and Knapsack Problem Resolution Based on a Discrete Backtracking Optimization Algorithm." IJAEC vol.12, no.2 2021: pp.1-15. http://doi.org/10.4018/IJAEC.2021040101

APA

Ghanem, K. & Layeb, A. (2021). Feature Selection and Knapsack Problem Resolution Based on a Discrete Backtracking Optimization Algorithm. International Journal of Applied Evolutionary Computation (IJAEC), 12(2), 1-15. http://doi.org/10.4018/IJAEC.2021040101

Chicago

Ghanem, Khadoudja, and Abdesslem Layeb. "Feature Selection and Knapsack Problem Resolution Based on a Discrete Backtracking Optimization Algorithm," International Journal of Applied Evolutionary Computation (IJAEC) 12, no.2: 1-15. http://doi.org/10.4018/IJAEC.2021040101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Backtracking search optimization algorithm is a recent stochastic-based global search algorithm for solving real-valued numerical optimization problems. In this paper, a binary version of backtracking algorithm is proposed to deal with 0-1 optimization problems such as feature selection and knapsack problems. Feature selection is the process of selecting a subset of relevant features for use in model construction. Irrelevant features can negatively impact model performances. On the other hand, knapsack problem is a well-known optimization problem used to assess discrete algorithms. The objective of this research is to evaluate the discrete version of backtracking algorithm on the two mentioned problems and compare obtained results with other binary optimization algorithms using four usual classifiers: logistic regression, decision tree, random forest, and support vector machine. Empirical study on biological microarray data and experiments on 0-1 knapsack problems show the effectiveness of the binary algorithm and its ability to achieve good quality solutions for both problems.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.