中文摘要：

为提高带权频繁模式挖掘过程中的时空效率,定义事务集合差（the difference of two Tidsets,dTidset）概念,在dTidset的基础上对于WIT-Tree存储结构进行改进和优化,提出一种基于WIdT-Tree的带权频繁模式挖掘算法。利用分治策略和dTidset相关性质对带权支持度进行计算,提高计算效率;利用WIdT-Tree存储带权模式,减少空间消耗。在真实数据集和人工模拟数据集上分别进行测试和比较,实验结果表明,该算法具有更高的时间、空间效率和更好的可扩展性。

英文摘要：

To improve the time and space efficiency in the process of weighted frequent pattern mining, the concept of dTidset （the difference of two Tidsets） was defined. On the basis of dTidset, WIT-Tree storage structure was improved and optimized, and an efficient algorithm, based on WIdT-Tree, was proposed to discover weighted frequent patterns. Besides,the divide and conquer strategy and the theorems of dTidset were used to calculate the weighted support, and computational efficiency was greatly improved. The weighted frequent patterns were stored on WIdT-Tree to reduce the space consumption. Algorithms were tested and compared on real and synthetic datasets. Experimental results show that the proposed algorithm has excellent time and space efficiency and better scalability.