A Weighted Frequent Itemsets Incremental Updating Algorithm Base On Hash Table

摘要：

The excavating and updating of maximum frequent itemsets are the important aspects of data mining. The importance of each data item is not completely the same, and the items are not evenly distributed. This article proposed an effective mining algorithm of weighted frequent itemsets, WHIUA (Weighted Hash Incremental Updating Algorithm), which is based on the hash table data structure, to deal with the problem that database and minimum support are both changed. Analysis and experiments show that this algorithm can effectively increases the excavating and updating efficiency of maximum frequent itemsets.

关键词： data mining weighted frequent itemsets hash incremental updating

作者: Zi-guo Huai Ming-he Huang

作者单位: School of Software Jiangxi Normal University Nanchang, Jiangxi, 330022, China

会议类型: 国际会议

会议名称: 2011 2nd International Conference on Data Storage and Data Engineering(DSDE 2011)(2011年第二届数据存储与数据工程国际会议)

会议地点: 西安

会议语种:英文

页码: 201-204

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