M. Viswanathan, and G. Webb. Lecture Notes in Computer Science 1398: Proceedings of the Tenth European Conference on Machine Learning (ECML'98), page 149-159. Berlin/Heidelberg, Springer, (1998)
Abstract
The covering algorithm has been ubiquitous in the induction of classification rules. This approach to machine learning uses heuristic search that seeks to find a minimum number of rules that adequately explains the data. However, recent research has provided evidence that learning redundant classifiers can increase predictive accuracy. Learning all possible classifiers seems to be a plausible form of this nomination of redundant classifiers. This paper presents an algorithm that in effect learns all classifiers. Preliminary investigations by Webb (1996b) suggest that a heuristic covering algorithm in general learns classification rules with higher predictive accuracy than those learned by this new approach. In this paper we present an extensive empirical comparison between the learning-all-rules algorithm and three varied established approaches to inductive learning, namely a covering algorithm, an instance-based learner and a decision tree learner. Empirical evaluation provides strong evidence in support of learning-all-rules as a plausible approach to inductive learning.
%0 Conference Paper
%1 ViswanathanWebb98
%A Viswanathan, M.
%A Webb, G.I.
%B Lecture Notes in Computer Science 1398: Proceedings of the Tenth European Conference on Machine Learning (ECML'98)
%C Berlin/Heidelberg
%D 1998
%E Nedellec, C.
%E Rouveiro, C.
%I Springer
%K Lazy Learning Learning, Rule
%P 149-159
%T Classification Learning Using All Rules
%X The covering algorithm has been ubiquitous in the induction of classification rules. This approach to machine learning uses heuristic search that seeks to find a minimum number of rules that adequately explains the data. However, recent research has provided evidence that learning redundant classifiers can increase predictive accuracy. Learning all possible classifiers seems to be a plausible form of this nomination of redundant classifiers. This paper presents an algorithm that in effect learns all classifiers. Preliminary investigations by Webb (1996b) suggest that a heuristic covering algorithm in general learns classification rules with higher predictive accuracy than those learned by this new approach. In this paper we present an extensive empirical comparison between the learning-all-rules algorithm and three varied established approaches to inductive learning, namely a covering algorithm, an instance-based learner and a decision tree learner. Empirical evaluation provides strong evidence in support of learning-all-rules as a plausible approach to inductive learning.
@inproceedings{ViswanathanWebb98,
abstract = {The covering algorithm has been ubiquitous in the induction of classification rules. This approach to machine learning uses heuristic search that seeks to find a minimum number of rules that adequately explains the data. However, recent research has provided evidence that learning redundant classifiers can increase predictive accuracy. Learning all possible classifiers seems to be a plausible form of this nomination of redundant classifiers. This paper presents an algorithm that in effect learns all classifiers. Preliminary investigations by Webb (1996b) suggest that a heuristic covering algorithm in general learns classification rules with higher predictive accuracy than those learned by this new approach. In this paper we present an extensive empirical comparison between the learning-all-rules algorithm and three varied established approaches to inductive learning, namely a covering algorithm, an instance-based learner and a decision tree learner. Empirical evaluation provides strong evidence in support of learning-all-rules as a plausible approach to inductive learning.},
added-at = {2016-03-20T05:42:04.000+0100},
address = {Berlin/Heidelberg},
audit-trail = {Springerlink not up for this volume yet.},
author = {Viswanathan, M. and Webb, G.I.},
biburl = {https://www.bibsonomy.org/bibtex/2bd1ba414ebf784227d497985097fa057/giwebb},
booktitle = {Lecture Notes in Computer Science 1398: Proceedings of the Tenth European Conference on Machine Learning (ECML'98)},
editor = {Nedellec, C. and Rouveiro, C.},
interhash = {3d574b556304a8ffd74bcefc4d88fb3b},
intrahash = {bd1ba414ebf784227d497985097fa057},
keywords = {Lazy Learning Learning, Rule},
location = {Chemnitz, Germany},
pages = {149-159},
publisher = {Springer},
timestamp = {2016-03-20T05:42:04.000+0100},
title = {Classification Learning Using All Rules},
year = 1998
}