| 基于关联图的频集快速发现算法 |
| |
| 引用本文： | 刘博,郑启伦,彭宏.基于关联图的频集快速发现算法[J].计算机工程与设计,2006,27(17):3136-3139. |
| |
| 作者姓名： | 刘博 郑启伦 彭宏 |
| |
| 作者单位： | 1. 华南理工大学,计算机科学与工程学院,广东,广州,510640;华南师范大学,教育信息技术学院,广东,广州,510631
2. 华南理工大学,计算机科学与工程学院,广东,广州,510640 |
| |
| 摘 要： | 关联规则挖掘技术能够从复杂数据中发现有意义的关联知识，但是目前还没有有效的执行算法，为了提高频集发现问题中的存在的执行效率问题，引入了基于关联图的数据表示技术，提出了基于关联图的频集快速发现算法（conjunction graph-based frequent-sets fast finding algorithm，CGFF），根据关联图的结构特性，有效地实现了频集发现的合理剪枝问题，大大提高了执行效率，最后通过实验证明频集快速发现算法是行之有效的。
|
| 关 键 词： | 数据挖掘 关联规则 频集 关联图 关联规则挖掘 |
| 文章编号： | 1000-7024（2006）17-3136-04 |
| 收稿时间： | 2005-12-05 |
| 修稿时间： | 2005-12-05 |
Conjunction graph-based frequent-sets fast finding algorithm |
| |
| LIU Bo,ZHENG Qi-lun,PENG Hong.Conjunction graph-based frequent-sets fast finding algorithm[J].Computer Engineering and Design,2006,27(17):3136-3139. |
| |
| Authors: | LIU Bo ZHENG Qi-lun PENG Hong |
| |
| Affiliation: | 1. School of Computer Science and Engineering, South China University of Technology, Guangzhou 510640, China; 2. College of Educational Information Technology, South China Normal University, Guangzhou 510631, China |
| |
| Abstract: | There are no efficient algorithms to mining correlation rules in the field ofdata mining. To enhance the efficiency ofprocessing to find frequent sets, a novel algorithm for mining complete frequent itemsets is presented. This algorithm is referred to as the conjunction graph-based frequent-sets fast finding algorithm from hereon, In this algorithm, the graph-based pruning to produce frequent patterns is employed. Experimental data show that the CGFF algorithm outperforms than others. |
| |
| Keywords: | data mining correlation rules frequent itemsets conjunction graph correlation rules mining |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
