Abstract
We propose a novel pattern tree called Pattern Count tree (PC-tree) which is a complete and compact representation of the database. We show that construction of this tree and then generation of all large itemsets requires a single database scan where as the current algorithms need at least two database scans. The completeness property of the PC-tree with respect to the database makes it amenable for mining association rules in the context of changing data and knowledge, which we call dynamic mining. Algorithms based on PC-tree are scalable because PC-tree is compact. We propose a partitioned distributed architecture and an efficient distributed association rule mining algorithm based on the PC-tree structure.
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 algorithms for mining association rules in large databases, Proc. of 20th Int’l conf. on VLDB, (1994), 487–499.
Savasere, A., Omiecinsky, E., Navathe, S. An efficient algorithm for mining association rules in large databases, Proc. of Int’l conf. on VLDB, (1995), 432–444.
Han, J., Pei, J., Yin, Y. Mining Frequent Patterns without Candidate Generation, Proc. of ACM-SIGMOD, (2000).
Mohammed, J. Zaki. Parallel and distributed association mining: A survey, IEEE Concurrency, special issue on Parallel Mechanisms for Data Mining, Vol.7, No.4, (1999), 14–25.
Thomas, S., Sreenath, B., Khaled, A., Sanjay, R. An efficient algorithm for the incremental updation of association rules in large databases, AAAI, (1997).
Ananthanarayana, V.S., Subramanian, D.K., Narasimha Murty, M. Scalable, distributed and dynamic mining of association rules using PC-trees, IISc-CSA, Technical Report, (2000).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ananthanarayana, V., Subramanian, D., Murty, M. (2000). Scalable, Distributed and Dynamic Mining of Association Rules. In: Valero, M., Prasanna, V.K., Vajapeyam, S. (eds) High Performance Computing — HiPC 2000. HiPC 2000. Lecture Notes in Computer Science, vol 1970. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44467-X_51
Download citation
DOI: https://doi.org/10.1007/3-540-44467-X_51
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41429-2
Online ISBN: 978-3-540-44467-1
eBook Packages: Springer Book Archive