Study of Incremental Updating Algorithm for Association Rules

摘要：

　　Discover frequent itemsets is the key problem of mining association rules,and the expenditure of this process is high.So,the research of incremental updating algorithms is particular important.This paper presents a comprehensive study on the performance of incremental updating algorithms that currently available,such as IUA 1 which makes full use of frequent itemsets already got.Based on the shortcomings of IUA,presents a new algorithm AIUA as an improved algorithm of IUA.

关键词： Data mining Association rules Incremental updating

作者: An Hongmei Chen Ping Huang Lijing

作者单位: Technology Department Maanshan Teachers School Maanshan, 243000, China School of Information Science & Engineering Hebei University of Science and Technology Shijiazhuang,

会议类型: 国际会议

会议名称: 2012 2nd International Conference on Computer Application and System Modeling(2012第二届计算机应用与系统建模国际会议)(ICCASM-2012)

会议地点: 沈阳

会议语种:英文

页码: 1147-1150

在线出版日期: 2012-07-27（万方平台首次上网日期，不代表论文的发表时间）