Abstract
Zaki et al. designed a mining algorithm based on the IT-tree structure, which traverses an IT-tree in depth-first order, generates itemsets by using the concept of equivalence classes, and rapidly computes the support of itemsets using tidset intersections. However, the transactions need to be processed batch-wise. In real-world applications, transactions are commonly changed. In this paper, we propose an algorithm for the management of the deleted transactions based on the IT-tree structure and pre-large concepts. Experimental results show that the proposed algorithm has a good 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
Agrawal, R., Srikant, R.: Fast algorithm for mining association rules. In: The International Conference on Very Large Data Bases, pp. 487–499 (1994)
Cheung, D.W., Han, J., Ng, V.T., Wong, C.Y.: Maintenance of discovered association rules in large databases: An incremental updating approach. In: The Twelfth IEEE International Conference on Data Engineering, pp. 106–114 (1996)
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 (2000)
Hong, T.P., Wang, C.Y., Tao, Y.H.: A new incremental data mining algorithm using pre-large itemsets. Intelligent Data Analysis 5(2), 111–129 (2001)
Hong, T.P., Lin, C.W., Wu, Y.L.: Incrementally fast updated frequent pattern trees. Expert Systems with Applications 34(4), 2424–2435 (2008)
Koh, J.-L., Shieh, S.-F.: An Efficient Approach for Maintaining Association Rules Based on Adjusting FP-Tree Structures1. In: Lee, Y., Li, J., Whang, K.-Y., Lee, D. (eds.) DASFAA 2004. LNCS, vol. 2973, pp. 417–424. Springer, Heidelberg (2004)
Lin, C.W., Hong, T.P., Lu, W.H.: The Pre-FUFP algorithm for incremental mining. Expert Systems with Applications 36(5), 9498–9505 (2009)
Lin, C.W., Hong, T.P., Lu, W.H.: Maintenance of the prelarge trees for record deletion. In: The Twelfth WSEAS International Conference on Applied Mathematics, pp. 105–110 (2007)
Le, T.P., Vo, B., Hong, T.P., Le, B.: Incremental mining frequent itemsets based on the trie structure and the prelarge itemsets. In: The 2011 IEEE International Conference on Granular Computing, pp. 369–373 (2011)
Le, T.P., Hong, T.P., Vo, B., Le, B.: An efficient incremental mining approach based on IT-tree. In: The 2012 IEEE International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future, pp. 57–61 (2012)
Li, X., Deng, Z.-H., Tang, S.: A Fast Algorithm for Maintenance of Association Rules in Incremental Databases. In: Li, X., Zaïane, O.R., Li, Z. (eds.) ADMA 2006. LNCS (LNAI), vol. 4093, pp. 56–63. Springer, Heidelberg (2006)
Vo, B., Hong, T.P., Le, B.: DBV-Miner: A Dynamic Bit-Vector approach for fast mining frequent closed itemsets. Expert Systems with Applications 39(8), 7196–7206 (2012)
Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: New algorithms for fast discovery of association rules. In: The Third International Conference on Knowledge Discovery and Data Mining, pp. 283–286 (1997)
Zaki, M.J., Hsiao, C.J.: Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Transactions on Knowledge and Data Engineering 17(4), 462–478 (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Le, TP., Vo, B., Hong, TP., Le, B., Jung, J.J. (2013). Maintenance of IT-Tree for Transactions Deletion. In: Nguyen, N., Trawiński, B., Katarzyniak, R., Jo, GS. (eds) Advanced Methods for Computational Collective Intelligence. Studies in Computational Intelligence, vol 457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34300-1_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-34300-1_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34299-8
Online ISBN: 978-3-642-34300-1
eBook Packages: EngineeringEngineering (R0)