An extended laplacian score algorithm for unsupervised feature selection

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

Abstract

Experts from various sectors, utilize data mining techniques to discover most useful information from the huge amount of data, to improve their quality of outcomes. The Presence of irrelevant and redundant features affects the accuracy of mining result. Before applying any mining technique, the data need to be preprocessed. Feature selection, a preprocessing step in data mining provides better mining performance. In this paper, we propose a new two step algorithm for unsupervised feature selection. In the first step Laplacian Score is used to select the important features. And in the second step, Symmetric Uncertainty is used to remove redundant features. The experimental results show that the proposed algorithm outperforms the Laplacian Score algorithm.

Cite

CITATION STYLE

APA

Sutha, K., & Tamilselvi, J. J. (2019). An extended laplacian score algorithm for unsupervised feature selection. International Journal of Engineering and Advanced Technology, 8(6), 4359–4362. https://doi.org/10.35940/ijeat.F8931.088619

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