Article ID Journal Published Year Pages File Type
487627 Procedia Computer Science 2014 8 Pages PDF
Abstract

Pattern recognition is seen as a major challenge within the field of data mining and knowledge discovery. For the work in this paper, we have analyzed a range of widely used algorithms for finding frequent patterns with the purpose of discovering how these algorithms can be used to obtain frequent patterns over large transactional databases. This has been presented in the form of a comparative study of the following algorithms: Apriori algorithm, Frequent Pattern (FP) Growth algorithm, Rapid Association Rule Mining (RARM), ECLAT algorithm and Associated Sensor Pattern Mining of Data Stream (ASPMS) frequent pattern mining algorithms. This study also focuses on each of the algorithm's strengths and weaknesses for finding patterns among large item sets in database systems.

Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)