|
|||||
|
|
| 基于二进制的关联规则挖掘算法* | |
| 引用本文： | 范平,梁家荣,李天志,巩建闽.基于二进制的关联规则挖掘算法*[J].计算机应用研究,2007,24(8):79-80. |
| 作者姓名： | 范平 梁家荣 李天志 巩建闽 |
| 作者单位： | 1. 咸宁学院,信息工程学院,湖北,咸宁,437000;广西大学,计算机与电子信息学院,南宁,530004 2. 广西大学,计算机与电子信息学院,南宁,530004 3. 德州学院,计算机系,山东,德州,253023;广西大学,计算机与电子信息学院,南宁,530004 4. 德州学院,计算机系,山东,德州,253023 |
| 摘 要： | 将二进制引入关联规则求解中,充分利用二进制操作方便、运算速度快、节省空间的优势.在求解事务项集真子集和支持度时,对事务数据库中相同事务只求解一次,并给出了真子集的具体求解算法.本算法一次扫描数据库可以挖掘出所有频繁集,而且可以根据需求对最小支持度和最小置信度进行修改,修改后不需要再次扫描数据库即可求出频繁项集,大大提高了挖掘效率. |
| 关 键 词： | 二进制 关联规则 频繁集 真子集 二进制 关联 规则挖掘算法 binary based algorithm mining rules 挖掘效率 频繁项集 修改 最小置信度 最小支持度 需求 频繁集 事务数据库 扫描 求解算法 真子集 优势 |
| 文章编号： | 1001-3695（2007）08-0079-02 |
| 修稿时间： | 2006-08-222007-05-17 |
Association rules mining algorithm based on binary |
|
| FAN Ping,LIANG Jia rong,LI Tian zhi,GONG Jian min.Association rules mining algorithm based on binary[J].Application Research of Computers,2007,24(8):79-80. | |
| Authors: | FAN Ping LIANG Jia rong LI Tian zhi GONG Jian min |
| Affiliation: | (1.School of Information Engineering, Xianning College, Xianning Hubei 437000, China; 2.Dept. of Computer Science & Technology, Dezhou University, Dezhou Shandong 253023, China; 3.College of Computer & Electronic Information, Guangxi University, Nanning 530004, China) |
| Abstract: | This paper proposed a novel idea of binary-based association rules mining algorithm. There some transaction items were the same in a database. It was not necessary to work out the pure subsets for everyone but only to aim at every kind of them. With this algorithm all frequent itemsets could be minded by scanning the database only one time. The algorithm was very efficient and effective compaxed to the traditional methods. When the rain-support and rain-confidence were modified, it could get the frequent itemsets easily without scanning the database again. |
| Keywords: | binary association rules frequent itemset pure subsets |
| 本文献已被 维普 万方数据 等数据库收录！ | |
| 点击此处可从《计算机应用研究》浏览原始摘要信息 | |
| 点击此处可从《计算机应用研究》下载全文 | |