基于有向项集图的频繁集挖掘优化算法  

Updated Algorithms of Frequent Itemsets Mining Based on Directed Itemsets Graph

作　　者：温磊[1,2] 李敏强[1] 

机构地区：[1]天津大学管理学院,天津300072 [2]华北电力大学经济管理系,保定071003

出　　处：《计算机工程》2003年第22期111-113,共3页Computer Engineering

摘　　要：关联规则挖掘是数据挖掘研究中一个非常重要的研究领域。文章利用有向项集图(DISG)来存储有关频繁项集的信息，提出了利用深度优先的策略进行搜索的频繁项集挖掘的优先算法UDBDG(Updated DFS Based DISG) 。最后分析了算法在时间和空间上的复杂度并以mushroom数据库为例进行了试验。试验结果证明算法对于处理稠密集数据是有效的。Mining association rule is a very important research field of data mining. This paper introduces a new data structure called DISG (directed itemsets graph)in which the information of frequent itemsets is stored. Based on it, a new algorithm called UDBDG(Updated DFS based DISG) is developed by using depth first searching strategy. At last, it analyses the time and space complexity of UDBDG and performs an experiment on a real dataset mushroom to test UDBDG. The experiment shows that it is efficient for mining dense datasets.

关 键 词：关联规则 频繁集 有向项集图 深度优先 

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