| 基于商品主键的关联规则挖掘思想与算法研究 |
| |
| 引用本文： | 秦吉胜,宋瀚涛. 基于商品主键的关联规则挖掘思想与算法研究[J]. 北京理工大学学报, 2004, 24(7): 600-603 |
| |
| 作者姓名： | 秦吉胜 宋瀚涛 |
| |
| 作者单位： | 北京理工大学,信息科学技术学院计算机科学工程系,北京,100081 |
| |
| 摘 要： | 为了快速求得数据库中的所有频繁项集,提出一种全新的商品主键算法GMK.该算法基于商品作为主键的数据库,采用一个ID数组记录购买某个项集的ID,然后计算与其连接的项集中具有相同ID的元素个数,从而得到连接项集的支持度.用GMK算法只需要扫描一次数据库,并且可以快速减小计算量,实现简单.实验证明了GMK算法的有效性.
|
| 关 键 词： | 关联规则 频繁项集 商品主键 Apriori算法 商品主键 关联 规则挖掘 思想 算法研究 Goods Major Based Association Rules Mining Algorithm 有效性 验证 计算量 扫描 支持度 元素个数 连接 频繁项集 购买 |
| 文章编号： | 1001-0645(2004)07-0600-04 |
| 收稿时间： | 2003-08-25 |
| 修稿时间： | 2003-08-25 |
Study on the Algorithm for Mining Association Rules Based on the Major Key of Goods |
| |
| QIN Ji-sheng and SONG Han-tao. Study on the Algorithm for Mining Association Rules Based on the Major Key of Goods[J]. Journal of Beijing Institute of Technology(Natural Science Edition), 2004, 24(7): 600-603 |
| |
| Authors: | QIN Ji-sheng and SONG Han-tao |
| |
| Affiliation: | Department of Computer Science and Engineering, School of Information Science and Technology, Beijing Institute of Technology, Beijing100081, China;Department of Computer Science and Engineering, School of Information Science and Technology, Beijing Institute of Technology, Beijing100081, China |
| |
| Abstract: | To find all the frequent itemsets in a database rapidly, a new algorithm GMK is brought forward based on the database whose major key is goods. It records the ID that buys the itemset through an ID-array, then counts the number of elements that has the same ID in the itemset that is jointed to. Accordingly, the degree of support of the joint-item is obtained. GMK only scans the database once, thus it can reduce the quantity of calculation rapidly and can be realized easily. The validity of GMK is proved through tests. |
| |
| Keywords: | association rules frequent itemset goods major key Apriori algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《北京理工大学学报》浏览原始摘要信息 |
|
点击此处可从《北京理工大学学报》下载全文 |
