When applying an unordered set of classification rules, the rules may assign more than one class to a particular example. Previous methods of resolving such conflicts between rules include using the most frequent class in the conflicting rules (as done in CN2) and using naïve Bayes to calculate the most probable class. An alternative way of solving this problem is presented in this paper: by generating new rules from the examples covered by the conflicting rules. These newly induced rules are then used for classification. Experiments on a number of domains show that this method significantly outperforms both the CN2 approach and naïve Bayes. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Lindgren, T., & Boström, H. (2003). Resolving rule conflicts with double induction. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2810, 60–67. https://doi.org/10.1007/978-3-540-45231-7_6
Mendeley helps you to discover research relevant for your work.