Learning with Decision Lists of Data-Dependent Features.

Saved in:
Bibliographic Details
Title: Learning with Decision Lists of Data-Dependent Features.
Authors: Marchand, Mario1 MARIO.MARCHAND@IFT.ULAVAL.CA, Sokolova, Marina2 SOKOLOVA@SITE.UOTTAWA.CA, Warmuth, Manfred K.
Source: Journal of Machine Learning Research. 4/1/2005, Vol. 6 Issue 4, p427-451. 25p. 6 Charts.
Subjects: Mathematical models of learning, Stochastic learning models, Sequential analysis, Decision logic tables, Algorithms
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. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Machine Learning Research is the property of Microtome Publishing and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
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. [ABSTRACT FROM AUTHOR]
ISSN:15324435