期刊
FRONTIERS OF COMPUTER SCIENCE
卷 12, 期 3, 页码 479-493出版社
HIGHER EDUCATION PRESS
DOI: 10.1007/s11704-016-5489-3
关键词
big data; feature selection; online feature selection; feature stream
类别
资金
- National Key Research and Development Program of China [2016YFB1000901]
- Program for Changjiang Scholars and Innovative Research Team in University (PCSIRT) of the Ministry of Education, China [IRT13059]
- National Basic Research Program (973 Program) of China [2013CB329604]
- Specialized Research Fund for the Doctoral Program of Higher Education [20130111110011]
- National Natural Science Foundation of China [61273292, 61229301, 61503112, 61673152]
In the era of big data, the dimensionality of data is increasing dramatically in many domains. To deal with high dimensionality, online feature selection becomes critical in big data mining. Recently, online selection of dynamic features has received much attention. In situations where features arrive sequentially over time, we need to perform online feature selection upon feature arrivals. Meanwhile, considering grouped features, it is necessary to deal with features arriving by groups. To handle these challenges, some state-of-the-art methods for online feature selection have been proposed. In this paper, we first give a brief review of traditional feature selection approaches. Then we discuss specific problems of online feature selection with feature streams in detail. A comprehensive review of existing online feature selection methods is presented by comparing with each other. Finally, we discuss several open issues in online feature selection.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据