| 一种改进的关联规则挖掘算法 |
| |
| 引用本文： | 吴江红,周长英,于秀丽. 一种改进的关联规则挖掘算法[J]. 天津科技大学学报, 2005, 20(2): 57-60 |
| |
| 作者姓名： | 吴江红 周长英 于秀丽 |
| |
| 作者单位： | 1. 天津科技大学计算机科学与信息工程学院,天津,300222
2. 唐山学院教务处,唐山,063000 |
| |
| 摘 要： | 在Apriori算法基础上，给出一个改进的关联规则挖掘算法。改进的算法只需对数据库进行一次搜索，能大量减少L／O次数，且内存开销适中。通过一组实验对两种算法进行比较，本算法尤其对大型数据库的性能优于先前已有的一些关联规则算法。
|
| 关 键 词： | 数据挖掘 关联规则 频繁项 最小支持度 |
| 文章编号： | 1672-6510(2005)02-0057-04 |
| 修稿时间： | 2004-08-30 |
An Improved Algorithm for Mining Association Rules |
| |
| WU Jiang-hong,ZHOU Chang-ying,YU Xiu-li. An Improved Algorithm for Mining Association Rules[J]. Journal of Tianjin University of Science & Technology, 2005, 20(2): 57-60 |
| |
| Authors: | WU Jiang-hong ZHOU Chang-ying YU Xiu-li |
| |
| Affiliation: | WU Jiang-hong1,ZHOU Chang-ying2,YU Xiu-li1 |
| |
| Abstract: | Based on the Apriori Algorithm, an improved algorithm for mining association rules was presented.The improved algorithm only needs one pass over the database and reduces I/O overheads greatly. At the same time, it has a moderate memory spending. Compare the improved algorithm with other algorithm by a set of experiment.Through experiment discussing, the improved algorithm is better than some previous algorithm for very large databases. |
| |
| Keywords: | data mining association rules frequent items minimum support |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
