A co-evolving decision tree classification method

被引:80
作者
Aitkenhead, M. J. [1 ]
机构
[1] Univ Aberdeen, Dept Plant & Soil Sci, Aberdeen AB24 3UU, Scotland
关键词
decision tree; evolutionary computation; simulated annealing; data mining; classification;
D O I
10.1016/j.eswa.2006.08.008
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
yDecision tree classification provides a rapid and effective method of categorising datasets. Many algorithmic methods exist for optimising decision tree structure, although these can be vulnerable to changes in the training dataset. An evolutionary method is presented which allows decision tree flexibility through the use of co-evolving competition between the decision tree and the training data set. This method is tested using two different datasets and gives results comparable with or superior to other classification methods. A final discussion argues for the utility of decision trees over algorithmic or other alternative methods such as neural networks, particularly in situations where a large number of variables are being considered. (c) 2006 Elsevier Ltd. All rights reserved.
引用
收藏
页码:18 / 25
页数:8
相关论文
共 31 条
[1]  
Alsabti K., 1998, Proceedings Fourth International Conference on Knowledge Discovery and Data Mining, P2
[2]  
ANKERST M, 1999, P INT C KNOWL DIS DA
[3]  
[Anonymous], P 10 EUR C MACH LEAR
[4]  
BERNSTEIN A, 2001, IS0101 LEON STERN SC
[5]  
Bohanec Marko, 1988, P 8 INT WORKSH EXP S, P59
[6]   Bagging predictors [J].
Breiman, L .
MACHINE LEARNING, 1996, 24 (02) :123-140
[7]  
Cantu-Paz E., 2000, P GEN EV COMP C GECC, P1053
[8]  
DIETTERICH TG, 1990, ANN REV COMPUTER SCI, V4
[9]  
Endou T, 2002, IEEE C EVOL COMPUTAT, P1221, DOI 10.1109/CEC.2002.1004417
[10]  
Ferri U, 2003, LECT NOTES ARTIF INT, V2837, P121