Abstract

Generating Frequent Patterns from Large Datasets using Improved Apriori and Support Chaining Method

Highlights

  • A days Data mining has been widely used and unifies research in various fields such as computer science, networking and engineering, statistics, databases, machine learning and Artificial Intelligence etc

  • There are different techniques that fit in this category including association rule mining, classification and clustering as well as regression Apriori algorithm is the most efficient candidate generation approach proposed by Agrawal et al (1993)

  • The main objective of this study is to reduce the number of frequent item sets

Read more

Summary

Introduction

A days Data mining has been widely used and unifies research in various fields such as computer science, networking and engineering, statistics, databases, machine learning and Artificial Intelligence etc. There are different techniques that fit in this category including association rule mining, classification and clustering as well as regression Apriori algorithm is the most efficient candidate generation approach proposed by Agrawal et al (1993). To count the support of item sets, it uses breadth-first search strategy and to utilize the downward closure property of support, it uses candidate generation function. Apriori algorithm is an iterative one known as level-wise search and it uses the prior knowledge of frequent item set properties in generating association rules (Agrawal et al, 1993). Apriori algorithm works with the following principle. If an item set is frequent, all of its subsets must be frequent

Objectives
Methods
Findings
Conclusion
Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.