Unsupervised feature selection using correlation score

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

Abstract

Data of huge dimensionality is generated because of wide application of technologies. Using this data for the very purpose of decision-making is greatly affected because of the curse of dimensionality as selection of all features will lead to overfitting and ignoring the relevant ones can lead to information loss. Feature selection algorithms help to overcome this problem by identifying the subset of original features by retaining relevant features and by removing the redundant ones. This paper aims to evaluate and analyze some of the most popular feature selection algorithms using different benchmarked datasets. Relief, ReliefF, and Random Forest algorithms are evaluated and analyzed in the form of combinations of different rankers and classifiers. It is observed empirically that the accuracy of the ranker and classifier varies from dataset to dataset. This paper introduces the concept of applying multivariate correlation analysis (MCA) for feature selection. From results, it can be inferred that MCA exhibits better performance over the legacy-based feature selection algorithms.

Cite

CITATION STYLE

APA

Pattanshetti, T., & Attar, V. (2018). Unsupervised feature selection using correlation score. In Advances in Intelligent Systems and Computing (Vol. 810, pp. 355–362). Springer Verlag. https://doi.org/10.1007/978-981-13-1513-8_37

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