| 基于事务互补的双向挖掘算法 |
| |
| 引用本文： | 方刚,刘雨露. 基于事务互补的双向挖掘算法[J]. 计算机工程与应用, 2008, 44(36): 168-170. DOI: 10.3778/j.issn.1002-8331.2008.36.047 |
| |
| 作者姓名： | 方刚 刘雨露 |
| |
| 作者单位： | 重庆三峡学院,数学与计算机科学学院,重庆,404000;重庆三峡学院,数学与计算机科学学院,重庆,404000 |
| |
| 摘 要： | 提出一种基于事务互补的双向挖掘算法，其适合挖掘任何长度的频繁项目集；该算法通过二进制的逻辑操作，用自顶向下策略和事务补集方式双向产生频繁候选项，并在计算支持数时用事务特征减少搜索事务数；通过与其他算法相比，实验表明它是快速而有效的。
|
| 关 键 词： | 关联规则 事务互补 双向搜索 二进制 挖掘算法 |
| 收稿时间： | 2008-05-29 |
| 修稿时间： | 2008-8-18 |
Algorithm of double search mining based on transaction complementarity |
| |
| FANG Gang,LIU Yu-lu. Algorithm of double search mining based on transaction complementarity[J]. Computer Engineering and Applications, 2008, 44(36): 168-170. DOI: 10.3778/j.issn.1002-8331.2008.36.047 |
| |
| Authors: | FANG Gang LIU Yu-lu |
| |
| Affiliation: | College of Math & Computer Science，University of Chongqing Three Gorges，Chongqing 404000，China |
| |
| Abstract: | An algorithm of double search mining based on transaction complementarity is presented,which is suitable for mining any long frequent item set.The algorithm uses top-down strategy and the way of transaction complementarity to generate frequent candidate item set in double search by binary logical operation,and uses transaction character to reduce the number of search transaction when computing support.Comparing with other algorithms,the experiment indicates that the algorithm is fast and efficient. |
| |
| Keywords: | association rules transaction complementarity double search binary mining algorithm |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
