LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Hybrid binary ant lion optimizer with rough set and approximate entropy reducts for feature selection

Photo from wikipedia

Feature selection (FS) can be defined as the problem of finding the minimal number of features from an original set with the minimum information loss. Since FS problems are known… Click to show full abstract

Feature selection (FS) can be defined as the problem of finding the minimal number of features from an original set with the minimum information loss. Since FS problems are known as NP-hard problems, it is necessary to investigate a fast and an effective search algorithm to tackle this problem. In this paper, two incremental hill-climbing techniques (QuickReduct and CEBARKCC) are hybridized with the binary ant lion optimizer in a model called HBALO. In the proposed approach, a pool of solutions (ants) is generated randomly and then enhanced by embedding the most informative features in the dataset that are selected by the two filter feature selection models. The resultant population is then used by BALO algorithm to find the best solution. The proposed binary approaches are tested on a set of 18 well-known datasets from UCI repository and compared with the most recent related approaches. The experimental results show the superior performance of the proposed approaches in searching the feature space for optimal feature combinations.

Keywords: lion optimizer; ant lion; feature selection; binary ant; selection

Journal Title: Soft Computing
Year Published: 2019

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.