计算机工程2012，Vol.38Issue(5)：50-52,3.
基于时态约束的关联规则挖掘算法
Association Rules Mining Algorithm Based on Temporal Constraint
摘要
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.关键词
时态约束/关联规则/TCAR算法/时间阈值/最大频繁时态项集/候选项集Key words
temporal constraint/association rules/TCAR algorithm/time threshold/maximum frequent temporal sets/candidate sets分类
信息技术与安全科学引用本文复制引用
张令杰,徐维祥..基于时态约束的关联规则挖掘算法[J].计算机工程,2012,38(5):50-52,3.基金项目
北京市科委基金资助项目(Z090506006309011) （Z090506006309011）
轨道交通控制与安全国家重点实验室基金资助项目(RCS2009ZT007) （RCS2009ZT007）
