The Design of a New Updating Algorithm for Association Rules Based on List

被引：0

作者：

Xiao, Yunhua ^{[1
]}

Ouyang, Chenhua ^{[2
]}

机构：

[1] Hunan Univ Finance & Econ, Dept Management, Fenlin Rd, Changsha, Hunan, Peoples R China

[2] Hengyang Normal Univ, Dept Comp, Hengyang, Hunan, Peoples R China

来源：

PROCEEDINGS OF THE 2011 INTERNATIONAL CONFERENCE ON INFORMATICS, CYBERNETICS, AND COMPUTER ENGINEERING (ICCE2011), VOL 3: COMPUTER NETWORKS AND ELECTRONIC ENGINEERING | 2011年 / 112卷

关键词：

association rules; updating algorithm; fup;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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 algorithm are better than the traditional association rules by experiment.

引用

页码：211 / +

页数：2