摘要
分析了基于关联规则的增量数据挖掘算法,针对传统数据挖掘算法多次迭代扫描,数据库和最小支持度不能同时发生变化,数据结构复杂等的不足,提出哈希增量数据挖掘算法HIUA。该算法只需要扫描数据库一次,并且采用常用的哈希存储结构,数据结构简单,操作方便、可行,通过测试结果表明该算法是合理有效的。
This paper analyzes the general incremental data mining algorithm based on association rules,and presents the hash incremental updating algorithm(HIUA) aiming at the shortage of traditional data mining algorithm which scans multi-times iterative scans and the database and the minimum support can not be changed synchronously and data structure is complicated.The algorithm scans database only once and the data structure of proposed algorithm is simple for the usage of the hash storage structure,it is operated conveniently,tested results indicates that the HIUA algorithm is valid and effective.
出处
《武汉理工大学学报》
CAS
CSCD
北大核心
2010年第20期151-155,共5页
Journal of Wuhan University of Technology
基金
国家自然科学基金(60841001)
中南民族大学自然科学基金(YZQ09003)
关键词
数据挖掘
关联规则
增量更新
HIUA算法
data mining
association rules
incremental updation
HIUA algorithm