| 一种快速挖掘约束性关联规则的算法 |
| |
| 引用本文： | 方刚. 一种快速挖掘约束性关联规则的算法[J]. 计算机应用与软件, 2009, 26(8): 268-270,280 |
| |
| 作者姓名： | 方刚 |
| |
| 作者单位： | 重庆三峡学院数学与计算机科学学院,重庆,404000 |
| |
| 摘 要： | 提出一种快速挖掘约束性关联规则的算法,其适用于挖掘带约束条件的频繁项目集.该算法通过数字区间的数值自动递减产生候选频繁项,并用二进制的逻辑操作计算支持数和用数字特征减少扫描事务的个数.算法的原理简单有效,能够有效减少扫描的时间和产生候选频繁项的时间,与现有的约束性关联规则挖掘算法和基于二进制的挖掘算法相比,其效率得到明显提高.
|
| 关 键 词： | 数据挖掘 约束条件 关联规则 二进制 数字特征 |
AN ALGORITHM OF FAST MINING CONSTRAINED ASSOCIATION RULES |
| |
| Fang Gang. AN ALGORITHM OF FAST MINING CONSTRAINED ASSOCIATION RULES[J]. Computer Applications and Software, 2009, 26(8): 268-270,280 |
| |
| Authors: | Fang Gang |
| |
| Affiliation: | College of Math and Computer Science;Chongqing Three Gorges University;Chongqing 404000;China |
| |
| Abstract: | An algorithm of fast mining constrained association rules is presented,which is suitable for mining frequent item sets with constrained condition.The algorithm generates frequent items' candidate by automatically descending value in digital interval,and uses binary logic operation to count support numbers and uses digital character to reduce the number of scanned transactions.The principle of the algorithm is simple and efficient in reducing the times of scanning and generating frequent items' candidate,the... |
| |
| Keywords: | Data mining Constrained condition Association rules Binary Digital character |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
