A Novelty Approach for Finding Frequent Itemsets in Horizontal and Vertical Layout- HVCFPMINETREE

Meenakshi, A.; Alagarsamy, K.

doi:10.5120/1478-1995

Cited by 1 publication

(1 citation statement)

References 18 publications

(5 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the digital field, the technology in computer hardware architecture has been revolutionized by expanding main memory and evolving processors from single-core to multi-core, many-core or even cloud systems (Grossman et al, 2008;Hu, 2012;Meenakshi et al, 2010;Suneetha et al, 2011;Zhou et al, 2010). Previously, the traditional sequential data mining algorithm (Fakhrahmad et al, 2011;Jin, 2009;Prakash et al, 2010;Yu et al, 2010;Yun et al, 2005) would take a tremendous amount of time in handling large datasets.…”

Section: Introductionmentioning

confidence: 99%

Apriori-based High Efficiency Load Balancing Parallel Data Mining Algorithms on Multi-core Architectures

Liu

Zhou

et al. 2015

International Journal of Grid and High Performance Computing

View full text Add to dashboard Cite

Frequent pattern mining has been playing an essential role in knowledge discovery and data mining tasks that try to find usable patterns from databases. Efficiency is especially crucial for an algorithm in order to find frequent itemsets from a large database. Numerous methods have been proposed to solve this problem, such as Apriori and FP-growth. These are regarded as fundamental frequent pattern mining methods. In addition, parallel computing architectures, such as an on-cloud platform, a grid system, multi-core and GPU platform, have been popular in data mining. However, most of the algorithms have been proposed without considering the prevalent multi-core architectures. In this study, multi-core architectures were used as well as two high efficiency load balancing parallel data mining methods based on the Apriori algorithm. The main goal of the proposed algorithms was to reduce the massive number of duplicate candidates generated using previous methods. This goal was achieved for, in this detailed experimental study the algorithms performed better than the previous methods. The experimental results demonstrated that the proposed algorithms had dramatically reduced computation time when using more threads. Moreover, the observations showed that the workload was equally balanced among the computing units.

show abstract