返回
Pairwise dependence-based unsupervised feature selection
DOI:10.1016/j.patcog.2020.107663.png)
摘要
En 中文
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. (C) 2020 Elsevier Ltd. All rights reserved.
Keyword:
Unsupervised feature selection
Feature dependency
Feature redundancy
Joint entropy
l(2, 1) regularization
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
Nonnegative Laplacian embedding guided subspace learning for unsupervised feature selection用于无监督特征选择的非负拉普拉斯嵌入引导子空间学习
PATTERN RECOGNITION
IF7.6
Global and local structure preserving sparse subspace learning: An iterative approach to unsupervised feature selection
PATTERN RECOGNITION
IF7.6
Simultaneous feature selection and discretization based on mutual information基于互信息的同时特征选择和离散化
PATTERN RECOGNITION
IF7.6

