• Home
  • Search
  • Frequent Itemset Mining for Big Data Using Greatest Common Divisor Technique
  • Open Access IconOpen Access
  • Cite Icon10
  • https://doi.org/10.5334/dsj-2017-025Copy DOI Icon

Frequent Itemset Mining for Big Data Using Greatest Common Divisor Technique

Show More
  • Abstract
  • Highlights & Summary
  • PDF
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

The discovery of frequent itemsets is one of the very important topics in data mining. Frequent itemset discovery techniques help in generating qualitative knowledge which gives business insight and helps the decision makers. In the Big Data era the need for a customizable algorithm to work with big data sets in a reasonable time becomes a necessity. In this paper we propose a new algorithm for frequent itemset discovery that could work in distributed manner with big datasets. Our approach is based on the original Buddy Prima algorithm and the Greatest Common Divisor (GCD) calculation between itemsets which exist in the transaction database. The proposed algorithm introduces a new method to parallelize the frequent itemset mining without the need to generate candidate itemsets and also it avoids any communication overhead between the participated nodes. It explores the parallelism abilities in the hardware in case of single node operation. The proposed approach could be implemented using map-reduce technique or Spark. It was successfully applied on different size transactions DBs and compared with two well-known algorithms: FP-Growth and Parallel Apriori with different support levels. The experiments showed that the proposed algorithm achieves major time improvement over both algorithms especially with datasets having huge number of items.

Loading PDF

Similar Papers
  • Research Article

An Enhanced Approach to Mine Maximal Frequent Itemset using Maximal Frequent Itemset Prima Algorithm (MFIPA)

  • Mar 05, 2019
  • Asian Journal of Computer Science and Technology
  • R Smeeta Mary +1
  • Book Chapter
  • Citations12

GA-Apriori: Combining Apriori Heuristic and Genetic Algorithms for Solving the Frequent Itemsets Mining Problem

  • Jan 01, 2017
  • Youcef Djenouri +1
  • PDF
  • Research Article
  • Citations3

Legal Governance of Brain Data Derived from Artificial Intelligence

  • Jun 02, 2021
  • Voices in Bioethics
  • Mahika Ahluwalia
  • Book Chapter
  • Citations3

Granule Based Inter-transaction Association Rule Mining

  • Aug 01, 2008
  • Wanzhong Yang +2
  • Research Article
  • Citations2

Mining Frequent ItemSet Based on Clustering of Bit Vectors

  • Nov 30, 2016
  • Indian Journal of Science and Technology
  • R Velmurugan +2
  • Book Chapter
  • Citations3

Big Data Analytics and Mining for Knowledge Discovery

  • Jan 01, 2022
  • Carson K Leung
  • Book Chapter
  • Citations3

Big Data Analytics and Mining for Knowledge Discovery

  • Dec 03, 2020
  • Carson K Leung
  • Conference Article

A Comparison of Apriori Algorithm and Apriorib with Hashing Algorithm

  • May 25, 2022
  • Arjun Malik +2
  • Conference Article
  • Citations3

Compressed Bitmaps Based Frequent Itemsets Mining on Hadoop

  • May 09, 2016
  • Aref A Saeed +3
  • Book Chapter
  • Citations1

A Novel Algorithm for Frequent Itemsets Mining in Transactional Databases

  • Jan 01, 2018
  • Huan Phan +1
  • Book Chapter
  • Citations4

Transaction Databases, Frequent Itemsets, and Their Condensed Representations

  • Jan 01, 2006
  • Taneli Mielikäinen
  • Research Article
  • Citations5

Special issue on big data networking-challenges and applications

  • Dec 01, 2015
  • Journal of Communications and Networks
  • Zhu Han +4
  • Conference Article
  • Citations35

Pattern Mining from big IoT Data with fog Computing: Models, Issues, and Research Perspectives

  • May 01, 2019
  • Peter Braun +5
  • Conference Article
  • Citations3

A Preliminary Study of the Feasibility of Global Evolutionary Feature Selection for Big Datasets under Apache Spark

  • Jul 01, 2018
  • M Galar +3
  • Research Article
  • Citations30

CP-tree: An adaptive synopsis structure for compressing frequent itemsets over online data streams

  • Mar 24, 2014
  • Information Sciences
  • Se Jung Shin +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.