arrow
Return

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
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

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.
Keywords:
Feature selection
Online streaming feature selection
Rough sets theory
Significance
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

International Journal of Approximate Reasoning cover
International Journal of Approximate Reasoning
IF:
3
Papers:
3.0K
Citations:
5.1K

Organization

S
shahid bahonar university of kerman (sbuk)
Scholars:
3.2K
Papers: 3.0K
Citations: 0
Cited Papers

Cited Papers

Online Feature Selection and Its Applications
err2014-03-01
err191
errOAAI
errWang, Jialei; Zhao, Peilin; Hoi, Steven C. H.; Jin, Rong
errShare
errSave
errShare
errSave
Attribute reduction: A dimension incremental strategy
err2013-02-01
err125
PREAI
errWang, Feng; Liang, Jiye; Qian, Yuhua
errShare
errSave
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
errShare
errSave
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
errShare
errSave
researcher View more