Paired Learners for Concept Drift

被引:79
作者
Bach, Stephen H. [1 ]
Maloof, Marcus A. [1 ]
机构
[1] Georgetown Univ, Dept Comp Sci, Washington, DC 20057 USA
来源
ICDM 2008: EIGHTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS | 2008年
关键词
D O I
10.1109/ICDM.2008.119
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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 a reactive 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 the reactive 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 a 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.
引用
收藏
页码:23 / 32
页数:10
相关论文
共 18 条
  • [1] [Anonymous], 2005, DATA MINING PRACTICA
  • [2] [Anonymous], 2003, Proc. ACM SIGKDD Int. Conf. Knowl. Discov. Data Min, DOI 10.1145/ 956750.956778
  • [3] Becker H, 2007, KDD-2007 PROCEEDINGS OF THE THIRTEENTH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, P86
  • [4] Empirical support for Winnow and Weighted-Majority algorithms: Results on a calendar scheduling domain
    Blum, A
    [J]. MACHINE LEARNING, 1997, 26 (01) : 5 - 23
  • [5] Domingos P., 2000, Proceedings. KDD-2000. Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, P71, DOI 10.1145/347090.347107
  • [6] GAMA J, 2005, P 2005 ACM S APPL CO, P573
  • [7] Extracting hidden context
    Harries, MB
    Sammut, C
    Horn, K
    [J]. MACHINE LEARNING, 1998, 32 (02) : 101 - 126
  • [8] Hulten G, 2001, P 7 ACM SIGKDD INT C, P97, DOI DOI 10.1145/502512.502529
  • [9] Kolter J.Z., 2005, PROC INT C MACHINE L, P449
  • [10] Kolter JZ, 2007, J MACH LEARN RES, V8, P2755