作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2012, Vol. 38 ›› Issue (5): 50-52. doi: 10.3969/j.issn.1000-3428.2012.05.013

• 软件技术与数据库 • 上一篇    下一篇

基于时态约束的关联规则挖掘算法

张令杰,徐维祥   

  1. (北京交通大学交通运输学院,北京 100044)
  • 收稿日期:2011-08-30 出版日期:2012-03-05 发布日期:2012-03-05
  • 作者简介:张令杰(1985-),女,硕士研究生,主研方向:交通运输信息技术,数据挖掘;徐维祥,教授、博士生导师
  • 基金资助:
    北京市科委基金资助项目(Z090506006309011);轨道交通控制与安全国家重点实验室基金资助项目(RCS2009ZT007)

Association Rules Mining Algorithm Based on Temporal Constraint

ZHANG Ling-jie, XU Wei-xiang   

  1. (School of Traffic & Transportation, Beijing Jiaotong University, Beijing 100044, China)
  • Received:2011-08-30 Online:2012-03-05 Published:2012-03-05

摘要: 分析时态约束关联规则挖掘的TCAR算法,针对其在挖掘频繁时态项集时效率较低的问题,提出一种基于时态约束的关联规则挖掘算法。该算法对源数据库进行处理,缩减存储空间,并在更新挖掘最大频繁项集算法基础上,挖掘最大频繁时态项集。实例分析结果表明,该算法能提高整体挖掘效率。

关键词: 时态约束, 关联规则, TCAR算法, 时间阈值, 最大频繁时态项集, 候选项集

Abstract: This paper analyzes TCAR algorithm of temporal constraint. It is very inefficient on mining frequent temporal sets with this method. As to the disadvantage of this algorithm, a new method of mining temporal association is brought up. According to the new method, the original databases are dealt with to reduce the memory. On the basic of mining the most frequent items algorithm on the sequences of sets, the grouping terms for most frequent temporal sets are mined. Practical example analysis results show that the algorithm can improve the efficiency of mining.

Key words: temporal constraint, association rules, TCAR algorithm, time threshold, maximum frequent temporal sets, candidate sets

中图分类号: