Resolving Rule Conflicts with Double Induction

作者: Tony Lindgren , Henrik Boström

DOI: 10.1007/978-3-540-45231-7_6

关键词:

摘要: When applying an unordered set of classification rules, the rules may assign more than one class to a particular example. Previous methods resolving such conflicts between include using most frequent examples covered by conflicting (as done in CN2) and naive Bayes calculate probable class. An alternative way solving this problem is presented paper: generating new from rules. These newly induced are then used for classification. Experiments on number domains show that method significantly outperforms both CN2 approach Bayes.

参考文章(18)
Martin Eineborg, Fuzzifying Hyperplanes in the Hypothesis Space Physica, Heidelberg. pp. 313- 322 ,(2002) , 10.1007/978-3-7908-1782-9_23
Robert Tibshirani, Trevor Hastie, Jerome H. Friedman, The Elements of Statistical Learning ,(2001)
Marc Schoenauer, Michèle Sebag, Incremental learning of rules and Meta-rules international conference on machine learning. pp. 49- 57 ,(1990) , 10.1016/B978-1-55860-141-3.50010-9
Martin Eineborg, Henrik Boström, Classifying Uncovered Examples by Rule Stretching inductive logic programming. pp. 41- 50 ,(2001) , 10.1007/3-540-44797-0_4
Ron Kohavi, Dan Sommerfield, Barry G. Becker, Improving simple Bayes ECML. ,(1997)
Tony Lindgren, Henrik Boström, Classification with Intersecting Rules algorithmic learning theory. pp. 395- 402 ,(2002) , 10.1007/3-540-36169-3_31
Johannes Fürnkranz, Separate-and-Conquer Rule Learning Artificial Intelligence Review. ,vol. 13, pp. 3- 54 ,(1999) , 10.1023/A:1006524209794
Peter Clark, Robin Boswell, Rule induction with CN2: Some recent improvements Lecture Notes in Computer Science. pp. 151- 163 ,(1991) , 10.1007/BFB0017011
Stephen Muggleton, Luc de Raedt, Inductive Logic Programming : Theory and Methods Journal of Logic Programming. ,vol. 19, pp. 629- 679 ,(1994) , 10.1016/0743-1066(94)90035-3
Henrik Boström, Peter Idestam-Almquist, Induction of logic programs by example-guided unfolding Journal of Logic Programming. ,vol. 40, pp. 159- 183 ,(1999) , 10.1016/S0743-1066(99)00017-5