计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (35): 168-170.DOI: 10.3778/j.issn.1002-8331.2008.35.050

• 数据库、信号与信息处理 • 上一篇    下一篇

一种事务互补挖掘算法的研究及应用

刘雨露,方 刚   

  1. 重庆三峡学院 数学与计算机科学学院,重庆 404000
  • 收稿日期:2008-08-27 修回日期:2008-11-03 出版日期:2008-12-11 发布日期:2008-12-11
  • 通讯作者: 刘雨露

Research and application of transaction complement mining algorithm

LIU Yu-lu,FANG Gang   

  1. College of Math & Computer Science,University of Chongqing Three Gorges,Chongqing 404000,China
  • Received:2008-08-27 Revised:2008-11-03 Online:2008-12-11 Published:2008-12-11
  • Contact: LIU Yu-lu

摘要: 提出一种事务互补的挖掘算法,其适合挖掘任何长度的频繁项目集。该算法用事务互补搜索策略产生候选项,使用频繁项目集修剪其子集和非频繁项目集修剪其超集策略减少候选项;在计算支持数时使用了二进制的逻辑运算和事务特性,提高了算法的效率。将其应用到横向空间关联规则挖掘中,实验表明该算法是快速而有效的。

关键词: 数据挖掘, 关联规则, 二进制, 互补挖掘, 空间关联

Abstract: An algorithm of transaction complement mining is presented,which uses transaction complement search strategy to generate candidate-items,the number of which is reduced by pruning subsets of frequent item sets and superset of non-frequent item sets,and further uses binary logic operation and transaction character to count support,its efficiency is improved.The algorithm is used to extract transverse spatial association rules,and its experiment indicates that the efficiency is fast and efficient.

Key words: data mining, association rules, binary, complement mining, spatial association