ML Anthology

Methods for Rule Conflict Resolution

Tony Lindgren
ECML-PKDD 2004 pp. 262-273
doi:10.1007/978-3-540-30115-8_26 /ecmlpkdd/2004/lindgren2004ecml-methods/

Abstract

When using unordered rule sets, conflicts can arise between the rules, i.e., two or more rules cover the same example but predict different classes. This paper gives a survey of methods used to solve this type of conflict and introduces a novel method called Recursive Induction. In total nine methods for resolving rule conflicts are scrutinised. The methods are explained in detail, compared and evaluated empirically on an number of domains. The results show that Recursive Induction outperforms all previously used methods.

PDF ECML-PKDD Semantic Scholar

Cite

Text

Lindgren. "Methods for Rule Conflict Resolution." European Conference on Machine Learning, 2004. doi:10.1007/978-3-540-30115-8_26

Markdown

[Lindgren. "Methods for Rule Conflict Resolution." European Conference on Machine Learning, 2004.](https://mlanthology.org/ecmlpkdd/2004/lindgren2004ecml-methods/) doi:10.1007/978-3-540-30115-8_26

BibTeX

@inproceedings{lindgren2004ecml-methods,
  title     = {{Methods for Rule Conflict Resolution}},
  author    = {Lindgren, Tony},
  booktitle = {European Conference on Machine Learning},
  year      = {2004},
  pages     = {262-273},
  doi       = {10.1007/978-3-540-30115-8_26},
  url       = {https://mlanthology.org/ecmlpkdd/2004/lindgren2004ecml-methods/}
}