Pairwise dependence-based unsupervised feature selection

Citations

WEB OF SCIENCE

75
Citations

SCOPUS

90

초록

Many research topics present very high dimensional data. Because of the heavy execution times and large memory requirements, many machine learning methods have difficulty in processing these data. In this paper, we propose a new unsupervised feature selection method considering the pairwise dependence of features (feature dependency-based unsupervised feature selection, or DUFS). To avoid selecting redundant features, the proposed method calculates the dependence among features and applies this information to a regression-based unsupervised feature selection process. We can select small feature set with the dependence among features by eliminating redundant features. To consider the dependence among features, we used mutual information widely used in supervised feature selection area. To our best knowledge, it is the first study to consider the pairwise dependence of features in the unsupervised feature selection method. Experimental results for six data sets demonstrate that the proposed method outperforms existing state-of-the-art unsupervised feature selection methods in most cases. © 2020 Elsevier Ltd

키워드

Feature dependency; Feature redundancy; Joint entropy; l2, 1 regularization; Unsupervised feature selection; Clustering algorithms; Learning systems; High dimensional data; Machine learning methods; Memory requirements; Mutual informations; Redundant features; Research topics; State of the art; Unsupervised feature selection; Feature extraction
제목
Pairwise dependence-based unsupervised feature selection
저자
Lim, H.; Kim, Dae-Won
DOI
10.1016/j.patcog.2020.107663
발행일
2021-03
유형
Article
저널명
Pattern Recognition
권
111