Prepending is a generic strategy for decision list learning that has lower computation and develops shorter decision lists than the classical approach, without any general increase in prediction error.
Publications
Newlands, D. A.; Webb, G. I.
Alternative Strategies for Decision List Construction
Ebecken, N. F. F. E.; Brebbia, C. A.; Zanasi, A. (Ed.): Proceedings of the Fourth International Conference on Data Mining (DATA MINING IV), pp. 265-273, WIT Press, Rio de Janeiro, Brazil, 2004.
@inproceedings{NewlandsWebb04a,
title = {Alternative Strategies for Decision List Construction},
author = {D. A. Newlands and G. I. Webb},
editor = {N. F. F. E. Ebecken and C. A. Brebbia and A. Zanasi},
year = {2004},
date = {2004-01-01},
booktitle = {Proceedings of the Fourth International Conference on Data Mining (DATA MINING IV)},
pages = {265-273},
publisher = {WIT Press},
address = {Rio de Janeiro, Brazil},
abstract = {This work surveys well-known approaches to building decision lists. Some novel variations to strategies based on default rules for the most common class and insertion of new rules before the default rule are presented. These are expected to offer speed up in the construction of the decision list as well as compression of the length of the list. These strategies and a testing regime have been implemented and some empirical studies done to compare the strategies. Experimental results are presented and interpreted. We show that all strategies deliver decision lists of comparable accuracy. However, two techniques are shown to deliver this accuracy with lists composed of significantly fewer rules than alternative strategies. Of these, one also demonstrates significant computational advantages. The prepending strategy is also demonstrated to produce decision lists which are as much as an order of magnitude shorter than those produced by CN2.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
This work surveys well-known approaches to building decision lists. Some novel variations to strategies based on default rules for the most common class and insertion of new rules before the default rule are presented. These are expected to offer speed up in the construction of the decision list as well as compression of the length of the list. These strategies and a testing regime have been implemented and some empirical studies done to compare the strategies. Experimental results are presented and interpreted. We show that all strategies deliver decision lists of comparable accuracy. However, two techniques are shown to deliver this accuracy with lists composed of significantly fewer rules than alternative strategies. Of these, one also demonstrates significant computational advantages. The prepending strategy is also demonstrated to produce decision lists which are as much as an order of magnitude shorter than those produced by CN2.
Webb, G. I.
Recent Progress in Learning Decision Lists by Prepending Inferred Rules
Proceedings of the Second Singapore International Conference on Intelligent Systems (SPICIS-94), pp. 280-285, Asia Computer Weekly, Singapore, 1994.
@inproceedings{Webb94a,
title = {Recent Progress in Learning Decision Lists by Prepending Inferred Rules},
author = {G. I. Webb},
year = {1994},
date = {1994-01-01},
booktitle = {Proceedings of the Second Singapore International Conference on Intelligent Systems (SPICIS-94)},
volume = {B},
pages = {280-285},
publisher = {Asia Computer Weekly},
address = {Singapore},
abstract = {This paper describes a new algorithm for learning decision lists that operates by prepending successive rules to the front of the list under construction. By contrast, the classic algorithm operates by appending successive rules to the end of the decision list under construction. The new algorithm is demonstrated in the majority of cases to produce smaller classifiers that provide improved predictive accuracy in less time than the classic algorithm.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
This paper describes a new algorithm for learning decision lists that operates by prepending successive rules to the front of the list under construction. By contrast, the classic algorithm operates by appending successive rules to the end of the decision list under construction. The new algorithm is demonstrated in the majority of cases to produce smaller classifiers that provide improved predictive accuracy in less time than the classic algorithm.
Webb, G. I.; Brkic, N.
Learning Decision Lists by Prepending Inferred Rules
Sestito, S. (Ed.): Proceedings of the AI 93 Workshop on Machine Learning and Hybrid Systems, pp. 6-10, Melbourne, Australia, 1993.
@inproceedings{WebbBrkic93,
title = {Learning Decision Lists by Prepending Inferred Rules},
author = {G. I. Webb and N. Brkic},
editor = {S. Sestito},
year = {1993},
date = {1993-01-01},
booktitle = {Proceedings of the AI 93 Workshop on Machine Learning and Hybrid Systems},
pages = {6-10},
address = {Melbourne, Australia},
abstract = {This paper describes a new algorithm for learning decision lists that operates by prepending successive rules to front of the list under construction. This contrasts with the original decision list induction algorithm which operates by appending successive rules to end of the list under construction. The new algorithm is demonstrated in the majority of cases to produce smaller classifiers that provide improved predictive accuracy than those produced by the original decision list induction algorithm.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
This paper describes a new algorithm for learning decision lists that operates by prepending successive rules to front of the list under construction. This contrasts with the original decision list induction algorithm which operates by appending successive rules to end of the list under construction. The new algorithm is demonstrated in the majority of cases to produce smaller classifiers that provide improved predictive accuracy than those produced by the original decision list induction algorithm.