浅谈加权频繁项集挖掘的研究进展  

Research Progress of Weighted Frequent Itemsets Mining

作　　者：房新秀 FANG Xin-xiu(Qingdao Technological Universiy,Qingdao 266520,China)

机构地区：[1]青岛理工大学

出　　处：《电脑知识与技术》2019年第9X期225-226,共2页Computer Knowledge and Technology

摘　　要：加权频繁项集挖掘是目前研究热点之一。自从关联规则挖掘提出以来,大部分的研究工作都围绕频繁项集挖掘问题进行。传统的关联挖掘算法往往忽略数据库中各个项目的重要程度区别,因此利用加权关联规则是有意义的。十几年来,学者们从不同的角度进行改进从而提高挖掘加权频繁项集算法的效率。本文首先分析了频繁项集挖掘现状,其次对加权频繁项集挖掘进行深入分析,最后通过对比频繁项集与加权频繁项集算法,对未来的工作进行了展望。Mining frequent weighted itemsets is one of the hotspots of research at present.Since the association rule mining was put forward,most of the research work has focused on frequent itemset mining.Traditional association mining algorithms often ignore the differences between items in the database in importance,so it is meaningful to use weighted association rules.For more than a decade,Scholars have improved the efficiency of the mining weighted frequent itemset algorithm from different angles.Firstly,this paper analyzes the current situation of frequent itemset mining,then makes an in-depth analysis of weighted frequent itemset mining,and finally looks forward to the future work by comparing the frequent itemset algorithm and the weighted frequent itemset algorithm.

关 键 词：关联规则 频繁项集 加权关联规则 加权频繁项集 算法 

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