| 关联规则更新的新算法 |
| |
| 引用本文： | 吴文妹. 关联规则更新的新算法[J]. 福州大学学报(自然科学版), 2006, 34(5): 649-651 |
| |
| 作者姓名： | 吴文妹 |
| |
| 作者单位： | 福州大学数学与计算机科学学院,福建,福州,350002 |
| |
| 摘 要： | 考虑事务数据库D不变,项目集I发生变化时的关联规则挖掘问题.提出了两种关联规则更新算法,解决增加项目或减少项目时的关联规则更新问题.与重新运行一遍Apriori算法相比较,其运行效率有显著提高.
|
| 关 键 词： | 数据挖掘 关联规则 频繁项集 更新算法 |
| 文章编号： | 1000-2243(2006)05-0649-03 |
| 修稿时间： | 2005-10-10 |
New updating algorithms on association rules |
| |
| WU Wen-mei. New updating algorithms on association rules[J]. Journal of Fuzhou University(Natural Science Edition), 2006, 34(5): 649-651 |
| |
| Authors: | WU Wen-mei |
| |
| Affiliation: | WU Wen-mei(College of Mathematics and Computer Science,Fuzhou University,Fuzhou,Fujian 350002,China) |
| |
| Abstract: | This paper considers the data mining of association rules on condition that transaction database D unchanged and itemsets I changed,presents two updating algorithms for the maintenance of association rules.The two algorithms can resolve the maintenance of association rules when the item has been updated.Comparing to the Apriori algorithms,the efficience of these two kinds of algorithms have been greatly improved. |
| |
| Keywords: | data mining association rules frequent itemsets updating algorithms |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《福州大学学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《福州大学学报(自然科学版)》下载免费的PDF全文 |
