New and Efficient Algorithms for Producing Frequent Itemsets with the Map-Reduce Framework
The Map-Reduce (MR) framework has become a popular framework for developing new parallel algorithms for Big Data. Efficient algorithms for data mining of big data and distributed databases has become an important problem. In this paper we focus on algorithms producing association rules and frequent...
Main Authors: | Yaron Gonen, Ehud Gudes, Kirill Kandalov |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2018-11-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/11/12/194 |
Similar Items
-
The MapReduce Model on Cascading Platform for Frequent Itemset Mining
by: Nur Rokhman, et al.
Published: (2018-07-01) -
Right-Hand Side Expanding Algorithm for Maximal Frequent Itemset Mining
by: Yalong Zhang, et al.
Published: (2021-11-01) -
High Scalability Document Clustering Algorithm Based On Top-K Weighted Closed Frequent Itemsets
by: Gede Aditra Pradnyana, et al.
Published: (2021-04-01) -
Multi-Objective Optimization for High-Dimensional Maximal Frequent Itemset Mining
by: Yalong Zhang, et al.
Published: (2021-09-01) -
Finding Stable Periodic-Frequent Itemsets in Big Columnar Databases
by: Hong N. Dao, et al.
Published: (2023-01-01)