This paper describes the incremental multiplexer problem, a new test problem for machine learning research. The incremental multiplexer problem is an extended version of the multiplexer problem, a well-known test problem for data mining systems that do classification. The multiplexer problem has been one of the testbed problems driving the development of classifier systems in the last 15 years, but it has one drawback: the number of different multiplexer problems that are interesting and solvable with current computers is very small. This paper describes a generalization of the multiplexer problem that has many instances that are accessible to today’s researchers. The paper contains results showing how the performance of a classifier system with fixed parameter settings changes as the size of the message generated by incremental multiplexers increases, suggesting that the incremental multiplexer provides machine learning problems that “fill in the gaps” between the standard multiplexer problems.
CITATION STYLE
Davis, L., Fu, C., & Wilson, S. W. (2002). An incremental multiplexer problem and its uses in classifier system research. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2321, pp. 23–31). Springer Verlag. https://doi.org/10.1007/3-540-48104-4_2
Mendeley helps you to discover research relevant for your work.