基于灰色Markov模型动态关联规则的元规则挖掘  

Research of mining meta-association rules for dynamic association rule based on model of Grey-Markov

作　　者：刘俊[1] 谢彦峰[1] 张忠林[1] 贾利敏[1] 

机构地区：[1]兰州交通大学电子与信息工程学院,兰州730070

出　　处：《计算机应用》2008年第9期2353-2356,共4页journal of Computer Applications

摘　　要：介绍了增加了支持度向量和置信度向量两种规则评价指标的动态关联规则,给出了一种基于灰色M arkov模型的预测和分析动态关联规则的元规则的方法。此方法在建立灰色模型的基础上应用M arkov链理论,实验证明利用此方法挖掘的元规则要优于灰色模型等其他方法。A rule called a dynamic association rule was introduced, which contained not only a support value and a confidence value but also a support vector and a confidence vector, and the usual mining process of the meta-association Rules for dynamic association rule by the model of Grey-Markov was introduced. This method applies the Markov theory in the foundation of G（ 1. 1） model, and proved that this method is superior to G（ 1. 1） and other methods in mining the metaassociation rules.

关 键 词：动态关联规则 元规则 灰色模型 Markov连 预测 

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