| 基于有向图的频繁集挖掘算法 |
| |
| 引用本文： | 巫红霞,谢强.基于有向图的频繁集挖掘算法[J].湖州师范学院学报,2008,30(1):65-69. |
| |
| 作者姓名： | 巫红霞 谢强 |
| |
| 作者单位： | 南京航空航天大学,信息科学与技术学院,江苏,南京,210016 |
| |
| 摘 要： | 针对Apriori算法寻找频繁项集问题,提出了一种基于有向图的频繁集挖掘算法DGFM,该算法将事务数据库表示成二进制矩阵,利用有向图的思想,将频繁项的二进制位串作为有向图的权值,再将二进制矩阵用邻接表存储,通过搜索邻接表来生成频繁项集,最后试验证明该方法比Apriori算法具有更高的效率和性能.
|
| 关 键 词： | 有向图 频繁集 二进制 矩阵 |
| 文章编号： | 1009-1734（2008）01-0065-05 |
| 收稿时间： | 2007-11-28 |
| 修稿时间： | 2007-12-30 |
Directed Graph-based Frequent Itemsets Mining Association Rules Algorithm |
| |
| WU Hong-xia,XIE Qiang.Directed Graph-based Frequent Itemsets Mining Association Rules Algorithm[J].Journal of Huzhou Teachers College,2008,30(1):65-69. |
| |
| Authors: | WU Hong-xia XIE Qiang |
| |
| Abstract: | This paper proposes a frequent itemsets algorithm of mining association rules based on directed graph to the problem in finding out the frequent itemsets with Apriori algorithm, uses binary matrix to represent transaction database,and applies the thought of directed graph. We use frequent item binary string as weight of directed graph edge,then store the binary matrix table using adjacent storage, search the adjacent table to generate frequent itemsets, and finally prove it through tests, the result of which shows it is higher than Apriori algorithm in the efficiency and performance. |
| |
| Keywords: | directed graph frequent itemsets binary matrix |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
