supported by Hunan provincial education department research projects fund.(Approval number:09C1182)
机构署名:
本校为其他机构
院系归属:
计算机科学与技术学院
摘要:
To solve the incremental updating of association rule, this paper proposes an effective and simple updating algorithm based on list. This paper analyses this algorithm and compares with the Apriori algorithm and the FUP algorithm. This algorithm makes full use of the previous mining information and the efficiency of the insert and delete of the list. The algorithm scans the original and the updated database only once and achieves new association rules. This paper proved that the mining time and the result integrity of this algo...