The itemset lattice tree data structure was adopted to translate maximal frequent itemsets mining into the process of depth-first searching the itemset lattice tree.
采用项集格生成树的数据结构，将最大频繁项集挖掘过程转化为对项集格生成树进行深度优先搜索获取所有最大频繁节点的过程。
Furthermore, the concept of an expanded frequent itemset is introduced to greatly decrease the searching range for adjusting whether a frequent itemset is closed or not.
引入扩展频繁项集的概念，大大减小了检查频繁项集是否闭的搜索空间。
Furthermore, the concept of an expanded frequent itemset is introduced to greatly decrease the searching range for adjusting whether a frequent itemset is closed or not.
引入扩展频繁项集的概念，大大减小了检查频繁项集是否闭的搜索空间。
应用推荐