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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Liu, B., Hsu, W., Ma, Y.: Integrating classification and association rule mining. In: Proc. of the Int. Conf. on Knowledge Discovery and Data Mining (KDD 1998), New York, pp. 80–86 (1998-2008)
Wang, X.-z., Zhac, D.l.: Associative classification based on interestingness of rules. Computer Engineering and Applications 43(25), 168–171 (2007)
Li, W., Han, J., Pei, J.: CMAR: accurate and efficient classification based on multiple class- association rules. In: Proc. of 2001 IEEE Int. Conf. on Data Mining (ICDM 2001), San Jose, CA, pp. 369–376 (2001-2011)
Li, J.: On Optimal Rule Discovery. IEEE Transactions on knowledge and data engineering 18(4) (April 2006)
Han, J., Kamber, M.: Data Mining: Concepts and Techniques, pp. 181–184
Han, J., Kamber, M.: Data Mining: Concepts and Techniques, pp. 229–235
Han, J., Kamber, M.: Data Mining:Concepts and Techniques, p. 292
Zaki, M.J.: Mining Non-Redundant Association Rules. Data Mining and Knowledge Discovery 9, 223–248 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhao, M., Cheng, X., He, Q. (2009). An Algorithm of Mining Class Association Rules. In: Cai, Z., Li, Z., Kang, Z., Liu, Y. (eds) Advances in Computation and Intelligence. ISICA 2009. Lecture Notes in Computer Science, vol 5821. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04843-2_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-04843-2_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04842-5
Online ISBN: 978-3-642-04843-2
eBook Packages: Computer ScienceComputer Science (R0)