Improving the efficiency of frequent pattern mining by compact data structure design

Raj P. Gopalan, Yudho Giri Sucahyo

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


Mining frequent patterns has been a topic of active research because it is computationally the most expensive step in association rule discovery. In this paper, we discuss the use of compact data structure design for improving the efficiency of frequent pattern mining. It is based on our work in developing efficient algorithms that outperform the best available frequent pattern algorithms on a number of typical data sets. We discuss improvements to the data structure design that has resulted in faster frequent pattern discovery. The performance of our algorithms is studied by comparing their running times on typical test data sets against the fastest Apriori, Eclat, FP-Growth and Opportune Project algorithms. We discuss the performance results as well as the strengths and limitations of our algorithms.

Original languageEnglish
Pages (from-to)576-583
Number of pages8
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publication statusPublished - 2004


Dive into the research topics of 'Improving the efficiency of frequent pattern mining by compact data structure design'. Together they form a unique fingerprint.

Cite this