%0 Journal Article
%A ZHANG Zhong-ping
%A GUO Jing
%A HAN Li-xia
%T MLFI：New method for maximum length frequent itemsets mining
%D 2010
%R 10.3778/j.issn.1002-8331.2010.16.041
%J Computer Engineering and Applications
%P 140-142
%V 46
%N 16
%X After the current definition of the maximum length frequent itemsets mining problem is understood and its many practical applications are explored，an FP-tree-based algorithm is proposed for the mining problem.Maximum length frequent itemsets are mined while traversing the FP-tree in the algorithm.There is only an initial FP-tree.Theoretic analysis and experiments show that the algorithm accelerates the speed to traverse the tree and improves the mining efficiency.
%U http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.2010.16.041