Paired Learners for Concept Drift

Stephen H. Bach, M. Maloof
{"title":"Paired Learners for Concept Drift","authors":"Stephen H. Bach, M. Maloof","doi":"10.1109/ICDM.2008.119","DOIUrl":null,"url":null,"abstract":"To cope with concept drift, we paired a stable online learner with a reactive one. A stable learner predicts based on all of its experience, whereas are active learner predicts based on its experience over a short, recent window of time. The method of paired learning uses differences in accuracy between the two learners over this window to determine when to replace the current stable learner, since the stable learner performs worse than does there active learner when the target concept changes. While the method uses the reactive learner as an indicator of drift, it uses the stable learner to predict, since the stable learner performs better than does the reactive learner when acquiring target concept. Experimental results support these assertions. We evaluated the method by making direct comparisons to dynamic weighted majority, accuracy weighted ensemble, and streaming ensemble algorithm (SEA) using two synthetic problems, the Stagger concepts and the SEA concepts, and three real-world data sets: meeting scheduling, electricity prediction, and malware detection. Results suggest that, on these problems, paired learners outperformed or performed comparably to methods more costly in time and space.","PeriodicalId":252958,"journal":{"name":"2008 Eighth IEEE International Conference on Data Mining","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"141","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Eighth IEEE International Conference on Data Mining","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDM.2008.119","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 141

Abstract

To cope with concept drift, we paired a stable online learner with a reactive one. A stable learner predicts based on all of its experience, whereas are active learner predicts based on its experience over a short, recent window of time. The method of paired learning uses differences in accuracy between the two learners over this window to determine when to replace the current stable learner, since the stable learner performs worse than does there active learner when the target concept changes. While the method uses the reactive learner as an indicator of drift, it uses the stable learner to predict, since the stable learner performs better than does the reactive learner when acquiring target concept. Experimental results support these assertions. We evaluated the method by making direct comparisons to dynamic weighted majority, accuracy weighted ensemble, and streaming ensemble algorithm (SEA) using two synthetic problems, the Stagger concepts and the SEA concepts, and three real-world data sets: meeting scheduling, electricity prediction, and malware detection. Results suggest that, on these problems, paired learners outperformed or performed comparably to methods more costly in time and space.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
概念漂移的配对学习者
为了应对概念漂移,我们将一个稳定的在线学习者与一个反应型学习者配对。一个稳定的学习者根据其所有的经验进行预测,而一个积极的学习者根据其在短时间内的经验进行预测。配对学习的方法利用两个学习器在这段时间内的准确度差异来决定何时替换当前的稳定学习器,因为当目标概念发生变化时,稳定学习器的表现比主动学习器差。虽然该方法使用反应学习器作为漂移的指标,但它使用稳定学习器进行预测,因为稳定学习器在获取目标概念时比反应学习器表现得更好。实验结果支持这些论断。我们通过使用两个综合问题,Stagger概念和SEA概念,以及三个真实世界的数据集:会议调度、电力预测和恶意软件检测,直接比较动态加权多数、精度加权集成和流集成算法(SEA)来评估该方法。结果表明,在这些问题上,配对学习者比在时间和空间上花费更多的方法表现得更好或表现得相当。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
SeqStream: Mining Closed Sequential Patterns over Stream Sliding Windows Support Vector Regression for Censored Data (SVRc): A Novel Tool for Survival Analysis A Probability Model for Projective Clustering on High Dimensional Data Text Cube: Computing IR Measures for Multidimensional Text Database Analysis A Hierarchical Algorithm for Clustering Uncertain Data via an Information-Theoretic Approach
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1