期刊文献+

基于加权关联模式的通信网告警相关性分析 被引量:3

Weighted Association-Pattern-Based for Alarm Correlation Analysis in Communication Network
在线阅读 下载PDF
导出
摘要 加权关联规则挖掘是告警相关性分析的重要手段。本文引入了比例加权支持度的概念,提出了一种基于加权关联模式树的加权关联模式挖掘算法。实验表明,本算法与MINWAL(O)算法相比,时间效率有了明显提高,节约了存储空间,告警相关性分析的准确性也得到了提高。 The mining of weighted association rules is a primary method used in alarm correlation analysis. In this paper, a new algorithm, weighted association pattern mining from weighted associated pattern tree is proposed, in which a new measure, ratio-weighted support, is developed. Experimental results demonstrate compared with MINWAL(O) algorithm, this algorithm has higher temporal etticiency and requires less memory. Also, the accuracy of alarm correlation analysis is improved.
出处 《电信科学》 北大核心 2007年第11期57-60,共4页 Telecommunications Science
基金 国家自然科学基金资助项目(No.60572091)
关键词 告警相关性分析 加权关联模式 比例加权支持度 加权关联模式树 alarm correlation analysis, weighted association pattern, ratio-weighted support, weighted associated pattern tree
  • 相关文献

参考文献9

二级参考文献16

  • 1欧阳继红,王仲佳,刘大有.具有动态加权特性的关联规则算法[J].吉林大学学报(理学版),2005,43(3):314-319. 被引量:16
  • 2王莲芬 许树柏.层次分析法引论[M].中国人民大学出版社,1989..
  • 3R Agrawal, R Srikant. Fast algorithms for mining association rules. In: Proc of 1994 Int'l Conf on Very Large Data Bases.Santiago, Chili: VLDB Endowment, 1994. 487--499.
  • 4J S Park, M S Chen, P S Yu. An effective Hash-based algorithm for mining association rules. In: Proc of 1995 ACM-SIGMOD Int'l Cord on Management of Data. San Jose, CA: ACM Press,1995. 175--186.
  • 5S Brin, R Motwani, C Silvemtein. Beyond market basket:Generalizing association rules to correlations. In: Proe of 1997 ACM-SIGMOD Int'l Conf on Management of Data. Tucson, AZ:ACM Press, 1997. 265--276.
  • 6R Agrawal, R Srikant. Mining sequential patterns. In: ICDE'95. Taipei, Taiwan: IEEE Computer Society Press, 1995. 3--14.
  • 7G Dong, J Li. Efficient mining of emerging patterns: Discovering trends and differences. In: Proc of the 5th ACM SIGKDD Int'l Conf on Knowledge Discovery and Data Mining. San Diego, CA:ACM Press, 1999. 43~52.
  • 8J Han, J Pei, Y Yin. Mining frequent patterns without candidate generation. In: Proe of 2000 ACM-SIGMOD Int'l Conf on Management of Data. Dallas, TX: ACM Press, 2000. 1--12.
  • 9Artur Bykowski, Christophe Rigotti. A eondemsed representation to find frequent patterns. In: Proe of the 20th ACM SIGACT-SIGMOD-SIGART Symp on Principles of Database Systems(PODS 2001). Santa Barbara, CA: ACM Press, 2001. 267~273.
  • 10范明 等.数据挖掘:概念与技术[M].北京:机械工业出版社,2001.8.

共引文献173

同被引文献21

引证文献3

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部