Resolving rule conflicts with double induction

Article type: Research Article

Authors: Lindgren, Tony | Boström, Henrik

Affiliations: Department of Computer and Systems Sciences, Stockholm University and Royal Institute of Technology, Forum 100, 164 40 Kista, Sweden. Tel.: +46 8 164099 (TL), +46 8 161616 (HB); Fax: +46 8 7039025; E-mail: tony@dsv.su.se, henke@dsv.su.se

Abstract: 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 of the examples covered by 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.

DOI: 10.3233/IDA-2004-8503

Journal: Intelligent Data Analysis, vol. 8, no. 5, pp. 457-468, 2004