A Survey on Feature Selection

被引:280
作者
Miao, Jianyu [1 ,3 ]
Niu, Lingfeng [2 ,3 ]
机构
[1] Univ Chinese Acad Sci, Sch Math Sci, Beijing 100019, Peoples R China
[2] Chinese Acad Sci, Res Ctr Fictitious Econ & Data Sci, Beijing 100190, Peoples R China
[3] Chinese Acad Sci, Key Lab Big Data Min & Knowledge Management, Beijing 100190, Peoples R China
来源
PROMOTING BUSINESS ANALYTICS AND QUANTITATIVE MANAGEMENT OF TECHNOLOGY: 4TH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND QUANTITATIVE MANAGEMENT (ITQM 2016) | 2016年 / 91卷
关键词
feature selection; machine learning; unsupervised; clustering;
D O I
10.1016/j.procs.2016.07.111
中图分类号
F [经济];
学科分类号
02 ;
摘要
Feature selection, as a dimensionality reduction technique, aims to choosing a small subset of the relevant features from the original features by removing irrelevant, redundant or noisy features. Feature selection usually can lead to better learning performance, i.e., higher learning accuracy, lower computational cost, and better model interpretability. Recently, researchers from computer vision, text mining and so on have proposed a variety of feature selection algorithms and in terms of theory and experiment, show the effectiveness of their works. This paper is aimed at reviewing the state of the art on these techniques. Furthermore, a thorough experiment is conducted to check if the use of feature selection can improve the performance of learning, considering some of the approaches mentioned in the literature. The experimental results show that unsupervised feature selection algorithms benefits machine learning tasks improving the performance of clustering. (C) 2016 The Authors. Published by Elsevier B. V.
引用
收藏
页码:919 / 926
页数:8
相关论文
共 40 条
  • [1] [Anonymous], TECH REP
  • [2] [Anonymous], AMSTER658
  • [3] [Anonymous], 2007, PROC 24 INT C MACH L
  • [4] [Anonymous], 2007, Multi-Task Feature Learning, DOI DOI 10.7551/MITPRESS/7503.003.0010
  • [5] [Anonymous], AAAI
  • [6] [Anonymous], KNOWLEDGE DATA ENG I
  • [7] [Anonymous], 2007, SDM
  • [8] [Anonymous], 2004, PROCEEDINGS OF THE T
  • [9] [Anonymous], 2007, PROC IEEE INT C COMP
  • [10] [Anonymous], PROCEEDINGS OF THE 2