Abstract
Data mining has become an indispensable technology for businesses and researchers in many fields. Discovering frequent itemsets is a key problem in important data mining applications. Typical association algorithms for solving this problem operate in a bottom-up, top-down and breadth-first search direction. The computation starts from frequent 1-itemsets (the minimum length frequent itemsets) and continues until all maximal (length) frequent itemsets are found. Algorithms perform well when all maximal frequent itemsets are short. However, performance drastically decreases when some of the maximal frequent itemsets are relatively long. This paper focuses on finding Maximum Frequent Set with the implementation of the APRIORI and the Dynamic Itemset Counting Algorithm (DIC) and a comparative study with Pincer Search Algorithm to select the fast algorithm for discovering the Maximum Frequent Set. General Terms Knowledge Discovery, Data Warehousing, Data Mining, Algorithms, Patterns.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
