An Experiment with Association Rules and Classification: Post-Bagging and Conviction

摘要

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.