%0 Conference Paper %1 Webb96c %A Webb, G. I. %B Proceedings of Information, Statistics and Induction in Science (ISIS '96) %C Singapore %D 1996 %I World Scientific %K Lazy Learning Learning, Rule %P 20-30 %T A Heuristic Covering Algorithm Outperforms Learning All Rules %X The induction of classification rules has been dominated by a single generic technique-the covering algorithm. This approach employs a simple hill-climbing search to learn sets of rules. Such search is subject to numerous widely known deficiencies. Further, there is a growing body of evidence that learning redundant sets of rules can improve predictive accuracy. The ultimate end-point of a move toward learning redundant rule sets would appear to be to learn and employ all possible rules. This paper presents a learning system that does this. An empirical investigation shows that, while the approach often achieves higher predictive accuracy than a covering algorithm, the covering algorithm outperforms induction of all rules significantly more frequently. Preliminary analysis suggests that learning all rules performs well when the training set clearly defines the decision surfaces but that the heuristic covering algorithm performs better when the decision surfaces are not clearly delineated by the training examples.

@inproceedings{Webb96c, abstract = {The induction of classification rules has been dominated by a single generic technique-the covering algorithm. This approach employs a simple hill-climbing search to learn sets of rules. Such search is subject to numerous widely known deficiencies. Further, there is a growing body of evidence that learning redundant sets of rules can improve predictive accuracy. The ultimate end-point of a move toward learning redundant rule sets would appear to be to learn and employ all possible rules. This paper presents a learning system that does this. An empirical investigation shows that, while the approach often achieves higher predictive accuracy than a covering algorithm, the covering algorithm outperforms induction of all rules significantly more frequently. Preliminary analysis suggests that learning all rules performs well when the training set clearly defines the decision surfaces but that the heuristic covering algorithm performs better when the decision surfaces are not clearly delineated by the training examples.}, added-at = {2016-03-20T05:42:04.000+0100}, address = {Singapore}, audit-trail = {*}, author = {Webb, G. I.}, biburl = {https://www.bibsonomy.org/bibtex/2b7771d33cfe370c7500619aa77c301fb/giwebb}, booktitle = {Proceedings of Information, Statistics and Induction in Science (ISIS '96)}, interhash = {a53f18b41aa7c7eb38831fe3d50aba7e}, intrahash = {b7771d33cfe370c7500619aa77c301fb}, keywords = {Lazy Learning Learning, Rule}, location = {Melbourne, Australia}, pages = {20-30}, publisher = {World Scientific}, timestamp = {2016-03-20T05:42:04.000+0100}, title = {A Heuristic Covering Algorithm Outperforms Learning All Rules}, year = 1996 }