FOEH: Frequent Pattern Mining Performance Optimization over Large Transactional Data in Extended Hadoop MapReduce

preprint OA: closed CC-BY-4.0
📄 Open PDF View at publisher

Abstract

Frequent item mining is a process wherein we extract or mine frequent itemsets from a given input dataset. Apriori algorithms and FP-growth algorithms are two types of common pattern mining algorithms. Traditional implementations of such frequent item mining algorithms tend to be inefficient when it comes to mining frequent item sets over large transactional datasets, owing to the fact that they consume a greater amount of time in performing the same. In order to tackle the issues mentioned, large transaction datasets using the extended Hadoop MapReduce Framework are considered. On the same, a novel distributed, parallel processing, frequent item mining algorithm is integrated. The analysis of the performance of the implemented algorithm proves that the performance of frequent item analysis in relation to data uploading time, HDFS disk utilization, and data processing time has improved drastically.

My notes (saved in your browser only)

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00
unpaywall
last seen: 2026-05-22T02:00:06.705733+00:00
License: CC-BY-4.0