基于谱图理论的报警关联算法

Qianfang Xu, Jun Guo
{"title":"基于谱图理论的报警关联算法","authors":"Qianfang Xu, Jun Guo","doi":"10.1109/JCAI.2009.187","DOIUrl":null,"url":null,"abstract":"currently those algorithms to mine the alarm association rules are limited to the minimal support, so that they can only obtain the association rules among the frequently occurring alarms. This paper proposes a new mining algorithm based on spectral graph theory. The algorithms firstly sets up alarm association model with time series; Secondly, it regards alarms database as a high-dimensional structure and treats alarms with associated characteristics as part of it. The algorithm discovers the underlying mapping low-dimensional structure embedding in high-dimensional space based on spectral graph theory. Experimental results based on synthetic and real datasets demonstrates that this algorithm not only discoveries association among alarms, but also acquires the fault in the telecommunications network based on the spectral graph transformation.","PeriodicalId":154425,"journal":{"name":"2009 International Joint Conference on Artificial Intelligence","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Alarm Association Algorithms Based on Spectral Graph Theory\",\"authors\":\"Qianfang Xu, Jun Guo\",\"doi\":\"10.1109/JCAI.2009.187\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"currently those algorithms to mine the alarm association rules are limited to the minimal support, so that they can only obtain the association rules among the frequently occurring alarms. This paper proposes a new mining algorithm based on spectral graph theory. The algorithms firstly sets up alarm association model with time series; Secondly, it regards alarms database as a high-dimensional structure and treats alarms with associated characteristics as part of it. The algorithm discovers the underlying mapping low-dimensional structure embedding in high-dimensional space based on spectral graph theory. Experimental results based on synthetic and real datasets demonstrates that this algorithm not only discoveries association among alarms, but also acquires the fault in the telecommunications network based on the spectral graph transformation.\",\"PeriodicalId\":154425,\"journal\":{\"name\":\"2009 International Joint Conference on Artificial Intelligence\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-04-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Joint Conference on Artificial Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/JCAI.2009.187\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Joint Conference on Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/JCAI.2009.187","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

目前用于告警关联规则挖掘的算法受限于最小支持,只能获得频繁发生的告警之间的关联规则。本文提出了一种新的基于谱图理论的挖掘算法。该算法首先建立了与时间序列的报警关联模型;其次,将告警数据库视为一个高维结构,将具有相关特征的告警作为数据库的一部分;该算法基于谱图理论发现嵌入在高维空间中的底层映射低维结构。基于合成数据集和真实数据集的实验结果表明,该算法不仅可以发现告警之间的关联,而且可以基于谱图变换获得电信网络中的故障。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Alarm Association Algorithms Based on Spectral Graph Theory
currently those algorithms to mine the alarm association rules are limited to the minimal support, so that they can only obtain the association rules among the frequently occurring alarms. This paper proposes a new mining algorithm based on spectral graph theory. The algorithms firstly sets up alarm association model with time series; Secondly, it regards alarms database as a high-dimensional structure and treats alarms with associated characteristics as part of it. The algorithm discovers the underlying mapping low-dimensional structure embedding in high-dimensional space based on spectral graph theory. Experimental results based on synthetic and real datasets demonstrates that this algorithm not only discoveries association among alarms, but also acquires the fault in the telecommunications network based on the spectral graph transformation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信