研究了一种基于全置信度时间序列的电信事务间关联规则改进算法

Wenchuan Yang, Chao Dong, Jie Cheng, Fang Fang
{"title":"研究了一种基于全置信度时间序列的电信事务间关联规则改进算法","authors":"Wenchuan Yang, Chao Dong, Jie Cheng, Fang Fang","doi":"10.1109/ISIEA.2009.5356464","DOIUrl":null,"url":null,"abstract":"The telecommunication network has a large scale and an intense complexity. Agents distributed over diverse network elements have collected an immense number of KPI data, the key indicators of network performance. These time series data can have mutual impact. This paper puts forward an improved algorithm named AFP-Growth to mine association rules of inter-transaction time series in the telecommunication field. Based on improvements of the conventional FP-Growth algorithm without Conditional sub-tree Generation, this algorithm has introduced a new correlation measure, that is, all confidence, thus resolving the problems of null-transaction and negative correlation in mining telecommunication data. In addition, by utilizing the features of all confidence, this algorithm has improved the pruning rule of FP-Tree, and enhanced the effectiveness of FP-Tree search, thus increasing the time and space efficiency.","PeriodicalId":6447,"journal":{"name":"2009 IEEE Symposium on Industrial Electronics & Applications","volume":"48 1","pages":"192-196"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"The research into an improved algorithm of telecommunication inter-transactional association rules based on time series of all confidence\",\"authors\":\"Wenchuan Yang, Chao Dong, Jie Cheng, Fang Fang\",\"doi\":\"10.1109/ISIEA.2009.5356464\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The telecommunication network has a large scale and an intense complexity. Agents distributed over diverse network elements have collected an immense number of KPI data, the key indicators of network performance. These time series data can have mutual impact. This paper puts forward an improved algorithm named AFP-Growth to mine association rules of inter-transaction time series in the telecommunication field. Based on improvements of the conventional FP-Growth algorithm without Conditional sub-tree Generation, this algorithm has introduced a new correlation measure, that is, all confidence, thus resolving the problems of null-transaction and negative correlation in mining telecommunication data. In addition, by utilizing the features of all confidence, this algorithm has improved the pruning rule of FP-Tree, and enhanced the effectiveness of FP-Tree search, thus increasing the time and space efficiency.\",\"PeriodicalId\":6447,\"journal\":{\"name\":\"2009 IEEE Symposium on Industrial Electronics & Applications\",\"volume\":\"48 1\",\"pages\":\"192-196\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-12-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE Symposium on Industrial Electronics & Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIEA.2009.5356464\",\"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 IEEE Symposium on Industrial Electronics & Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIEA.2009.5356464","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

电信网络具有规模大、复杂性强的特点。分布在不同网络元素上的代理收集了大量的KPI数据,即网络性能的关键指标。这些时间序列数据可以相互影响。本文提出了一种改进的AFP-Growth算法来挖掘电信领域的交易间时间序列关联规则。该算法在改进传统的不生成条件子树的FP-Growth算法的基础上,引入了一种新的关联度量,即全置信度,从而解决了电信数据挖掘中的零交易和负相关问题。此外,该算法利用全置信度的特征,改进了FP-Tree的剪枝规则,提高了FP-Tree搜索的有效性,从而提高了时间和空间效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The research into an improved algorithm of telecommunication inter-transactional association rules based on time series of all confidence
The telecommunication network has a large scale and an intense complexity. Agents distributed over diverse network elements have collected an immense number of KPI data, the key indicators of network performance. These time series data can have mutual impact. This paper puts forward an improved algorithm named AFP-Growth to mine association rules of inter-transaction time series in the telecommunication field. Based on improvements of the conventional FP-Growth algorithm without Conditional sub-tree Generation, this algorithm has introduced a new correlation measure, that is, all confidence, thus resolving the problems of null-transaction and negative correlation in mining telecommunication data. In addition, by utilizing the features of all confidence, this algorithm has improved the pruning rule of FP-Tree, and enhanced the effectiveness of FP-Tree search, thus increasing the time and space efficiency.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信