Fast Algorithm for Mining Maximum Frequent Patterns

Mining maximum frequent patterns is a key problem in data mining research.In this paper,a fast algorithm DMFP based on Prefix Tree for mining maximum frequent patterns is proposed.Prefix Tree stores information in a highly compact form.DMFP mines frequent patterns in depth-first order and directly in Prefix Tree by adjusting node information and node links without creating conditional pattern tree.Thus,it improves performance greatly.