| 一种基于事务压缩的关联规则优化算法 |
| |
| 引用本文： | 张素兰.一种基于事务压缩的关联规则优化算法[J].计算机工程与设计,2006,27(18):3450-3453. |
| |
| 作者姓名： | 张素兰 |
| |
| 作者单位： | 中国航天科工集团第二研究院706所,北京,100854 |
| |
| 摘 要： | 通过对Apriori算法挖掘过程进行分析,提出了一种基于事务压缩的关联规则挖掘算法.该算法充分利用Apriori性质,通过减少候选集的组合和减少数据库的扫描来提高挖掘的速度和减少数据库的I/O操作时间的开销,有效提高了关联规则的挖掘效率.并在Apriori算法的基础上设计了Apriori改进算法.
|
| 关 键 词： | 数据挖掘 关联规则 Apriori算法 事务压缩 |
| 文章编号： | 1000-7024（2006）18-3450-04 |
| 收稿时间： | 2005-07-18 |
| 修稿时间： | 2005-07-18 |
Improved algorithm of mining association rules based on reducing transaction |
| |
| ZHANG Su-lan.Improved algorithm of mining association rules based on reducing transaction[J].Computer Engineering and Design,2006,27(18):3450-3453. |
| |
| Authors: | ZHANG Su-lan |
| |
| Affiliation: | Institute 706, Second Academy of China Aerospace Science and Industry Corporation, Beijing 100854, China |
| |
| Abstract: | With the aid of the analysis of mining association rules,a method of mining association rules based on reducing transaction is proposed,which makes best use of property of Apriori.Its main idea is to reduce the number of candidate items and to reduce the times of database scanning.The solution is available.It upgrades the speed of data mining and decreases computer's I/O operation.It's proved to be more efficient than the traditional method. |
| |
| Keywords: | data mining association rule Apriori algorithm reducing transaction |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
