Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Resolving Rule Conflicts with Double Induction
Stockholm University, Faculty of Social Sciences, Department of Computer and Systems Sciences.
2004 In: Intelligent Data Analysis - An International Journal, Vol. 8, no 5, 457-468 p.Article in journal (Refereed) Published
Place, publisher, year, edition, pages
2004. Vol. 8, no 5, 457-468 p.
Identifiers
URN: urn:nbn:se:su:diva-25758OAI: oai:DiVA.org:su-25758DiVA: diva2:200462
Note
Part of urn:nbn:se:su:diva-855Available from: 2006-02-16 Created: 2006-02-16Bibliographically approved
In thesis
1. Methods of solving conflicts among induced rules
Open this publication in new window or tab >>Methods of solving conflicts among induced rules
2006 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

When applying an unordered set of classification rules to classify an example, there may be several applicable rules with conflicting conclusions regarding the most probable class to which the example belongs. This problem of having rules assigning different classes to the same example must be addressed, if a classification is to be made. The standard methods of resolving such conflicts include using the most frequent class in the examples covered by the conflicting rules and using naive Bayes to calculate the most probable class.

This thesis presents four papers, in each of which the problem of conflicting rules is addressed. In the first paper, a method that bridges the gap between Bayes rule and naive Bayes is presented. The second paper presents a data driven method for resolving rule conflicts, and the third paper explores this data driven approach further. In the last paper, a method for resolving rule conflicts in domains where the examples have numerical features is presented.

For all new methods of solving rule conflicts, it is shown that the novel methods outperform the standard methods. A correlation between the novel methods performance and their computational cost is found: usually the more costly methods obtain a higher accuracy than the less costly methods.

Place, publisher, year, edition, pages
Kista: Institutionen för data- och systemvetenskap (tills m KTH), 2006. 93 p.
Series
Report Series / Department of Computer & Systems Sciences, ISSN 1101-8526 ; 06-005
Keyword
machine learning, rule conflicts
National Category
Information Science
Identifiers
urn:nbn:se:su:diva-855 (URN)91-7155-209-X (ISBN)
Public defence
2006-03-10, sal A, Forum, Isafjordsgatan 39, Kista, 13:00
Opponent
Supervisors
Available from: 2006-02-16 Created: 2006-02-16Bibliographically approved

Open Access in DiVA

No full text

By organisation
Department of Computer and Systems Sciences

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 21 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf