Collective behavior based hierarchical XCS

This paper attempts to extend the XCS research by analyzing the impact of information exchange between XCS agents on classifier performance. Two types of information are exchanged and combined to improve classification performance. The first uncovers information contained in the signal patterns of collections of Homogeneous XCS classifiers. This information is used to determine which subsets of the state-space the XCS can be expected to be accurately classified. The second combines the results of XCS agents that are each tasked to solve different portions of the original problem. Results on the multiplexer (6, 11) indicate that given accurate problem domain assumptions, the Collective Behavior (CB-HXCS) method shows promise. Results show - at least in simulated multiplexer environments - that the HXCS is able to solve a well defined problem with less data than an individual XCS. This approach seems very promissing in real-world applications where data is incomplete, expensive or unreliable such as in financial or medical domains.

[1]  Leo Breiman,et al.  Bagging Predictors , 1996, Machine Learning.

[2]  Stewart W. Wilson Classifier Fitness Based on Accuracy , 1995, Evolutionary Computation.

[3]  David H. Wolpert,et al.  Stacked generalization , 1992, Neural Networks.

[4]  Hussein A. Abbass,et al.  DXCS: an XCS system for distributed data mining , 2005, GECCO '05.

[5]  David E. Goldberg,et al.  A Critical Review of Classifier Systems , 1989, ICGA.

[6]  Thomas G. Dietterich Multiple Classifier Systems , 2000, Lecture Notes in Computer Science.

[7]  Stewart W. Wilson Classifier systems and the animat problem , 2004, Machine Learning.