Abstract
Associative classification is a well-known data classification technique. With the increasing amounts of data, maintenance of classification accuracy becomes increasingly difficult. Updating the class association rules requires large amounts of processing time, and the prediction accuracy is often not increased that much. This paper proposes an Incremental Associative Classification Framework (IACF) for determining when an associative classifier needs to be updated based on new training data. IACF uses the rule Order Difference (OD) criterion to decide whether to update the class association rules. The idea is to see how much the rank order of the associative classification rules change (based on either support or confidence) and if the change is above a predetermined threshold, then the association rules are updated. Experimental results show that IACF yields better accuracy and less computational time compared to frameworks with class association rule update and without class association rule update, for both balanced and imbalanced datasets.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chang, H.L., Cheng, R.L., Ming, S.C.: Sliding-Window Filtering: An Efficient Algorithm for Incremental Mining. In: Proc. of the ACM 10th International Conference on Information and Knowledge Management (CIKM 2001), November 5-10, 2001, pp. 263–270 (2001)
David, W.C., Han, J., Ng, V., Wong, C.Y.: Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Techniques. In: Proc.12th IEEE International Conference on Data Engineering (ICDE 1996), New Orleans, Louisiana, U.S.A (March 1996)
David, W.C., Sau, D.L., Benjamin, K.: A general incremental technique for maintaining discovered association rules. In: Proceedings of the 5 th Intl. Conf. on Database Systems for Advanced Applications (DASFAA 1997), Melbourne, Australia (April 1997)
Geng, L., Hamilton, H.J.: Interestingness Measures for Data Mining: A Survey. ACM Computing Surveys 38(3), Article 9 (September 2006)
Lenca, P., Meyer, P., Vaillant, B., Lallich, S.: On selecting interestingness measures for association rules: user oriented description and multiple criteria decision aid. European Journal of Operational Research 184(2), 610–626 (2008)
Liu, B., Hsu, W., Ma, Y.: Integrating classification and association rule mining. In: Proceedings of the International Conference on Knowledge Discovery and Data Mining, pp. 80–86. AAAI Press, New York (1998)
Liu, B., Ma, Y., Wong, C.K.: Improving an association rule based classifier. In: Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery, Lyon, France, pp. 504–509 (2000)
Li, W., Han, J., Pei, J.: CMAR: Accurate and efficient classification based on multiple-class association rule. In: Proceedings of the International Conference on Data Mining (ICDM 2001), San Jose, CA, pp. 369–376 (2001)
LUCS-KDD DN Example Notes, http://www.csc.liv.ac.uk/frans/KDD/Software/LUCS-KDD-DN/exmpleDNnotes.html
LUCS-KDD implementation of CBA, http://www.csc.liv.ac.uk/frans/KDD/Software/CBA/cba.html
Merz, C., Murphy, P.: UCI repository of machine learning databases. Department of Information and Computer Science. University of California, Irvine (1996)
Necip, F.A., Abdullah, U.T., Erol, A.: An Efficient Algorithm to Update Large Itemsets with Early Pruning. In: ACM SIGKDD Intl. Conf. on Knowledge Discovery in Data and Data Mining (SIGKDD 1999), San Diego, California (August 1999)
Shiby, T., Sreenath, B., Khaled, A., Sanjay, R.: An Efficient Algorithm for the Incremental Updation of Association Rules in Large Databases. In: Proceedings of the 3rd International conference on Knowledge Discovery and Data Mining (KDD 1997), New Port Beach, California (August 1997)
Susan, P.I., Abdullah, U.T., Eric, P.: An Efficient Method For Finding Emerging Large Itemsets. In: The Third Workshop on Mining Temporal and Sequential Data, ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (August 2004)
Thabtah, F.: A review of associative classification mining. In: The Knowledge Engineering Review, vol. 22(1), pp. 37–65. Cambridge University Press, Cambridge (2007)
Thabtah, F.: Challenges and Interesting Research Directions in Associative Classification. In: Sixth IEEE International Conference on Data Mining Workshops, ICDM Workshops 2006, December 2006, pp. 785–792 (2006)
Thabtah, F., Cowling, P., Peng, Y.: MMAC: A new multi-class, multi-label associative classification approach. In: Proceedings of the 4th IEEE International Conference on Data Mining (ICDM 2004), Brighton, UK, pp. 217–224 (2004)
Thabtah, F., Cowling, P., Peng, Y.: MCAR: Multi-class classification based on association rule approach. In: Proceeding of the 3rd IEEE International Conference on Computer Systems and Applications, Cairo, Egypt, pp. 1–7 (2005)
Yin, X., Han, J.: CPAR: Classification based on predictive association rule. In: Proceedings of the SIAM International Conference on Data Mining, pp. 369–376. SIAM Press, San Francisco (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kongubol, K., Rakthanmanon, T., Waiyamai, K. (2010). Using Rule Order Difference Criterion to Decide Whether to Update Class Association Rules. In: Nguyen, N.T., Katarzyniak, R., Chen, SM. (eds) Advances in Intelligent Information and Database Systems. Studies in Computational Intelligence, vol 283. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12090-9_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-12090-9_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12089-3
Online ISBN: 978-3-642-12090-9
eBook Packages: EngineeringEngineering (R0)