Abstract
Single pass construction process of the CanTree for deriving association rules has been attracting researchers for data mining and incremental data mining to accommodate growth of transactional logs. This paper proposes five step mechanism for building a CanTree in HPC. The Pima Indian Diabetes Data Set considered for demonstrating a proposed mechanism and its performance.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Zhang, S., Wu, X., Zhang, C.: Multi-Database Mining. IEEE Computational Intelligence Bulletin 2(1), 5–13 (2003)
Cheung, D.W., Han, J., Ng, V.T., Wong, C.Y.: Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique. In: Proc. the International Conference on Data Engineering, pp. 106–114 (1996)
Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers (2001)
Thomas, S., et al.: An Efficient Algorithm for the Incremental Updation of Association Rules in Large Databases. In: Knowledge Discovery and Data Mining (1997)
Thomas, S.: Architectures and optimizations for integrating Data Mining algorithms with Database Systems. In: CSE. University of Florida, Gainesville (1998)
Thomas, S., Chakravarthy, S.: Incremental Mining of Constrained Associations. In: Proc. of the 7th Intl. Conf. of High Performance Computing, HiPC (2000)
Cheung, D.W., Lee, S.D., Kao, B.: A general Incremental Technique for Mining Discovered Association Rules. In: Proc. International Conference on Database System for Advanced Applications, pp. 185–194 (1997)
Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules between sets of items in large databases. In: ACM SIGMOD International Conference on the Management of Data, Washington, D.C (1993)
Agrawal, R., Srikant, R.: Fast Algorithms for mining association rules. In: 20th Int’l Conference on Very Large Databases, VLDB (1994)
Savasere, A., Omiecinsky, E., Navathe, S.: An efficient algorithm for mining association rules in large databases. In: 21st Int’l Cong. on Very Large Databases (VLDB), Zurich, Switzerland (1995)
Chen, Y.: An Efficient Parallel Algorithm for Mining Association Rules in Large Databases. Georgia Institute of Technology, Atlanta (1998)
Shenoy, P., et al.: Turbo-charging Vertical Mining of Large Databases. In: ACM SIGMOD Int’l Conference on Management of Data, Dallas (2000)
Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: ACM SIGMOD Int’l Conference on Management of Data, Dallas (2000)
Tsai, P.S.M., Lee, C.C., Chen, A.L.P.: An Efficient Approach for Incremental Association Rule Mining, Technical Report (1998)
Masseglia, F., Poncelet, P., Teisseire, M.: Incremental mining of sequential patterns in large databases. Data Knowl. Eng. 46(1), 97–121 (2003)
Lee, C.-H., Lin, C.-R., Chen, M.-S.: Sliding-window filtering: An Efficient Algorithm for Incremental Mining. In: Proceedings of the Tenth CanTree International Conference on Information and Knowledge Management, Atlanta, Georgia, USA, pp. 263–270 (2001)
Li, H., Wang, Y., Zhang, D., Zhang, M., Chang, E.: Pfp: parallel fp-growth for query recommendation. In: Proceedings of the 2008 ACM Conference on Recommender Systems, pp. 107–114 (2008)
Sarawagi, S., Thomas, S., Agrawal, R.: Integrating Association Rule Mining with Relational Database System: Alternatives and Implications. In: ACM SIGMOD Int’l Conference on Management of Data, Seattle, Washington (1998)
Leung, C.K., Khan, Q.I., Li, Z., Hoque, T.: CanTree: A Canonical-Order Tree for Incremental Frequent-Pattern Mining. Knowledge and Information Systems 11(3), 287–311 (2007)
Tanbeer, S.K., Ahmed, C.F., Jeong, B.-S., Lee, Y.-K.: CP-Tree: A Tree Structure for Single-Pass Frequent Pattern Mining. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5012, pp. 1022–1027. Springer, Heidelberg (2008)
Mishra, P., Chakravarthy, S.: Evaluation of K-way Join and its variants for Association Rule Mining. Information and Technology Lab at The University of Texas at Arlington, TX (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
K., S.R., Raghavendra Rao, C. (2011). Distributed Methodology of CanTree Construction. In: Sombattheera, C., Agarwal, A., Udgata, S.K., Lavangnananda, K. (eds) Multi-disciplinary Trends in Artificial Intelligence. MIWAI 2011. Lecture Notes in Computer Science(), vol 7080. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25725-4_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-25725-4_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25724-7
Online ISBN: 978-3-642-25725-4
eBook Packages: Computer ScienceComputer Science (R0)