电信科学 ›› 2015, Vol. 31 ›› Issue (11): 85-90.doi: 10.11959/j.issn.1000-0801.2015230

• 研究与开发 • 上一篇    下一篇

基于位运算和倒排索引的关联规则挖掘算法

黄玉蕾1,罗晓霞2,林青1   

  1. 1 西安培华学院中兴电信学院 西安 710125
    2 西安科技大学计算机科学与技术学院 西安 710054
  • 出版日期:2015-11-20 发布日期:2015-12-14
  • 基金资助:
    陕西省教育厅科学研究基金项目资助项目;国家自然科学基金资助项目;西安培华学院教育教学改革研究项目

An Association Rule Mining Scheme Based on Bit Operation and Reverse Index

Yulei Huang1,Xiaoxia Luo2,Qing Lin1   

  1. 1 ZTE Telecommunications College,Xi'an Peihua University,Xi'an 710125,China
    2 School of Computer Science and Technology,Xi'an University of Science and Technology,Xi'an 710054,China
  • Online:2015-11-20 Published:2015-12-14
  • Supported by:
    Scientific Research Fund Project from Education Department of Shaanxi;The National Natural Science Foundation of China;Educational Teaching Reform Research Project from Xi'an Peihua University

在线阅读

3

PDF下载

595

摘要：

提出了一种改进的Apriori关联规则挖掘算法，称为Apriori-BR。该算法首先通过扫描两次数据库建立各个频繁项目集到事务的倒排索引，并对倒排索引按照事务长度进行分组，然后在挖掘过程中，利用位运算加快子集的检测，并在必要时动态删除无效的低维事务。实验结果表明，相比于经典的Apriori算法和已有文献中的改进算法，本文所提的Apriori-BR算法显著提高了挖掘效率。

关键词: Apriori算法, 位运算, 倒排索引

Abstract:

An improved Apriori algorithm for association rule mining called Apriori-BR was proposed,which was based on bit operation and reverse index.Specifically,the reverse index from frequent itemsets to transactions was constructed firstly by scanning twice of database,and the reverse index was grouped by the length of transactions.Then in the mining process,bit operation was adopted to accelerate subset detection together with the dynamical elimination of invalid low-dimensional transactions.The numerical results show that the Apriori-BR proposed can substantially improve mining efficiency when compared with the conventional Apriori algorithm and the improved ones in the literature.

Key words: Apriori algorithm, bit operation, reverse index

No Suggested Reading articles found!