Title: An Efficient FP tree Based Algorithm for Mining the Maximal Frequent Patterns
Abstract: The mining of frequent patterns has been studied extensively in data mining research.Because of the huge number of frequent patterns to be found,an interesting alternative has been proposed recently.Instead of mining the complete set of frequent patterns,the new model only finds out the maximal frequent patterns,which can generate all frequent patterns.The orders of the magnitude are smaller than the complete set of frequent patterns.This paper proposes an efficient FP-tree based algorithm,MMFP(Mining Maximal Frequent patterns),with the development of two techniques:(1)single FP-tree path pruning,(2)itemset pruning.These techniques prune the search space enormously.Our performance study shows the advantage of these techniques and that the MMFP may have a good performance in terms of runtime and memory usage.
Publication Year: 2004
Publication Date: 2004-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot