.png){kind=icon}
Return
Learning concept-drifting data streams with random ensemble decision trees
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2015.04.024.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Few online classification algorithms based on traditional inductive ensembling, such as online bagging or boosting, focus on handling concept drifting data streams while performing well on noisy data. Motivated by this, an incremental algorithm based on Ensemble Decision Trees for Concept-drifting data streams (EDTC) is proposed in this paper. Three variants of random feature selection are introduced to implement split-tests and two thresholds specified in Hoeffding Bounds inequality are utilized to distinguish concept drifts from noisy data. Extensive studies on synthetic and real streaming databases demonstrate that our algorithm of EDTC performs very well compared to several known online algorithms based on single models and ensemble models. A conclusion is hence drawn that multiple solutions are provided for learning from concept drifting data streams under noise. (C) 2015 Elsevier B.V. All rights reserved.
Keywords:
Data streams
Random decision tree
Concept drift
Noisy data
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W
Organization
Cited Papers
.png){kind=icon}
ShareSaveProlonged suppression of the innate immune system in the horse following an 80 km endurance race
OAAI
OAAIShareSaveShareSaveShareSave
View more