摘要
目前已经提出的许多关联规则发现算法,大多数用于高效地发现大规模数据库中的关联规则,而对关联规则维护问题的研究工作却很少。文章提出一种增量式更新算法──IUPA(IncrementalUpdatingAlgorithm),用来解决多层次关联规则高效更新问题.
There have been many algorithms proposed for efficient discovery of association rules in large databases. However, very little work has been done on maintenance of discovered association rules. In this paper, an incremental updating algorithm-IUPA is presented for such efficient maintenance problem of multi-level association rules.
出处
《合肥工业大学学报(自然科学版)》
CAS
CSCD
2000年第2期200-204,共5页
Journal of Hefei University of Technology:Natural Science
基金
南京大学计算机新技术国家开放实验室基金!961601B2