Analyzing Efficient Algorithms of Frequent Pattern Mining

Abstract

Frequent pattern mining has been playing an important role for analyzing data in various fields such as medical treatment, biology, finance, networks, and so on. Since Apriori algorithm was proposed, frequent pattern mining has rapidly developed due to active research activities, and numerous mining algorithms have been proposed, such as FP-growth, FP-growth*, LCM, AFORT, and MAFIA. In this paper, we analyze and compare a variety of frequent pattern mining approaches, and discuss advantages and disadvantages of their algorithms. For the comparison, we evaluate mining performance for each algorithm using real datasets. In addition, we also experiment scalability for the algorithms to analyze their characteristics exactly. In the experimental results, we can know that LCM guarantees the fastest runtime performance, and FP-growth* and AFOPT show the most efficient memory usage. Using the characteristics analyzed from this paper, we can select and utilize the most appropriate algorithm with respect to numerous databases in the real world.