arrow
返回

Online streaming feature selection using rough sets

delete2016-02-01
delete74
delete
OA
AI
S
Sadegh Eskandari *
M
Mohammad Masoud Javidi
DOI:10.1016/j.ijar.2015.11.006delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Feature Selection (FS) is an important pre-processing step in data mining and classification tasks. The aim of FS is to select a small subset of most important and discriminative features. All the traditional feature selection methods assume that the entire input feature set is available from the beginning. However, online streaming features (OSF) are an integral part of many real-world applications. In OSF, the number of training examples is fixed while the number of features grows with time as new features stream in. A critical challenge for online streaming feature selection (OSFS) is the unavailability of the entire feature set before learning starts. Several efforts have been made to address the OSFS problem, however they all need some prior knowledge about the entire feature space to select informative features. In this paper, the OSFS problem is considered from the rough sets (RS) perspective and a new OSFS algorithm, called OS-NRRSAR-SA, is proposed. The main motivation for this consideration is that RS-based data mining does not require any domain knowledge other than the given dataset. The proposed algorithm uses the classical significance analysis concepts in RS theory to control the unknown feature space in OSFS problems. This algorithm is evaluated extensively on several high-dimensional datasets in terms of compactness, classification accuracy, run-time, and robustness against noises. Experimental results demonstrate that the algorithm achieves better results than existing OSFS algorithms, in every way. (C) 2015 Elsevier Inc. All rights reserved.
Keyword:
Feature selection
Online streaming feature selection
Rough sets theory
Significance
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

International Journal of Approximate Reasoning 封面图
International Journal of Approximate Reasoning
IF:
3
论文数:
3.0K
被引数:
5.1K

机构

S
shahid bahonar university of kerman (sbuk)
学者数:
3.2K
论文数: 3.0K
被引数: 0
引用论文

引用论文

Online Feature Selection and Its Applications
err2014-03-01
err191
errOAAI
errWang, Jialei; Zhao, Peilin; Hoi, Steven C. H.; Jin, Rong
err分享
err收藏
Attribute reduction: A dimension incremental strategy
err2013-02-01
err125
PREAI
errWang, Feng; Liang, Jiye; Qian, Yuhua
err分享
err收藏
Porous photocatalysts for advanced water purifications用于高级水净化的多孔光催化剂
err2010-01-01
err0
PREAI
errJia Hong Pan; Haiqing Dou; Zhigang Xiong; Chen Xu; Jizhen Ma; X. S. Zhao
err分享
err收藏
The evolution and functional divergence of the histone H2B family in plants
err2020-07-27
err0
errOAAI
errDanhua Jiang; Michael Borg; Zdravko J. Lorković; Sean A. Montgomery; Akihisa Osakabe; Ramesh Yelagandula; Elin Axelsson; Frédéric Berger
err分享
err收藏
学者 查看更多内容