Firstly the properties of L-MAX frequent itemsets is analysed.Then by extending FP-tree structure an ExFP-tree data structure is presented and the algorithm of ExFP-tree generated is given.According to the character of prefixing paths shared in FP-tree,ExFP-tree implements compressingly storage of transaction information with sharing the transaction information of descendant nodes.

ExFP-tree利用FP-tree共享前綴路徑的性質通過共享子孫節(jié)點事務信息策略實現大量事務信息的壓縮存儲98国产；最后基于FP-MAX算法一级国产精品，提出基于ExFP-tree的L-MAX頻繁項集挖掘算法，核心思想是先根據L-MAX頻繁項集長度約束性質進行前瞻剪枝再進行最大頻繁項集挖掘亚洲色图欧美色图人妻，并通過回溯策略直接定位生成對應事務集久久精影院。