| 一种有效的挖掘关联规则更新方法 |
| |
| 引用本文： | 王新.一种有效的挖掘关联规则更新方法[J].计算机应用,2005,25(6):1360-1361,1372. |
| |
| 作者姓名： | 王新 |
| |
| 作者单位： | 云南民族大学,数学与计算机科学学院,云南,昆明,650031 |
| |
| 基金项目： | 云南省教育厅科研基金资助项目(022Y165) |
| |
| 摘 要： | 在挖掘关联规则过程中，用户往往需要多次调整(增加或减少)最小支持度，才能获得有用的关联规则。给出一个利用已存信息有效产生新候选项目集的PSI算法，结果表明每次扫描数据库时能有效地减少候选项目集的数。
|
| 关 键 词： | 数据挖掘 关联规则 Apriori算法 PSI算法 |
| 文章编号： | 1001-9081(2005)06-1360-02 |
Efficient updating method for mining association rules |
| |
| WANG Xin.Efficient updating method for mining association rules[J].journal of Computer Applications,2005,25(6):1360-1361,1372. |
| |
| Authors: | WANG Xin |
| |
| Affiliation: | WANG Xin School of Mathematics and Computer Science,Yunnan University of the Nationlities,Kunming Yunnan 650031,China) |
| |
| Abstract: | In mining association rules, an user may required to tune (increase or reduce) the value of the minimum support many times before a set of useful association rules could be obtained from the transaction database. In this paper, an algorithm PSI was given for efficient generation of new candidate itemsets using prestored information. It can significantly reduce the number of candidate itemsets in each database scan. |
| |
| Keywords: | data mining association rules Apriori algorithm PSI algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
