基于紧凑效用列表的增量高效用模式挖掘方法  

Incremental high utility pattern mining method based on compact utility list

作　　者：张春砚 韩萌[1] 孙蕊 杜诗语 申明尧 ZHANG Chunyan;HAN Meng SUN Rui;DU Shiyu;SHEN Mingyao(College of Computer Science and Engineering,North Minzu University,Yinchuan 750021,Ningxia,China)

机构地区：[1]北方民族大学计算机科学与工程学院,宁夏银川750021

出　　处：《山东大学学报（工学版）》2021年第2期122-128,共7页Journal of Shandong University（Engineering Science）

基　　金：国家自然科学基金资助项目(2062004);宁夏自然科学基金资助项目(2020AAC03216);北方民族大学研究生创新项目资助项目(YCX20061)。

摘　　要：针对存在大量冗余数据等问题,提出紧凑增量高效用挖掘算法。采用HUI-trie结构和紧凑效用列表两种结构,前者用于更新高效用项集的效用,后者用于存储信息,而无需生成任何候选项。这两种结构使算法无需再次分析整个数据集,就可以将增加的数据反映到以前的分析结果中,更有效地处理增量数据集。试验结果表明,该算法在各种数据集上,运行时间平均提高38%,内存平均减少32%,具有一定的可扩展性。Aiming at the problem of large amounts of redundant data, a compact incremental high utility mining algorithm was proposed. The HUI-trie structure and a compact utility list were used. The former was used to update the utility of the high utility itemsets, and the latter was used to store information without generating any candidates. These two structures enabled the algorithm to reflect the increased data into the previous analysis results without reanalyzing the entire data set, and processed incremental data sets more effectively. The test results showed that the algorithm had an average increase of 38% in running time and an average reduction in memory of 32% on various data sets, and it had certain scalability.

关 键 词：增量数据集 高效用模式 紧凑效用列表 候选项集 效用 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]