Abstract
Generally frequent itemsets are extracted from large databases by applying association rule mining (ARM) algorithms like Apriori, Partition, Pincer-Search, Incremental, and Border algorithm etc. Genetic Algorithm (GA) can also be applied to discover the frequent patterns from databases. The main advantage of using GA in the discovery of frequent patterns or itemsets is that they can perform global search and its time complexity is lesser compared to other Apriori-based algorithms as because it is based on the greedy approach. But the FP-tree algorithm is considered to be the best among the ARM algorithms, because its candidate sets generation procedure is completely different from Apriori-based algorithms. The major aim of this paper is to present a comparative study among ARM-based and GA-based approaches to data mining.
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.
