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

Association Rules Mining Algorithm Based on Temporal Constraint

作　　者：张令杰[1] 徐维祥[1] 

机构地区：[1]北京交通大学交通运输学院,北京100044

出　　处：《计算机工程》2012年第5期50-52,共3页Computer Engineering

基　　金：北京市科委基金资助项目(Z090506006309011);轨道交通控制与安全国家重点实验室基金资助项目(RCS2009ZT007)

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

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

分 类 号：TP391[自动化与计算机技术—计算机应用技术]