版权说明 操作指南
首页 > 成果 > 详情

The design of a new updating algorithm for association rules based on list

认领
导出
Link by 中国知网会议论文
反馈
分享
QQ微信 微博
成果类型:
期刊论文、会议论文
作者:
Xiao, Yunhua*;Ouyang, Chenhua
通讯作者:
Xiao, Yunhua
作者机构:
[Xiao, Yunhua] Hunan Univ Finance & Econ, Dept Management, Fenlin Rd, Changsha, Hunan, Peoples R China.
[Ouyang, Chenhua] Hengyang Normal Univ, Dept Comp, Hengyang, Hunan, Peoples R China.
通讯机构:
[Xiao, Yunhua] H
Hunan Univ Finance & Econ, Dept Management, Fenlin Rd, Changsha, Hunan, Peoples R China.
语种:
英文
关键词:
Association rules;Fup;Updating algorithm
期刊:
Advances in Intelligent and Soft Computing
ISSN:
1867-5662
年:
2011
卷:
112
页码:
211-215
会议名称:
International Conference on Informatics, Cybernetics, and Computer Engineering (ICCE2011)
会议论文集名称:
Advances in Intelligent and Soft Computing
会议时间:
NOV 19-20, 2011
会议地点:
Melbourne, AUSTRALIA
会议主办单位:
[Xiao, Yunhua] Hunan Univ Finance & Econ, Dept Management, Fenlin Rd, Changsha, Hunan, Peoples R China.^[Ouyang, Chenhua] Hengyang Normal Univ, Dept Comp, Hengyang, Hunan, Peoples R China.
主编:
Jiang, LZ
出版地:
HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
出版者:
SPRINGER-VERLAG BERLIN
ISBN:
978-3-642-25193-1
基金类别:
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...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com