Name
Abstract | ||
|---|---|---|
In many big data applications, online streaming feature selection plays a critical role in processing feature stream and dealing with high-dimensional problems. However, traditional online streaming feature selection methods focus on relevant features, irrelevant and/or redundant features, ignore the interaction between features. i.e., individual feature and label are irrelevant or weakly correlated, but when it is combined with another irrelevant or weakly feature, they show strongly correlated with label. In this paper, we propose a novel feature selection algorithm that considers feature interaction based on neighborhood rough set. This algorithm select features based on the following principles: the discrimination capability of the selected feature subset should be greater than or equal to the original feature space, and the number of features subset should be as small as possible by using feature interaction. Under this framework, we propose an online significance analysis criterion to select significance features relative to the currently selected features, and design an online redundancy analysis criterion to retain highly interactive features and filter out redundant features. Experimental results on a series of benchmark datasets show that the proposed algorithm significantly outperforms other state-of-the-art online streaming feature selection methods. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/ICBK50248.2020.00017 | 2020 IEEE International Conference on Knowledge Graph (ICKG) |
Keywords | DocType | ISBN |
Online feature selection,Feature interaction,Streaming feature,Neighborhood rough set | Conference | 978-1-7281-8157-8 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yan Lv | 1 | 0 | 0.34 |
| Yaojin Lin | 2 | 0 | 0.68 |
| Xiangyan Chen | 3 | 0 | 0.34 |
| Dongxing Wang | 4 | 0 | 0.34 |
| Chenxi Wang | 5 | 30 | 2.29 |