Frequent pattern mining on stream data using Hadoop CanTree-GTree

Please use this identifier to cite or link to this item: https://idr.l2.nitk.ac.in/jspui/handle/123456789/8104

Full metadata record

DC Field	Value	Language
dc.contributor.author	Kusumakumari, V.
dc.contributor.author	Sherigar, D.
dc.contributor.author	Chandran, R.
dc.contributor.author	Patil, N.
dc.date.accessioned	2020-03-30T10:18:05Z	-
dc.date.available	2020-03-30T10:18:05Z	-
dc.date.issued	2017
dc.identifier.citation	Procedia Computer Science, 2017, Vol.115, , pp.266-273	en_US
dc.identifier.uri	http://idr.nitk.ac.in/jspui/handle/123456789/8104	-
dc.description.abstract	The need for knowledge discovery from real-time stream data is continuously increasing nowadays and processing of transactions for mining patterns needs efficient data structures and algorithms. We propose a time-efficient Hadoop CanTree-GTree algorithm, using Apache Hadoop. This algorithm mines the complete frequent item sets (patterns) from real time transactions, by utilizing the sliding window technique. These are used to mine for closed frequent item sets and then, association rules are derived. It makes use of two data structures - CanTree and GTree. The results show that the Hadoop implementation of the algorithm performs 5 times better than in Java. � 2017 The Author(s).	en_US
dc.title	Frequent pattern mining on stream data using Hadoop CanTree-GTree	en_US
dc.type	Book chapter	en_US
Appears in Collections:	2. Conference Papers

Files in This Item:

There are no files associated with this item.