Fast for Feature Subset Selection Over Dataset
International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064


Downloads: 118 | Views: 307 | Weekly Hits: ⮙1 | Monthly Hits: ⮙1

M.Tech / M.E / PhD Thesis | Computer Science & Engineering | India | Volume 3 Issue 6, June 2014 | Popularity: 6.7 / 10


     

Fast for Feature Subset Selection Over Dataset

Jesna Jose, Reeba R


Abstract: Feature selection is the process of identifying the most suitable features that is compatible with the target set features and thereby reducing feature space to an optimal minimum. The feature selection algorithm can be evaluated on the basis of two criteria: efficiency and effectiveness. Efficiency is measured on the basis of time required to find the feature set and effectiveness measures the quality of the feature. In fact feature selection; as a preprocessing step which is effective in reducing dimensionality; removing irrelevant data; removing redundant data etc. . However; the recent increase of dimensionality of data poses a severe challenge to many existing feature selection methods with respect to efficiency and effectiveness. In this paper various feature selection methods are depicted and proposes a new clustering based feature subset selection algorithm for feature selection.


Keywords: Feature clustering, feature subset selection


Edition: Volume 3 Issue 6, June 2014


Pages: 380 - 383



Please Disable the Pop-Up Blocker of Web Browser

Verification Code will appear in 2 Seconds ... Wait



Text copied to Clipboard!
Jesna Jose, Reeba R, "Fast for Feature Subset Selection Over Dataset", International Journal of Science and Research (IJSR), Volume 3 Issue 6, June 2014, pp. 380-383, https://www.ijsr.net/getabstract.php?paperid=20131791, DOI: https://www.doi.org/10.21275/20131791

Top