An Algorithm of Mining Class Association Rules

Authors:
Man Zhao;Xiu Cheng;Qianzhou He
Affiliations:
State Key Laboratory of Software Engineering, Wuhan University, Wuhan, China 430072 and School of Computer, China University of Geosciences, Wuhan, China 430074;School of Computer, China University of Geosciences, Wuhan, China 430074;School of Forgein Languages, China University of Geosciences, Wuhan, China 430074
Venue:
ISICA '09 Proceedings of the 4th International Symposium on Advances in Computation and Intelligence
Year:
2009

Citing 3
Cited 1

CMAR: Accurate and Efficient Classification Based on Multiple Class-Association Rules

ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Mining Non-Redundant Association Rules

Data Mining and Knowledge Discovery
On Optimal Rule Discovery

IEEE Transactions on Knowledge and Data Engineering

Discovering relationship types between users using profiles and shared photos in a social network

Multimedia Tools and Applications

Quantified Score

Hi-index	0.00

Visualization

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.