On-line learning of decision trees in problems with unknown dynamics

被引:0
作者
Núñez, M [1 ]
Fidalgo, R [1 ]
Morales, R [1 ]
机构
[1] Univ Malaga, Dept Languages & Comp Sci, E-29071 Malaga, Spain
来源
MICAI 2005: ADVANCES IN ARTIFICIAL INTELLIGENCE | 2005年 / 3789卷
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Learning systems need to face several problems: incrementality, tracking concept drift, robustness to noise and recurring contexts in order to operate continuously. A method for on-line induction of decision trees motivated by the above requirements is presented. It uses the following strategy: creating a delayed window in every node for applying forgetting mechanisms; automatic modification of the delayed window; and constructive induction for identifying recurring contexts. The default configuration of the proposed approach has shown to be globally efficient, reactive, robust and problem-independent, which is suitable for problems with unknown dynamics. Notable results have been obtained when noise and concept drift are present.
引用
收藏
页码:443 / 453
页数:11
相关论文
共 15 条
[1]  
Blake C.L., 1998, UCI repository of machine learning databases
[2]  
Kolter JZ, 2003, THIRD IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, P123
[3]  
KRIKAZOVA I, 1993, PATTERN RECOGN, V13, P19
[4]   Selecting examples for partial memory learning [J].
Maloof, MA ;
Michalski, RS .
MACHINE LEARNING, 2000, 41 (01) :27-52
[5]  
Maloof MA, 2002, LECT NOTES ARTIF INT, V2366, P16
[6]  
PAXON V, 2000, RFC2988
[7]  
POSTEL P, 1981, RFC793
[8]  
Quinlan J. R., 1986, Machine Learning, V1, P81, DOI 10.1007/BF00116251
[9]  
Quinlan J. R., 2014, C4 5 PROGRAMS MACHIN
[10]  
Schlimmer J. C., 1986, Machine Learning, V1, P317, DOI 10.1023/A:1022810614389