文献类型：会议论文

英文题名：Incremental Updating Algorithm Based on Partial Support Tree for Mining Association Rules

作者：Wang Yuping[1];Dong Nanping[1];Zhou Guanling[1]

第一作者：王育平

通讯作者：Wang, YP[1]

机构：[1]Beijing Union Univ, Coll Automat, Beijing, Peoples R China

第一机构：北京联合大学城市轨道交通与物流学院

通讯机构：[1]corresponding author), Beijing Union Univ, Coll Automat, Beijing, Peoples R China.|[1141751]北京联合大学城市轨道交通与物流学院;[11417]北京联合大学;

会议论文集：IITA International Conference on Control, Automation and Systems Engineering

会议日期：JUL 11-12, 2009

会议地点：Zhangjiajie, PEOPLES R CHINA

语种：英文

外文关键词：data mining; association rules; incremental updating; partial support tree

摘要：A new algorithm, which is based on partial support tree (PS_Tree), is proposed to deal with the incremental updating problem when a new database is inserted and the minimum support is not changed. This algorithm use effectively the association rules mined and the partial support tree reserved to improve the performance. It only need scan the updated part of the database once so that the efficiency of algorithm can be further improved. The performance study shows that the algorithm is efficient for incremental updating problems of association rules.