Efficient Mining of Frequent Patterns Using Ascending Frequency Ordered Prefix-Tree

  title={Efficient Mining of Frequent Patterns Using Ascending Frequency Ordered Prefix-Tree},
  author={Guimei Liu and Hongjun Lu and Wenwu Lou and Yabo Xu and Jeffrey Xu Yu},
  journal={Data Mining and Knowledge Discovery},
Mining frequent patterns, including mining frequent closed patterns or maximal patterns, is a fundamental and important problem in data mining area. Many algorithms adopt the pattern growth approach, which is shown to be superior to the candidate generate-and-test approach, especially when long patterns exist in the datasets. In this paper, we identify the key factors that influence the performance of the pattern growth approach, and optimize them to further improve the performance. Our… CONTINUE READING
Highly Cited
This paper has 68 citations. REVIEW CITATIONS
30 Citations
18 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 30 extracted citations

68 Citations

Citations per Year
Semantic Scholar estimates that this publication has 68 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 18 references

Charm: An efficient algorithm for closed association rule mining

  • M. J. Zaki, Hsiao, C.-J.
  • Proceedings of the 2nd SIAM International…
  • 2002

A tree projection algorithm for finding frequent itemsets

  • R. C. Agarwal, C. C. Aggarwal, V.V.V. Prasad
  • Journal on Parallel and Distributed Computing.
  • 2001
1 Excerpt

Similar Papers

Loading similar papers…