Abstract
With the advent of technology the past few years have seen the rise in the field of data mining. Data mining generally considered as the process of extracting the useful information by finding the hidden and the non-trivial information out of large chunks of dataset. Now here comes the role of association rule mining which forms a crucial component of data mining. Many recent applications like market basket analysis, text mining etc. are done using this approach. In this paper we have discussed the novel approach to implement the FP Growth method using the trie data structure. Tries provide a special feature of merging the shared sets of data with the number of occurrences that were already registered as count. So this paper widely gives an idea about how the interesting patterns are generated from the large databases using association rule mining methodologies.
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
References
Agarwal, R., Srikant, R.: Mining sequential patterns. In: ICDE 1995, Taipei, Taiwan, pp. 3–14, March 1995
Taktak, W., Slimani, Y.: MS-FP-Growth: a multi-support version of FP-Growth agorithm. Int. J. Hybrid Inf. Technol. 7(3), 155–166 (2014)
Hipp, J., Güntzer, U., Nakhaeizadeh, G.: Algorithms for Association Rule Mining-A General Survey and Comparison. University of Tubingen, Tubingen (2000)
Borgelt, C.: An implementation of the FP-Growth algorithm. In: Proceedings of the 1st International Workshop on Open Source Data Mining: Frequent Pattern Mining Implementations, pp. 1–5. ACM (2005)
Kumar, B.S., Rukmani, K.V.: Implementation of web usage mining using APRIORI and FP growth algorithms. Int. J. Adv. Netw. Appl. 1(6), 400–404 (2010)
Rácz, B.: nonordfp: an FP-Growth variation without rebuilding the FP-Tree. In: 2nd International Workshop on Frequent Itemset Mining Implementations, FIMI (2004)
Li, H., Wang, Y., Zhang, D., Zhang, M., Chang, E.Y.: Pfp: parallel FP-Growth for query recommendation In: Proceedings of the ACM Conference on Recommender Systems, pp. 107–114. ACM (2008)
Han, J., Pei, J.: Mining frequent patterns by pattern-growth: methodology and implications. ACM SIGKDD Explor. Newsl. 2(2), 14–20 (2000)
Tjioe, H.C., Taniar, D.: A framework for mining association rules in data warehouses. In: Yang, Z.R., Yin, H., Everson, R.M. (eds.) IDEAL 2004. LNCS, vol. 3177, pp. 159–165. Springer, Heidelberg (2004). doi:10.1007/978-3-540-28651-6_23
Becuzzi, P., Coppola, M., Vanneschi, M.: Mining of association rules in very large databases: a structured parallel approach. In: Amestoy, P., Berger, P., Daydé, M., Ruiz, D., Duff, I., Frayssé, V., Giraud, L. (eds.) Euro-Par 1999. LNCS, vol. 1685, pp. 1441–1450. Springer, Heidelberg (1999). doi:10.1007/3-540-48311-X_204
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Goel, M., Goel, K. (2017). FP-Growth Implementation Using Tries for Association Rule Mining. In: Deep, K., et al. Proceedings of Sixth International Conference on Soft Computing for Problem Solving. Advances in Intelligent Systems and Computing, vol 547. Springer, Singapore. https://doi.org/10.1007/978-981-10-3325-4_3
Download citation
DOI: https://doi.org/10.1007/978-981-10-3325-4_3
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-3324-7
Online ISBN: 978-981-10-3325-4
eBook Packages: EngineeringEngineering (R0)