Data Mining Essay

2065 Words5 Pages

- Data mining finds hidden pattern in data sets and association between the patterns. To achieve the objective of data mining association rule mining is one of the important techniques. This paper presents a survey on three different association rule mining algorithms FP Growth, Apriori and Eclat algorithm and their drawbacks which would be helpful to find new solution for the problems found in these algorithms The comparison of algorithms based on the aspects like different support value. Keywords— Frequent pattern mining, Apriori ,FP growth, Eclat I. INTRODUCTION The size of database has increased rapidly in recent years This has led to a growing interest in the development of tools capable in the automatic extraction of knowledge from large collection of data. Data mining or knowledge discovery in database has been adopted for a area of research .It dealing with the automatic discovery of implicit information or knowledge within the databases. The implicit information within databases, mainly the interesting association relationships among sets of objects that lead to association rules may disclose useful patterns for marketing policies, decision support, financial forecast, even medical diagnosis and many other applications. In this paper, study includes depth analysis of algorithms and discusses some problems of generating frequent itemsets from the algorithm. II. ASSOCIATION RULE Association rule are the statements that find the relationship between data in any database. Association rule has two parts “Antecedent” and “Consequent‟. For example, {mobile} => {sim}. Here mobile is the antecedent and sim is the consequent. Antecedent is the item that found in database, and consequent is the item that found in combination ... ... middle of paper ... ...and Eclat. The classification is based on the features such as the technique, memory utilization, database and time of each individual algorithm. The essential information of all the algorithms is clearly summarized in Table 6, discussed in the paper. VIII. CONCLUSION In this paper we had taken three algorithms i.e. Apriori, FP Growth and Eclat to identify efficient algorithm among them for searching frequent pattern in the database. By comparing them to classical frequent item set mining algorithms like FP-growth and Eclat the strength and weaknesses of these algorithms were identified and analyzed, shown in Table-6 .The conclusion drawn from the analysis is that the Eclat is most efficient among three algorithms. It made a significant contribution to the search of improving the efficiency of frequent itemset mining. Table- 6 Table of Comparisons REFERENCES

More about Data Mining Essay

Open Document