New and efficient algorithms for producing frequent itemsets with the Map-Reduce framework

DOI10.3390/a11120194zbMath1461.68209OpenAlexW2902983346WikidataQ128896495 ScholiaQ128896495MaRDI QIDQ1712055

Yaron Gonen, Kirill Kandalov, Ehud Gudes

Publication date: 21 January 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a11120194

zbMATH Keywords

big dataMapReduceincremental computationclosed itemsetsapriorifrequent itemsets

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Distributed algorithms (68W15) Computational aspects of data analysis and big data (68T09)

Uses Software

• MapReduce
• Hadoop
• AFOPT
• Twister

Cites Work

• Unnamed Item
• Distributed Computing - IWDC 2004

This page was built for publication: New and efficient algorithms for producing frequent itemsets with the Map-Reduce framework