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 addition to record insertion, record deletion is also commonly seen in real applications. In this chapter, we propose the structure of pre-large trees for efficiently handling deletion of records based on the concept of pre-large itemsets. Due to the properties of pre-large concepts, the proposed approach does not need to rescan the original database until a number of records have been deleted. The proposed approach can thus achieve a good execution time for tree construction especially when a small number of records are deleted each time. Experimental results also show that the proposed approach 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
References
Agrawal R, Imielinksi T, Swami A (1993) Mining association rules between sets of items in large database. The ACM SIGMOD Conference, pp 207–216
Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. The ACM SIGMOD International Conference on Management of Data, pp 1–12
Cheung DW, Han J, Ng VT, Wong CY (1996) Maintenance of discovered association rules in large databases: An incremental updating approach. The Twelfth IEEE International Conference on Data Engineering, pp 106–114
Hong TP, Wang CY, Tao YH (2001) A new incremental data mining algorithm using pre-large itemsets. Intelligent Data Analysis 5(2):111–129
Hong TP, Lin CW, Wu YL (2008) Incrementally fast updated frequent pattern trees. Expert Systems with Applications 34(4):2424–2435
Zheng Z, Kohavi R, Mason L (2001) Real world performance of association rule algorithms. The International Conference on Knowledge Discovery and ‘Data Mining, pp 401– 406
Mannila H, Toivonen H, Verkamo AI (1994) Efficient algorithm for discovering association rules. The AAAI Workshop on Knowledge Discovery in Databases, pp 181–192
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer Science+Business Media LLC
About this chapter
Cite this chapter
Lin, CW., Hong, TP., Lu, WH. (2009). Maintenance of the pre-large trees for record deletion. In: Mastorakis, N., Sakellaris, J. (eds) Advances in Numerical Methods. Lecture Notes in Electrical Engineering, vol 11. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-76483-2_12
Download citation
DOI: https://doi.org/10.1007/978-0-387-76483-2_12
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-76482-5
Online ISBN: 978-0-387-76483-2
eBook Packages: EngineeringEngineering (R0)