Abstract
The proposed algorithm can efficiently deal with multilevel association rules mining of a dynamic database and a current support threshold can be different from the previous task. The experimental results show that the proposed algorithm has better performance than ML-T2 algorithm.
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
Similar content being viewed by others
References
Han, J., Fu, Y.: Discovery of multiple-level association rules from large databases. In Proceedings of the 21th International Conference on Very Large Data Bases (VLDB’95), pp. 420–431. Morgan Kaufmann, San Francisco (1995)
Yinbo, W., Yong, L., Liya, D.: Mining multilevel association rules from primitive frequent itemsets. In Journal of Macau University of Science and Technology, vol. 3. Macau University of Science and Technology, Macau, China (2009)
Mittar, V., Ruchika, Y., Deepika, S.: Mining frequent patterns with counting inference at multiple levels. In International Journal of Computer Applications, vol. 3 (2010)
Cheung, D.W., Ng, V.T., Tam, B.W.: Maintenance of discovered knowledge : a case in multi-level association rules. In Proceedings of the Thirteenth National Conference on Artificial Intelligence. AAAI Press, Oregon (1996)
Cheung, D.W., Han, J., Ng, V.T., Wong, C.Y.: Maintenance of discovered association rules in large databases: an incremental update technique. In Proceedings of The twelfth International Conference on Data Engineering, pp. 106–114. IEEE Press, Louisiana (1996)
Bachtobji, M.A., Gouider, M.S.: Incremental maintenance of association rules under support threshold change. In Proceedings of the IADIS International Conference on Applied Computing. IADIS Press, San Sebastian (2006)
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In Proceedings of the 20th International Conference on Very Large Data Bases (VLDB’94), pp. 487–499. Morgan Kaufmann, Santiago de Chile (1994)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pumjun, N., Kreesuradej, W. (2016). Incremental Multilevel Association Rule Mining of a Dynamic Database Under a Change of a Minimum Support Threshold. In: Park, J., Chao, HC., Arabnia, H., Yen, N. (eds) Advanced Multimedia and Ubiquitous Engineering. Lecture Notes in Electrical Engineering, vol 354. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47895-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-662-47895-0_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-47894-3
Online ISBN: 978-3-662-47895-0
eBook Packages: EngineeringEngineering (R0)