[1] 邓歆, 孟洛明. 基于贝叶斯网络的通信网告警相关性和故障诊断模型[J]. 电子与信息学报, 2007, 29(5): 1162-1186. Deng Xin, Meng Luoming. Bayesian networks based alarm correlation and fault diagnosis in communication networks[J]. Journal of Electronics and Information Technology, 2007, 29(5): 1162-1186.
[2] Agrawal R, Imielinski T, Swami A. Mining association rules between sets of items in large databases//SIGMOD’93. Washington D C: , 1993: 207-216.
[3] Wei Fan, Kun Zhang, Hong Cheng, et al. Direct mining of discriminative and essential graphical and itemset features via model-based search tree// KDD’08. Las Vegas: , 2008: 596-610.
[4] Ding Bolin, Lo D, Han Jiawei, et al. Efficient mining of closed repetitive gapped subsequences from a sequence database// ICDE’09. Shanghai: , 2009: 1024-1035.
[5] 徐前方, 肖波, 郭军. 一种基于相关度统计的告警关联规则挖掘算法[J]. 北京邮电大学学报, 2007, 30(1): 66-70. Xu Qianfang, Xiao Bo, Guo Jun. A mining algorithm with alarm association rules based on statistical correlation[J]. Journal of Beijing University of Posts and Telecommunications, 2007, 30(1): 66-70.
[6] Huang Yaochun, Xiong Hui, Wu Weiling, et al. Mining maximal hyperclique pattern: a hybrid search strategy[J]. Information Sciences, 2007, 177(3): 703-721.
[7] 肖波, 徐前方, 郭军. 可信关联规则及其基于极大团的挖掘算法[J]. 软件学报, 2008, 19(10): 2597-2610. Xiao Bo, Xu Qianfang, Guo Jun. Credible association rule and its mining algorithm based on maximum clique[J]. Journal of Software, 2008, 19(10): 2597-2610. |