An algorithm of mining class association rules

Abstract

The relevance of traditional classification methods, such as CBA and CMAR, bring the problems of frequent scanning the database, resulting in excessive candidate sets, as well as the complex construction of FP-tree that causes excessive consumption. This paper studies the classification rules based on association rules - MCAR (Mining Class Association Rules). The database only needs scanning once, and the cross-support operation is used for the calculation as the format of databases is vertical layout for easily computing the support of the frequent items. Not only the minimum support and minimum confidence is used to prune the candidate set, but also the concept of class-frequent items is taken into account to delete the rules that may hinder the effective improvement of the algorithm performance. © Springer-Verlag 2009.