| 基于有向图的关联规则算法 |
| |
| 引用本文： | 郑玲霞,李大学,马万里.基于有向图的关联规则算法[J].重庆邮电学院学报(自然科学版),2005,17(4):495-498. |
| |
| 作者姓名： | 郑玲霞 李大学 马万里 |
| |
| 作者单位： | 重庆邮电学院 重庆400065
(郑玲霞，李大学)，重庆邮电学院 重庆400065(马万里) |
| |
| 摘 要： | 提出了一种基于有向图的关联规则挖掘算法，采用了垂直二进制位图映射数据库，根据垂直二进制位图来生成有向图，将频繁项的二进制位串作为有向图的权值，通过分析有向图生成最大频繁项集，并给出了最大频繁项集挖掘算法的优势。
|
| 关 键 词： | 有向图 关联规则 垂直二进制位图 最大频繁项集 二进制位串 |
Directed graph-based mining association rules algorithm |
| |
| ZHENG Ling-xia,LI Da-xue,MA Wan-li.Directed graph-based mining association rules algorithm[J].Journal of Chongqing University of Posts and Telecommunications(Natural Sciences Edition),2005,17(4):495-498. |
| |
| Authors: | ZHENG Ling-xia LI Da-xue MA Wan-li |
| |
| Abstract: | A new algorithm of mining association rules based on directed graph is proposed, vertical bitmap is used to represent transaction database, and directed graph is generated based on vertical bitmap.And frequent item binary string is used as weight of directed graph edge, then pruning algorithm of directed graph is delivered, finally maximal frequent item sets are obtained by analyzing directed graph. |
| |
| Keywords: | directed graph association rules vertical bitmap maximal frequent itemsets binary string |
| 本文献已被 CNKI 维普 等数据库收录！ |
