Summary
The FP-tree is an effective data structure that facilitates the mining of frequent patterns from transactional databases. But, transactional databases are dynamic in general, and hence modifications on the database must be reflecting onto the FP-tree. Constructing the FP-tree from scratch and incrementally updating the FP-tree are two possible choices. However, from scratch construction turns unfeasible as the database size increases. So, this chapter addresses incremental update by extending the FP-tree concepts and manipulation process. Our new approach is capable of handling all kinds of changes, include additions, deletions and modifications. The target is achieved by constructing and incrementally dealing with the complete FP-tree, i.e., with one as the minimum support threshold. Constructing the complete FP-tree has the other advantage that it provides the freedom of mining for lower minimum support values without the need to reconstruct the tree. However, directly reflecting the changes onto the FP-tree may invalidate the basic FP-tree structure. Thus, we apply a sequence of shuffling and merging operations to validate and maintain the modified tree. The experiments conducted on synthetic and real datasets clearly highlight advantages of the proposed incremental approach over constructing the FP-tree from scratch.
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
M. Adnan, R. Alhajj and K. Barker, Performance Analysis of Incremental Update of Association Rules Mining Approaches Proc. of IEEE International Conference on Intelligent Engineering Systems, Greece, Sept. 2005.
M. Adnan, R. Alhajj and K. Barker, Constructing complete FP-tree for incremental mining of frequent patterns in dynamic databases, Proc. of the International Conference on Industrial & Engineering Applications of Artificial Intelligence & Expert Systems, Springer LNCS, Annecy, France, June 2006.
R. Agrawal, T. Imielinski and A. Swami, Mining association rules between sets of items in large databases, Proc. of ACM-SIGMOD, pp. 207–216, Washington, DC, May 1993.
A. Amir, R. Feldman and R. Kashi, A new and versatile method for association generation, Information Systems, 22(6), 333–347, 1999.
T. Brijs, G. Swinnen, K. Vanhoof and G. Wets, The use of association rules for product assortment decisions: a case study, Proc. of ACM International Conference on Knowledge Discovery and Data Mining, pp. 254–260, San Diego, August 1999.
D. W. Cheung, J. Han, V. T. Ng and C. Y. Wong, Maintenance of discovered association rules in large databases: an incremental updating technique, Proc. of IEEE-ICDE, pp. 106–114 , 1996.
D. W. Cheung, V. T. Ng and B. W. Tam, Maintenance of discovered knowledge: a case in multi-level association rules, Proc. of ACM International Conference on Knowledge Discovery and Data Mining, pp. 307–310, 1996.
D. W. Cheung, S. D. Lee and B. Kao, A general incremental technique for mining discovered association rules, Proc. of the International Conference on Database System for Advanced Applications, pp. 185–194, 1997.
R. Feldman, Y. Aumann, A. Amir and H. Mannila, Efficient algorithms for discovering frequent sets in incremental databases, Proc. of the Workshop on Research Issues on Data Mining and Knowledge Discovery, 1997.
V. Ganti, J. E. Gehrke and R. Ramakrishnan, DEMON: mining and monitoring evolving data, IEEE Transactions on Knowledge and Data Engineering, 13(1), 50–63, 2001.
J. Han, J. Pei and Y. Yin, Mining frequent patterns without candidate generation, Proc. of ACM-SIGMOD, pp. 1–12, Dallas, TX, May 2000.
J.-L. Koh and S.-F. Shieh, An efficient approach for maintaining association rules based on adjusting FP-Tree structures, Proc. of DASFAA, Korea, March 2004.
C.-H. Lee and C.-R. Lin and M.-S. Chen, Sliding-window filtering: an efficient algorithm for incremental mining, Proc. of ACM International Conference on Information and Knowledge Management, pp. 263–270, New York, NY, 2001.
C. K.-S. Leung, Q. I. Khan and T. Hoque, CanTree: a tree structure for efficient incremental mining of frequent patterns, Proc. of IEEE International Conference on Data Mining, pp. 274–281, Los Alamitos, CA, 2005.
A. Mueller, Fast sequential and parallel algorithms for association rule mining: a comparison, University of Maryland Institute for Advanced Computer Studies Report, University of Maryland at College Park, College Park, MD, 1995.
S. Thomas, S. Bodagala, K. Alsabti and S. Ranka, An efficient algorithm for the incremental updation of association rules in large databases, Proc. of the International Conference on Knowledge Discovery in Databases, pp. 263–266, 1997.
A. Veloso, B. Possas, W. Meira Jr., M. B. de Carvalh, Knowledge management in association rule mining, Proc. of the International Workshop on Integrating Data Mining and Knowledge Management, 2001.
Z. Zhou and C. I. Ezeife, A Low-scan incremental association rule maintenance method based on the apriori property, Proc. of the Biennial Conference of the Canadian Society on Computational Studies of Intelligence, pp. 26–35, London, ON, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Muhaimenul, Alhajj, R., Barker, K. (2008). Alternative Method for Incrementally Constructing the FP-Tree. In: Chountas, P., Petrounias, I., Kacprzyk, J. (eds) Intelligent Techniques and Tools for Novel System Architectures. Studies in Computational Intelligence, vol 109. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77623-9_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-77623-9_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77621-5
Online ISBN: 978-3-540-77623-9
eBook Packages: EngineeringEngineering (R0)