Change search
ReferencesLink to record
Permanent link

Direct link
Methods for rule conflict resolution
KTH, Superseded Departments, Computer and Systems Sciences, DSV.
2004 (English)In: MACHINE LEARNING: ECML 2004, PROCEEDINGS / [ed] Boulicaut, JF; Esposito, F; Giannoti, F; Pedreschi, D, BERLIN: SPRINGER , 2004, Vol. 3201, 262-273 p.Conference paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
BERLIN: SPRINGER , 2004. Vol. 3201, 262-273 p.
, LECTURE NOTES IN COMPUTER SCIENCE Volume: 3201, ISSN 0302-9743 ; 3201
National Category
Computer Science
URN: urn:nbn:se:kth:diva-43966ISI: 000223999500026ScopusID: 2-s2.0-22944481860ISBN: 3-540-23105-6OAI: diva2:450930
15th European Conference on Machine Learning/8th European Conference on Principles and Practice of Knowledge Discovery in Databases. Pisa, ITALY. SEP 20-24, 2004
QC 20111024Available from: 2011-10-24 Created: 2011-10-19 Last updated: 2011-11-01Bibliographically approved

Open Access in DiVA

No full text


Search in DiVA

By author/editor
Lindgren, Tony
By organisation
Computer and Systems Sciences, DSV
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 22 hits
ReferencesLink to record
Permanent link

Direct link