一种面向布尔时间序列的关联规则挖掘算法  

Algorithm of mining association rules for Binary time series

作　　者：闫明月[1] 侯忠生[1] 高颖[2] 

机构地区：[1]北京交通大学电子信息工程学院,北京100044 [2]北京中医药大学东直门医院,北京100700

出　　处：《控制与决策》2012年第10期1447-1451,1458,共6页Control and Decision

基　　金：国家重大基础研究计划项目(2003CB517102)

摘　　要：布尔时间序列中的关联规则挖掘较难处理,因为多数关联规则仅挖掘不同事务共同出现的规则,难以体现同一事件在不同时间内动态变化间的关联性.鉴于此,提出一种新的关联规则挖掘框架,利用常量化表示布尔数据的时间属性,结合聚类算法和关联分析,提高规则的支持度,从而解决布尔时间序列数据在关联规则挖掘中的时间值表示问题,并使用多种指标评价规则与传统算法比较.在真实的中风病预后好转数据预测中验证了所提出算法的有效性.Association analysis for Binary time series is a difficult problem, because most of association rules lay emphasis on the relation among the items, but ignore the temporal correlation in the transaction database. Therefore, a new improved algorithm of mining association rules for Binary time series is presented to make use of both the relationship among the items and the temporality of association. By using the proposed algorithm, the Binary data is converted to common numerical value for representing the time-value implicitly, then clustering algorithm is combined with the association analysis, which improves the supports of most association rules. Several indicators are used to evaluate the results from the proposed algorithm. The experimental results on the prognosis dataset of stroke show the effectiveness of the proposed method.

关 键 词：布尔时间序列 关联规则 聚类 预后 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]