首页> 外文会议>Symposium on Industrial Electronics Applications >The Research into an Improved Algorithm of Telecommunication Inter-transactional Association Rules Based on Time Series of All Confidence
【24h】

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.
机译:电信网络具有大规模和强烈的复杂性。分布在各种网络元素的代理已收集巨大的KPI数据,网络性能的关键指标。这些时间序列数据可以具有相互影响。本文提出了一种名为AFP-Crans的改进算法,以挖掘电信领域交易交际时间序列的关联规则。基于传统FP-生长算法的改进,没有条件的子树生成,该算法引入了一种新的相关性度量,即所有信心,从而解决挖掘电信数据中的空交易和负相关问题。此外,通过利用所有信心的特征,该算法提高了FP树的修剪规则,增强了FP树搜索的有效性,从而增加了时间和空间效率。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号