Learning classifier system ensembles with rule-sharing

被引:31
作者
Bull, Larry [1 ]
Studley, Matthew
Bagnall, Anthony
Whittley, Ian
机构
[1] Univ W England, Sch Comp Sci, Bristol BS16 1QY, Avon, England
[2] Univ E Anglia, Sch Comp Sci, Norwich NR4 7TJ, Norfolk, England
基金
英国工程与自然科学研究理事会;
关键词
data mining; genetic algorithms (GAs); parallel systems; reinforcement learning;
D O I
10.1109/TEVC.2006.885163
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper presents an investigation into exploiting the population-based nature of learning classifier systems (LCSs) for their use within highly parallel systems. In particular, the use of simple payoff and accuracy-based LCSs within the ensemble machine approach is examined. Results indicate that inclusion of a rule migration mechanism inspired by parallel genetic algorithms is an effective way to improve learning speed in comparison to equivalent single systems. Presentation of a mechanism which exploits the underlying niche-based generalization mechanism of accuracy-based systems is then shown to further improve their performance, particularly, as task complexity increases. This is not found to be the case for payoff-based systems. Finally, considerably better than linear speedup is demonstrated with the accuracy-based systems on a version of the well-known Boolean logic benchmark task used throughout.
引用
收藏
页码:496 / 502
页数:7
相关论文
共 41 条
[11]  
Bull L, 2004, STUD FUZZ SOFT COMP, V150, P276
[12]  
Bull L, 1999, GECCO-99: PROCEEDINGS OF THE GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, P83
[13]  
BULL L, 2005, FDN LEARNING CLASSIF, P63
[14]   Toward a theory of generalization and learning in XCS [J].
Butz, MV ;
Kovacs, T ;
Lanzi, PL ;
Wilson, SW .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2004, 8 (01) :28-46
[15]   Inducing oblique decision trees with evolutionary algorithms [J].
Cantú-Paz, E ;
Kamath, C .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2003, 7 (01) :54-68
[16]  
Cantu-Paz E., 2000, EFFICIENT ACCURATE P
[17]  
CELIS S, 2003, WEKA PARALLEL TECH R
[18]   An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization [J].
Dietterich, TG .
MACHINE LEARNING, 2000, 40 (02) :139-157
[19]  
DORIGO M, 1997, ROBOT SHAPING
[20]  
Folino G, 2000, LECT NOTES COMPUT SC, V1802, P294