# Map / Reduce Deisgn and Implementation of Apriori Alogirthm for handling voluminous data-sets

Source: [Map / Reduce Deisgn and Implementation of Apriori Alogirthm for handling voluminous data-sets](<https://www.sota2.com/research/paper/68fa60bd1e209131ce9f0de1>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T19:45:32.888Z

Authors: Anjan K. Koundinya, Srinath N. K., K. A. K. Sharma, Kiran Kumar, Madhu M. N., Kiran U. Shanbag

Published: 2012-12-19T15:04:12.000Z

## Abstract

Apriori is one of the key algorithms to generate frequent itemsets. Analyzing frequent itemset is a crucial step in analysing structured data and in finding association relationship between items. This stands as an elementary foundation to supervised learning, which encompasses classifier and feature extraction methods. Applying this algorithm is crucial to understand the behaviour of structured data. Most of the structured data in scientific domain are voluminous. Processing such kind of data requires state of the art computing machines. Setting up such an infrastructure is expensive. Hence a distributed environment such as a clustered setup is employed for tackling such scenarios. Apache Hadoop distribution is one of the cluster frameworks in distributed environment that helps by distributing voluminous data across a number of nodes in the framework. This paper focuses on map/reduce design and implementation of Apriori algorithm for structured data analysis.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1212.4692>)

[PDF](<https://arxiv.org/pdf/1212.4692.pdf>)