Jung-Wei Wu

Learn More
Mining frequent patterns is an important task for knowledge discovery, which discovers the groups of items appearing always together excess of a user specified threshold. A famous algorithm for mining frequent patterns is FP-Growth which constructs a structure called FP-tree and recursively mines frequent patterns from this structure by building conditional(More)
Many approaches have been proposed for mining frequent pattern. However, either the search space or memory space is huge, such that the performance for the previous approach degrades when the database is massive or the threshold for mining frequent patterns is low. In this paper, we propose an algorithm for mining frequent patterns. Our algorithm only needs(More)
  • 1