FP-growth implementation using tries for association rule mining

0Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Goel, M., & Goel, K. (2017). FP-growth implementation using tries for association rule mining. In Advances in Intelligent Systems and Computing (Vol. 547, pp. 21–29). Springer Verlag. https://doi.org/10.1007/978-981-10-3325-4_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free