Frequent Patterns Mining
Year: 2020
Type: article
Abstract: Frequent pattern mining has been an important subject matter in data mining from many years. A remarkable progress in this field has been made and lots of efficient algorithms have been designed to search frequent patterns in a transactional database. One of the most important technique of datamining is the extraction rule in large database. The time required for generating frequent itemsets plays an important role. This paper provides a comparative study of algorithms Eclat, Apriori and FP-Growth. The performance of these algorithms is compared according to the efficiency of the time and memory usage. This study also focuses on each of the algorithm’s strengths and weaknesses for finding patterns among large item sets in database systems.
Authors: Y. Fakir, R. Elayachi
Institution: Université Sultan Moulay Slimane
Language: English
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W3102016417
