IIIT Hyderabad Publications |
|||||||||
|
An Efficient Map-Reduce Framework to Mine Periodic Frequent PatternsAuthors: Anirudh Alampally,Uday Kiran Rage,P Krishna Reddy,Toyoda M,Kitsuregawa M Conference: 19th International Conference on Big Data Analytics and Knowledge Discovery (DaWaK 2017 2017) Location Lyon, France Date: 2017-08-28 Report no: IIIT/TR/2017/102 AbstractPeriodic Frequent patterns (PFPs) are an important class of regularities that exist in a transactional database. In the literature, pattern growth-based approaches to mine PFPs have be proposed by considering a single machine. In this paper, we propose a Map-Reduce framework to mine PFPs by considering multiple machines. We have proposed a parallel algorithm by including the step of distributing transactional identifiers among the machines. Further, the notion of partition summary has been proposed to reduce the amount of data shuffled among the machines. Experiments on Apache Spark’s distributed environment show that the proposed approach speeds up with the increase in number of machines and the notion of partition summary significantly reduces the amount of data shuffled among the machines. Full paper: pdf Centre for Data Engineering |
||||||||
Copyright © 2009 - IIIT Hyderabad. All Rights Reserved. |