| 一种c#实现改进的关联规则挖掘算法 |
| |
| 引用本文： | 喻金平,齐先锋,罗珊梅.一种c#实现改进的关联规则挖掘算法[J].科技广场,2006,22(2):7-9. |
| |
| 作者姓名： | 喻金平 齐先锋 罗珊梅 |
| |
| 作者单位： | 1. 江西理工大学科技产业处,赣州,341000
2. 江西理工大学信息工程学院,赣州,341000 |
| |
| 摘 要： | 作为一种传统关联规则挖掘算法,Apriori算法存在许多可以改进的地方。比如它需要反复读取数据库,并且读取次数由项目集合中的项目的个数n来决定,I/O负载与最大频繁集中的项目个数成正相关。为改善这种状况,本文提出一种只读取一次数据库便可挖掘出关联规则的改进算法。
|
| 关 键 词： | 数据挖掘 关联规则 Apriori算法 |
| 文章编号： | 1671-4792-（2006）2-0013-03 |
an Improved Relating-rule Mining Algorithm of Apriori Relalized by C# |
| |
| Yu Jinping,Qi Xianfeng,Luo Shanmei.an Improved Relating-rule Mining Algorithm of Apriori Relalized by C#[J].Science Mosaic,2006,22(2):7-9. |
| |
| Authors: | Yu Jinping Qi Xianfeng Luo Shanmei |
| |
| Institution: | 1.Sci-Tech and Industry Offlce,Jiangxi University of Science and Technology,Ganzhou 341000; 2.Faculty of information Engineering,Jiangxi University of Science and Technology,Ganzhou 341000 |
| |
| Abstract: | The traditinal relating-rule algorithm of Apriori has many obvious shortcomings,which need to scandatabase frequently and the frequency is up to the number of items.The 210 load is direct ratio with the numberof items of the largest frequency itemset. This article provides an improved algorithm by which the databasewill be accessed for once only. |
| |
| Keywords: | Data Mining Association Rule Apriori Algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
