Argument based generalization of MODLEM rule induction algorithm

Authors:
Krystyna Napierała;Jerzy Stefanowski
Affiliations:
Institute of Computing Science, Poznań University of Technology, Poznań, Poland;Institute of Computing Science, Poznań University of Technology, Poznań, Poland
Venue:
RSCTC'10 Proceedings of the 7th international conference on Rough sets and current trends in computing
Year:
2010

Citing 5
Cited 0

Separate-and-Conquer Rule Learning

Artificial Intelligence Review
Domain knowledge to support the discovery process: previously discovered knowledge

Handbook of data mining and knowledge discovery
Argument based machine learning applied to law

Artificial Intelligence and Law - Argumentation in artificial intelligence and law
Argument based machine learning

Artificial Intelligence
On combined classifiers, rule induction and rough sets

Transactions on rough sets VI

Quantified Score

Hi-index	0.00

Visualization

Abstract

Argument based learning allows experts to express their domain, local knowledge about the circumstances of making classification decisions for some learning examples. In this paper we have incorporated this idea in rule induction as a generalization of the MODLEM algorithm. To adjust the algorithm to the redefined task, a new measure for evaluating rule conditions and a new classification strategy with rules had to be introduced. Experimental studies showed that using arguments improved classification accuracy and structure of rules. Moreover the proper argumentation improved recognition of the minority class in imbalanced data without essential decreasing recognition of the majority classes.