Abstract
The frequent pattern tree (FP-tree) is an efficient data structure for association-rule mining without generation of candidate itemsets. It, however, needed to process all transactions in a batch way. In the past, we proposed the Fast Updated FP-tree (FUFP-tree) structure to efficiently handle the newly inserted transactions in incremental mining. In this paper, we attempt to modify the FUFP-tree maintenance based on the concept of pre-large itemsets for efficiently handling deletion of records. Pre-large itemsets are defined by a lower support threshold and an upper support threshold. The proposed approach can thus achieve a good execution time for tree maintenance especially when each time a small number of records are deleted. Experimental results also show that the proposed Pre-FUFP deletion algorithm has a good performance for incrementally handling deleted records.
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
Agrawal, R., Imielinksi, T., Swami, A.: Mining association rules between sets of items in large database. In: The ACM SIGMOD Conference, pp. 207–216. ACM Press, New York (1993)
Agrawal, R., Srikant, R.: Fast algorithm for mining association rules. In: The International Conference on Very Large Data Bases, pp. 487–499 (1994)
Agrawal, R., Srikant, R., Vu, Q.: Mining association rules with item constraints. In: The Third International Conference on Knowledge Discovery in Databases and Data Mining, pp. 67–73 (1997)
Ezeife, C.I.: Mining Incremental association rules with generalized FP-tree. In: Proceedings of the 15th Conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence, pp. 147–160 (2002)
Fukuda, T., Morimoto, Y., Morishita, S., Tokuyama, T.: Mining optimized association rules for numeric attributes. In: The ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 182–191. ACM Press, New York (1996)
Han, J., Fu, Y.: Discovery of multiple-level association rules from large database. In: The Twenty-first International Conference on Very Large Data Bases, pp. 420–431 (1995)
Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: The 2000 ACM SIGMOD International Conference on Management of Data, pp. 1–12. ACM Press, New York (2000)
Hong, T.P., Wang, C.Y.: Maintenance of association rules using pre-large itemsets. In: Ma, Z. (ed.) Intelligent Databases: Technologies and Applications, pp. 44–60. Idea Group Inc (2006)
Hong, T.P., Lin, J.W., Wu, Y.L.: A fast updated frequent pattern tree. In: The 2006 IEEE International Conference on Systems, Man, and Cybernetics, pp. 2167–2172. IEEE Computer Society Press, Los Alamitos (2006)
Koh, J.L., Shieh, S.F.: An efficient approach for maintaining association rules based on adjusting FP-tree structures. In: The Ninth International Conference on Database Systems for Advanced Applications, pp. 417–424 (2004)
Mannila, H., Toivonen, H., Verkamo, A.I.: Efficient algorithm for discovering association rules. In: The AAAI Workshop on Knowledge Discovery in Databases, pp. 181–192 (1994)
Park, J.S., Chen, M.S., Yu, P.S.: Using a hash-based method with transaction trimming for mining association rules. IEEE Transactions on Knowledge and Data Engineering, 812–825 (1997)
Qiu, Y., Lan, Y.J., Xie, Q.S.: An improved algorithm of mining from FP- tree. In: Proceedings of the Third International Conference on Machine Learning and Cybernetics, pp. 26–29 (2004)
Srikant, R., Agrawal, R.: Mining generalized association rules. In: The Twenty-first International Conference on Very Large Data Bases, pp. 407–419 (1995)
Srikant, R., Agrawal, R.: Mining quantitative association rules in large relational tables. In: The 1996 ACM SIGMOD International Conference on Management of Data, pp. 1–12. ACM Press, New York (1996)
Agrawal, R., Imielinksi, T., Swami, A.: Mining association rules between sets of items in large database. In: The ACM SIGMOD Conference, pp. 207–216. ACM Press, New York (1993)
Zheng, Z., Kohavi, R., Mason, L.: Real world performance of association rule algorithms. In: The International Conference on Knowledge Discovery and Data Mining, pp. 401–406 (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Lin, CW., Hong, TP., Lu, WH., Wu, CH. (2007). Maintenance of Fast Updated Frequent Trees for Record Deletion Based on Prelarge Concepts. In: Okuno, H.G., Ali, M. (eds) New Trends in Applied Artificial Intelligence. IEA/AIE 2007. Lecture Notes in Computer Science(), vol 4570. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73325-6_67
Download citation
DOI: https://doi.org/10.1007/978-3-540-73325-6_67
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73322-5
Online ISBN: 978-3-540-73325-6
eBook Packages: Computer ScienceComputer Science (R0)