Abstract
Incremental updating of frequent item-sets on a database includes three problems. In this paper, these problems are explored when database stores massive data. The main contributions include: (a) introduces the concept of Interesting Support Threshold; (b) proposes Frequent Item-sets Tree (FITr) with compact structure; (c) proposes and implements algorithm FIIU for frequent item-sets incremental updating; (d) in order to further improve performance, proposes the algorithm DFIIU for distributed incremental updating of frequent Item-sets on massive database; (e) gives extensive experiments to show that FIIU and DFIIU algorithms have better performance than traditional algorithm on massive database when the number of items is less.
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., Imielinski, T., Swami, A.: Mining assciation rules between sets of items in large database. In: The ACM SIGMOD, Washington (1993)
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. the 20th International Conference on VLDB, Santago, pp. 487–499 (1994)
Park, J.S., et al.: An efficient hash-based algorithm for mining association rules. In: Proc. 1995 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD 1995), San Jose, CA (1995)
Savasere, A., et al.: An efficient algorithm for mining association rules in large databases. In: Proc. 1995 Int. Conf. Very Large Data Bases (VLDB 1995), Zurich, Switzerland (1995)
Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proc. 2000 ACMSIGMOD Int. Conf. Management of Data (SIGMOD 2000) (2000)
Cheung, W., Zaiane, O.R.: Incremental Mining of Frequent Patterns Without Candidate Generation or Support Constraint. In: Proc. IDEAS 2003, Hong Kong (2003)
Zhu, Y., Sun, Z., Ji, X.: Incremental Updating Algorithm Based on Frequent Pattern Tree fof Mining Association Rules. Chinease Journal of Computers 26(1), 91–96 (2003)
Ma, X.-L., Tong, Y.-H.: Efficient Incremental Maintence of Frequent Patterns with FP-Tree. J. Computer Science and Technology 19(6), 876–884 (2004)
Agrawal, R., Shafer, J.C.: Parallel mining of association rules. IEEE Transaction on Knowledge and Data Engineering 8(6), 962–969 (1996)
Han, E.H., Karypis, G., Kumar, V.: Scalable parallel data minig for association rules. In: Proc. ACM SIGMOD International Conference on Management of Data (SIGMOD 1997) (1997)
Zhang, Z.G.: Study of Data Mining Algorithms on Massive Data. Harbin Institute of Technology, Harbin (2003)
Brin, S., Motwani, R., Silverstein, C.: Generalizing association rules to correlations. In: Proc. of the ACM SIGMOD Int’l. Conf. on Management of Data (ACM SIGMOD 1997) (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Qiu, J. et al. (2006). An Efficient Algorithm for Distributed Incremental Updating of Frequent Item-Sets on Massive Database. In: Feng, L., Wang, G., Zeng, C., Huang, R. (eds) Web Information Systems – WISE 2006 Workshops. WISE 2006. Lecture Notes in Computer Science, vol 4256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11906070_6
Download citation
DOI: https://doi.org/10.1007/11906070_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-47663-4
Online ISBN: 978-3-540-47664-1
eBook Packages: Computer ScienceComputer Science (R0)