一种新的关联规则动态挖掘算法

Wu Jian, L. Ming
{"title":"一种新的关联规则动态挖掘算法","authors":"Wu Jian, L. Ming","doi":"10.1109/WKDD.2008.32","DOIUrl":null,"url":null,"abstract":"Nowadays, communication network turns to be more complex, once there occurs a failure, there will result in multi-alarm-events which require relevant transactions. This paper describes the alarm correlation in communication networks based on data mining. The association rules from self-adaptation for dynamic network resource and service that build new rule by fully utilizing and maintaining rules formed before while transactions grow/delete or minimum support changes which enables the framework is easily updated and new discovery methods be readily incorporated within it. Both theoretical analysis and computer simulations illustrate outstanding performance of the proposed models, which can be further optimized by experiments for specific environment.","PeriodicalId":101656,"journal":{"name":"First International Workshop on Knowledge Discovery and Data Mining (WKDD 2008)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"A Novel Algorithm for Dynamic Mining of Association Rules\",\"authors\":\"Wu Jian, L. Ming\",\"doi\":\"10.1109/WKDD.2008.32\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Nowadays, communication network turns to be more complex, once there occurs a failure, there will result in multi-alarm-events which require relevant transactions. This paper describes the alarm correlation in communication networks based on data mining. The association rules from self-adaptation for dynamic network resource and service that build new rule by fully utilizing and maintaining rules formed before while transactions grow/delete or minimum support changes which enables the framework is easily updated and new discovery methods be readily incorporated within it. Both theoretical analysis and computer simulations illustrate outstanding performance of the proposed models, which can be further optimized by experiments for specific environment.\",\"PeriodicalId\":101656,\"journal\":{\"name\":\"First International Workshop on Knowledge Discovery and Data Mining (WKDD 2008)\",\"volume\":\"52 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-01-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"First International Workshop on Knowledge Discovery and Data Mining (WKDD 2008)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WKDD.2008.32\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"First International Workshop on Knowledge Discovery and Data Mining (WKDD 2008)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WKDD.2008.32","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

如今,通信网络变得越来越复杂,一旦发生故障,就会产生多个报警事件,需要进行相关的处理。本文描述了基于数据挖掘的通信网络报警关联。动态网络资源和服务的自适应关联规则,在事务增长/删除或最小支持变化时,充分利用和维护之前形成的规则来构建新的规则,使框架易于更新,并易于在其中加入新的发现方法。理论分析和计算机仿真结果表明,所提模型具有良好的性能,并可通过实验进一步优化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Novel Algorithm for Dynamic Mining of Association Rules
Nowadays, communication network turns to be more complex, once there occurs a failure, there will result in multi-alarm-events which require relevant transactions. This paper describes the alarm correlation in communication networks based on data mining. The association rules from self-adaptation for dynamic network resource and service that build new rule by fully utilizing and maintaining rules formed before while transactions grow/delete or minimum support changes which enables the framework is easily updated and new discovery methods be readily incorporated within it. Both theoretical analysis and computer simulations illustrate outstanding performance of the proposed models, which can be further optimized by experiments for specific environment.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信