%0 Conference Paper %1 TingZhengWebb99 %A Ting, K.M. %A Z. Zheng, & G. I. Webb %B Proceedings of the Nineteenth SGES International Conference on Knowledge Based Systems and Applied Artificial Intelligence (ES'99) %C New York %D 1999 %E Coenen, F. %E Macintosh, A. %I Springer %K Conditional Estimation Probability %P 122-131 %T Learning Lazy Rules to Improve the Performance of Classifiers %X Based on an earlier study on lazy Bayesian rule learning, this paper introduces a general lazy learning framework, called LAZYRULE, that begins to learn a rule only when classifying a test case. The objective of the framework is to improve the performance of a base learning algorithm. It has the potential to be used for different types of base learning algorithms. LAZYRULE performs attribute elimination and training case selection using cross-validation to generate the most appropriate rule for each test case. At the consequent of the rule, it applies the base learning algorithm on the selected training subset and the remaining attributes to construct a classifier to make a prediction. This combined action seeks to build a better performing classifier for each test case than the classifier trained using all attributes and all training cases. We show empirically that LAZYRULE improves the performances of naive Bayesian classifiers and majority vote.

@inproceedings{TingZhengWebb99, abstract = {Based on an earlier study on lazy Bayesian rule learning, this paper introduces a general lazy learning framework, called LAZYRULE, that begins to learn a rule only when classifying a test case. The objective of the framework is to improve the performance of a base learning algorithm. It has the potential to be used for different types of base learning algorithms. LAZYRULE performs attribute elimination and training case selection using cross-validation to generate the most appropriate rule for each test case. At the consequent of the rule, it applies the base learning algorithm on the selected training subset and the remaining attributes to construct a classifier to make a prediction. This combined action seeks to build a better performing classifier for each test case than the classifier trained using all attributes and all training cases. We show empirically that LAZYRULE improves the performances of naive Bayesian classifiers and majority vote.}, added-at = {2016-03-20T05:42:04.000+0100}, address = {New York}, audit-trail = {*}, author = {Ting, K.M. and Z. Zheng, \& G. I. Webb}, biburl = {https://www.bibsonomy.org/bibtex/229798d4cf3e84c1c65e00d266c22f79e/giwebb}, booktitle = {Proceedings of the Nineteenth SGES International Conference on Knowledge Based Systems and Applied Artificial Intelligence (ES'99)}, editor = {Coenen, F. and Macintosh, A.}, interhash = {41e36a712708072000e6dc8c0281dbcf}, intrahash = {29798d4cf3e84c1c65e00d266c22f79e}, keywords = {Conditional Estimation Probability}, location = {Peterhouse College, Cambridge, UK}, pages = {122-131}, publisher = {Springer}, timestamp = {2016-03-20T05:42:04.000+0100}, title = {Learning Lazy Rules to Improve the Performance of Classifiers}, year = 1999 }