.png){kind=icon}
Return
A parallel algorithm for mining constrained frequent patterns using MapReduce
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-015-1930-z.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Constrained frequent pattern refers to a frequent pattern generated using constrained conditions given by users and has characteristics of stronger pertinence, higher practicability and mining efficiency, etc. With the increasing of datasets, there are defects during the construction of the constrained frequent pattern tree, so that the constrained frequent pattern tree is difficult to apply to massive datasets. In this paper, a parallel mining algorithm of the constrained frequent pattern, called PACFP, is proposed using the MapReduce programming model. First, key steps in the algorithm, such as mapping transaction in datasets to frequent item support count, constructing the constrained frequent pattern tree, generating the constrained frequent pattern, and aggregating frequent patterns, are implemented by three pairs of Map and Reduce functions. Second, migration of data recording is achieved by applying a data grouping strategy based on frequent item support, and load balance is effectively solved while generating the constrained frequent pattern. In the end, experimental results validate availability, scalability, and expandability of the algorithm using celestial spectrum datasets.
Keywords:
Association rule
Constrained frequent pattern
MapReduce
Frequent item support
Load balance
Journal
IF:
2.5
Papers:
1.0W
Citations:
2.1W
Organization
Cited Papers
.png){kind=icon}
ShareSave
Gel properties as a hydrogel of crosslinked poly (l-ornithine) using organic crosslinking agents
PREAI
ShareSave
ShareSaveShareSaveShareSaveShareSave
View more