电信科学 ›› 2014, Vol. 30 ›› Issue (10): 110-115.doi: 10.3969/j.issn.1000-0801.2014.10.017

• 研究与开发 • 上一篇    下一篇

基于综合相关置信度的告警关联规则挖掘

高会生,李英敏   

  1. 华北电力大学电子与通信工程系 保定 071000
  • 出版日期:2014-10-15 发布日期:2017-06-29
  • 基金资助:
    中央高校基本科研业务费专项资金资助项目

Mining Alarm Association Rules Based on Comprehensive Related Confidence

Huisheng Gao,Yingmin Li   

  1. Department of Electronic and Communication Engineering of North China Electric Power University, Baoding 071000, China
  • Online:2014-10-15 Published:2017-06-29

摘要:

采用置信度融合算法计算相邻告警的综合相关置信度,并根据计算结果形成告警关联事务,增强告警事务内告警之间的相关性,降低对支持度的选择要求,有效挖掘出“低支持度-置信度”告警关联规则。利用h-置信度理论筛选有意义的告警关联规则,并通过实验比较了传统方法和本文方法的执行效率和挖掘正确率。

关键词: 告警关联规则, 综合相关置信度, h-置信度

Abstract:

The traditional association rules mining algorithms preferred to applying single sliding time window, and the mined alarm association rules were high support-high confidence. To solve this problem, a method was proposed to calculate comprehensive related confidence between the time adjacent items by the confidence fusion algorithm. Then generated alarm transactions were generated based on the calculated results, which enhanced alarm correlation within a transaction. The proposed approach can reduce the choice of support requirement and mine low support-high confidence association rules effectively. Based on h-confidence theory, interesting alarm association rules were screened. Experimental results showed the feasibility and effectiveness of this approach.

Key words: alarm association rule, comprehensive related confidence, h-confidence theory

No Suggested Reading articles found!