通信网告警关联规则的动态挖掘算法  

Novel algorithm for dynamic mining of association rules

作　　者：吴简[1] 李兴明[1] 

机构地区：[1]电子科技大学通信与信息工程学院,成都610054

出　　处：《计算机应用研究》2009年第4期1249-1252,共4页Application Research of Computers

基　　金：国家自然科学基金重大资助项目(60572091)

摘　　要：对基于数据挖掘的通信网告警相关性分析进行了研究。由于通信网络是动态变化的,用于动态网络资源和服务的自适应关联规则算法需要充分利用和维护原有规则来发现新规则,使网络结构与规则库都能快速更新,为此提出了新型的动态关联规则挖掘算法IDARM。理论分析与仿真实验都显示此算法性能优越、可扩展性好,并在一些特定情况下能显著提高效率。This paper described the alarm correlation in communication networks based on data mining. The self-adaptation association rules for dynamic network resource and service built new rules by fully utilizing and maintaining rules formed be- fore, then updated the framework easily and incorporated new discovered rules readily within it. Both theoretical analysis and computer simulations illustrate outstanding performance of the proposed algorithm--IDARM, which can be further optimized by experiments for specific environment.

关 键 词：网络差错管理 数据挖掘 动态关联规则 频繁项集 

分 类 号：TN91[电子电信—通信与信息系统]