On pruning and tuning rules for associative classifiers

28Citations
Citations of this article
26Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The integration of supervised classification and association rules for building classification models is not new. One major advantage is that models are human readable and can be edited. However, it is common knowledge that association rule mining typically yields a sheer number of rules defeating the purpose of a human readable model. Pruning unnecessary rules without jeopardizing the classification accuracy is paramount but very challenging. In this paper we study strategies for classification rule pruning in the case of associative classifiers. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Zaïane, O. R., & Antonie, M. L. (2005). On pruning and tuning rules for associative classifiers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3683 LNAI, pp. 966–973). Springer Verlag. https://doi.org/10.1007/11553939_136

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free