摘要
在实际应用中,数据库不是静止的,它会随着数据记录的增加而不断地改变,因此,对于已经挖掘出来的关联规则的维护问题在KDD系统成为一个新的挑战。本文主要对典型的关联规则更新算法FUP及FUP 进行分析、探讨和评价。
In the practical application,the database is not unaltered,and it may change with the added records.Therefore,a new challenge is issued in KDD,which is the maintenance of the mined association rules.In this paper,the author mainly explores,analyzes and evaluates the algorithms FUP and FUP for association rules updating.
出处
《长春大学学报》
2003年第1期28-30,共3页
Journal of Changchun University