Abstract

Owing to the conception of big data and massive data processing there are increasing owes related to the temporal aspects of the data processing. In order to address these issues a continuous progression in data collection, storage technologies, designing and implementing large-scale parallel algorithm for Data mining is seen to be emerging in a rapid pace. In this regards, the Apriori algorithms have a great impact for finding frequent item sets using candidate generation. This paper presents highlights on parallel algorithm for mining association rules using MPI for passing message base in the Master-Slave based structural model.

Highlights

  • Data mining could be characterized as the methodology of discovering hidden pattern in database

  • Association rule mining is a sort of data mining process [1]

  • Data Mining directly arranged to the enormous databases which have hundreds of properties and a huge number of records that contain complex relationship between the data sheets, and this will inevitably lead to the dramatic increase of the search space and size in the process of data mining [3]

Read more

Summary

INTRODUCTION

Data mining could be characterized as the methodology of discovering hidden pattern in database. Association rule mining is done to extract interesting correlations, patterns, associations among items in the transaction database or other data repositories [2]. Apriori is a classic algorithm for studying association rules. A number of potential and interesting relationships will be found in the large amount of data through mining some potential relationship between the item sets of the database [5]. These relationships play an important role in guiding and reference for the market basket analysis, cross-selling of commodities, business decision-making such as advertising mail analysis [6]. In order to achieve high-performance parallel computing, there is an algorithm which using Master-Slave structure and communicate by MPI between the hosts, make full use of the resources of the workstation, a unified scheduling, coordination of treatment, under the cluster environment

Measures Association Rule
IDENTIFYING LARGE KEYWORD SETS
Save the frequent itemsets in Lk
PARALLEL APRIORI ALGORITHM
CONCLUSION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call