A Study on Meta Heuristic Algorithms for Feature Selection

11Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Vast number of feature selection methods are available to evaluate the best subset of features as the data in the real world is growing bigger and bigger. Feature selection methods are essential in order to reduce the processing time of the model, improving the accuracy of the model, and to avoid the problem of curse of dimensionality. The objective of this paper is to elaborate feature selection which is essential for classification and prediction tasks. We concentrate on meta heuristic algorithms for optimal feature subset selection. We also made a comparison of the characteristics of meta heuristic algorithms.

Cite

CITATION STYLE

APA

Shenbaga Moorthy, R., & Pabitha, P. (2019). A Study on Meta Heuristic Algorithms for Feature Selection. In Lecture Notes on Data Engineering and Communications Technologies (Vol. 26, pp. 1291–1298). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-03146-6_151

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free