Improving Adaptive Bagging Methods for Evolving Data Streams

详细信息    查看全文

• 作者：Albert Bifet ; Geoff Holmes ; Bernhard Pfahringer ; Ricard Gavald¨¤
• 刊名：Lecture Notes in Computer Science
• 出版年：2009
• 出版时间：2009
• 年：2009
• 卷：5828
• 期：1
• 页码：23-37
• 全文大小：284.0 KB

文摘

We propose two new improvements for bagging methods on evolving data streams. Recently, two new variants of Bagging were proposed: ADWIN Bagging and Adaptive-Size Hoeffding Tree (ASHT) Bagging. ASHT Bagging uses trees of different sizes, and ADWIN Bagging uses ADWIN as a change detector to decide when to discard underperforming ensemble members. We improve ADWIN Bagging using Hoeffding Adaptive Trees, trees that can adaptively learn from data streams that change over time. To speed up the time for adapting to change of Adaptive-Size Hoeffding Tree (ASHT) Bagging, we add an error change detector for each classifier. We test our improvements by performing an evaluation study on synthetic and real-world datasets comprising up to ten million examples.