earticle

영어

Various types of data structures and algorithms have been proposed to extract frequently occurring patterns from a given data set. In particular, several tree structures have been devised to represent the input data set for efficient pattern discovery. One of the fastest frequent pattern mining algorithms known to date is the CATS algorithm, which can efficiently represent the whole data set and allow mining with a single scan over the database. In this paper, we propose an efficient tree structure and its associated algorithm that provides a considerable performance improvement over CATS in terms of memory usage and processing time. We have demonstrated the effectiveness of our algorithm and performance improvement over the existing approach by a series of experiments.