Open AccessOpen Access


Binary Representation of Polar Bear Algorithm for Feature Selection

Amer Mirkhan1, Numan Çelebi2,*

1 Sakarya University, Computer Engineering Department, Sakarya, Turkey
2 Sakarya University, Information Systems Engineering Department, Sakarya, Turkey

* Corresponding Author: Numan Çelebi. Email:

Computer Systems Science and Engineering 2022, 43(2), 767-783.


In most of the scientific research feature selection is a challenge for researcher. Selecting all available features is not an option as it usually complicates the research and leads to performance drop when dealing with large datasets. On the other hand, ignoring some features can compromise the data accuracy. Here the rough set theory presents a good technique to identify the redundant features which can be dismissed without losing any valuable information, however, exploring all possible combinations of features will end with NP-hard problem. In this research we propose adopting a heuristic algorithm to solve this problem, Polar Bear Optimization PBO is a metaheuristic algorithm provides an effective technique for solving such kind of optimization problems. Among other heuristic algorithms it proposes a dynamic mechanism for birth and death which allows keep investing in promising solutions and keep dismissing hopeless ones. To evaluate its efficiency, we applied our proposed model on several datasets and measured the quality of the obtained minimal feature set to prove that redundant data was removed without data loss.


Cite This Article

A. Mirkhan and N. Çelebi, "Binary representation of polar bear algorithm for feature selection," Computer Systems Science and Engineering, vol. 43, no.2, pp. 767–783, 2022.

This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 1022


  • 435


  • 3


Share Link