An experiment with association rules and classification: Post-bagging and conviction

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

Abstract

In this paper we study a new technique we call post-bagging, which consists in resampling parts of a classification model rather then the data. We do this with a particular kind of model: large sets of classification association rules, and in combination with ordinary best rule and weighted voting approaches. We empirically evaluate the effects of the technique in terms of classification accuracy. We also discuss the predictive power of different metrics used for association rule mining, such as confidence, lift, conviction and Χ2. We conclude that, for the described experimental conditions, post-bagging improves classification results and that the best metric is conviction. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Jorge, A. M., & Azevedo, P. J. (2005). An experiment with association rules and classification: Post-bagging and conviction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3735 LNAI, pp. 137–149). https://doi.org/10.1007/11563983_13

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