适合通信网的动态加权关联规则挖掘算法  

A Dynamic Association Rule Mining Algorithm in Communication Networks

作　　者：魏吉[1] 李兴明[1] 

机构地区：[1]电子科技大学宽带光纤传输与通信网技术教育部重点实验室,成都610054

出　　处：《微计算机信息》2008年第24期141-143,41,共4页Control & Automation

基　　金：国家自然科学基金资助项目―基于数据挖掘的告警相关性分析(No.60572091)归口管理部门:信息科学部

摘　　要：通信网告警相关性分析在网络故障管理中占据着重要的地位。加权关联规则挖掘是通信告警相关性分析采用的主要方法之一。然而,经典的关联规则挖掘算法在实际的网络环境中却暴露出适用性不足的缺点。本文提出了一种基于枚举树存储频繁集的关联规则挖掘算法,并结合网络动态特性与拓扑特征确定权值,最后在一个实际的网络中对该算法进行仿真,结果表明该算法具有巨大的优越性。The alarm correlation analysis in communication Networks plays an important role in the Network fault management. The mining of weighted association rules is one of the primary methods used in communication alarm correlation analysis. However, deficiency of classic association rule mining algorithm has exposed when it is put in reality in network alarm analysis. This paper proposes to use a novel data structure based on enumeration tree to handle＇massive alarms. It also makes the weight have a strong dynamic characteristic and an ability of adapting the changing of the Networks. In the last section, the simulation experiment has indicated the huge advantage of the algorithm.

关 键 词：网络故障管理 告警相关性 加权关联规则 增量更新 

分 类 号：TN915.07[电子电信—通信与信息系统]