期刊文献+

一种基于倒排索引树的增量更新关联挖掘算法 被引量:3

An incremental updating association rule mining algorithm based on inverted index tree
下载PDF
导出
摘要 增量更新关联规则挖掘主要解决事务数据库中交易记录不断更新和最小支持度发生变化时关联规则的维护问题。针对目前诸多增量更新关联规则挖掘算法存在效率低、计算成本高、规则难以维护等问题,提出一种基于倒排索引树的增量更新关联挖掘算法。该算法有效地将倒排索引技术与树型结构相结合,使得交易数据库中的数据不断更新和最小支持度随应用环境不同而不断改变时,以实现无需扫描原始交易数据库和不产生候选项集的情况下生成频繁项集。实验结果表明,该算法只需占用较小的存储空间、且检索项集的效率较高,能高效地解决增量更新关联规则难以维护的问题。 The primary mission of incremental updating association rule mining is to solve the prob- lem of the maintenance of the association rules, when transaction records are updated constantly and minimum support is changed in the online database. Given that many incremental update association rule mining algorithms have many problems, such as low efficiency and high computation cost, as well as dif- ficult maintenance of the association rules, we propose an efficient algorithm for incremental updating association mining based on inverted index tree. The algorithm effectively combines the inverted index and the tree structure, so that the data in the transaction database is updated constantly with time and the minimum support degree is changed continuously with the application environment. Frequent item sets are generated without scanning the original transaction database and without generating candidate i- tem sets. Experimental results show that the proposed algorithm can effectively solve the problem of in- cremental updating association rules with less memory space and higher efficiency.
出处 《计算机工程与科学》 CSCD 北大核心 2016年第5期1039-1045,共7页 Computer Engineering & Science
基金 广西自然科学基金(2014GXNSFAA118388) 广西高校科研项目(YB2014237) 广西混杂计算与集成电路设计重点实验室开放课题(2012HCIC03)
关键词 增量更新挖掘 倒排索引 倒排索引树 频繁项集 关联规则 incremental updating mining inverted index inverted index tree frequent item sets asso-ciation rules
  • 相关文献

参考文献1

共引文献226

同被引文献20

引证文献3

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部