计算机工程与科学2011，Vol.33Issue(9)：105-108,4.DOI:10.3969/j.issn.1007-130X.2011.09.019
一种时态关联规则挖掘算法
An Efficient Mining Algorithm of Temporal Association Rules
摘要
Abstract
Temporal association rules mimng(TARM) is widely applied in many applications, it aims at mining rules within a certain interval of time. Most of the exiting algorithms for TARM need to scan several times of the database, or do not consider the different exhibition period of an individual item, so the efficiency of these algorithms are not enough. In this paper, we present a novel approach to investigating TARM, the proposed algorithm works in an incremental way which takes the different exhibition period of individual item into account, in order to reduce the cost of storage, and only the frequent 1-I-tem is stored, and efficient pruning techniques are adopted to reduce the scan times of the database, and it only needs at most one time to scan the whole data set to obtain all the temporal association rules. The experimental results show that the proposed algorithm is efficient.关键词
数据挖掘/关联规则/时态挖掘Key words
data mining association rules/ temporal mining分类
信息技术与安全科学引用本文复制引用
李广原,刘英华,刘永彬..一种时态关联规则挖掘算法[J].计算机工程与科学,2011,33(9):105-108,4.基金项目
国家自然科学基金资助项目(60875029) （60875029）
