Online Feature Screening for Data Streams with Concept Drift
Not on the map. Why?
Abstract (arXiv)
Screening feature selection methods are often used as a preprocessing step for reducing the number of variables before training step. Traditional screening methods only focus on dealing with complete high dimensional datasets. Modern datasets not only have higher dimension and larger sample size, but also have properties such as streaming input, sparsity and concept drift. Therefore a considerable number of online feature selection methods were introduced to handle these kind of problems in recent years. Online screening methods are one of the categories of online feature selection methods. The methods that we proposed in this research are capable of handling all three situations mentioned above. Our research study focuses on classification datasets. Our experiments show proposed methods can generate the same feature importance as their offline version with faster speed and less storage consumption. Furthermore, the results show that online screening methods with integrated model adaptation have a higher true feature detection rate than without model adaptation on data streams with the concept drift property. Among the two large real datasets that potentially have the concept drift property, online screening methods with model adaptation show advantages in either saving computing time and space, reducing model complexity, or improving prediction accuracy.
Key facts. Cited by 1 paper in the map (data through 13 Oct 2026). Builds on 6 of its 63 references that are in the map. First posted on arXiv 7 Apr 2021.
Builds on
6 of 63 references.
References · 6
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,143
- 2016Decision Forests, Convolutional Networks and the Models in-Betweencited by 15
- 2020Leveraging Model Inherent Variable Importance for Stable Online Feature Selectioncited by 9
- 2020Neural Rule Ensembles: Encoding Sparse Feature Interactions into Neural Networkscited by 3
- 2018Are screening methods useful in feature selection? An empirical studycited by 2
- 2014Updating Formulas and Algorithms for Computing Entropy and Gini Index from Time-Changing Data Streamscited by 1
Built on by
Citing papers per year: 2025: 1.
1 paper.