Learning with Decision Lists of Data-Dependent Features
Mario Marchand, Marina Sokolova; 6(15):427−451, 2005.
Abstract
We present a learning algorithm for decision lists which allows features that are constructed from the data and allows a trade-off between accuracy and complexity. We provide bounds on the generalization error of this learning algorithm in terms of the number of errors and the size of the classifier it finds on the training data. We also compare its performance on some natural data sets with the set covering machine and the support vector machine. Furthermore, we show that the proposed bounds on the generalization error provide effective guides for model selection.
[abs]
[pdf][bib]| © JMLR 2005. (edit, beta) |