Classification with Intersecting Rules
Abstract
Several rule induction schemes generate hypotheses in the form of unordered rule sets. One important problem that has to be addressed when classifying examples with such hypotheses is how to deal with overlapping rules that predict different classes. Previous approaches to this problem calculate class probabilities based on the union of examples covered by the overlapping rules (as in CN2) or assumes rule independence (using naive Bayes). It is demonstrated that a significant improvement in accuracy can be obtained if class probabilities are calculated based on the intersection of the overlapping rules, or in case of an empty intersection, based on as few intersecting regions as possible.
Cite
Text
Lindgren and Boström. "Classification with Intersecting Rules." International Conference on Algorithmic Learning Theory, 2002. doi:10.1007/3-540-36169-3_31Markdown
[Lindgren and Boström. "Classification with Intersecting Rules." International Conference on Algorithmic Learning Theory, 2002.](https://mlanthology.org/alt/2002/lindgren2002alt-classification/) doi:10.1007/3-540-36169-3_31BibTeX
@inproceedings{lindgren2002alt-classification,
title = {{Classification with Intersecting Rules}},
author = {Lindgren, Tony and Boström, Henrik},
booktitle = {International Conference on Algorithmic Learning Theory},
year = {2002},
pages = {395-402},
doi = {10.1007/3-540-36169-3_31},
url = {https://mlanthology.org/alt/2002/lindgren2002alt-classification/}
}