Pairwise dependence-based unsupervised feature selection
- Authors
- Lim, H.; Kim, Dae-Won
- Issue Date
- Mar-2021
- Publisher
- Elsevier Ltd
- Keywords
- Feature dependency; Feature redundancy; Joint entropy; l2, 1 regularization; Unsupervised feature selection
- Citation
- Pattern Recognition, v.111
- Journal Title
- Pattern Recognition
- Volume
- 111
- URI
- https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/43589
- DOI
- 10.1016/j.patcog.2020.107663
- ISSN
- 0031-3203
1873-5142
- Abstract
- 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
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Software > School of Computer Science and Engineering > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/43589)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.