[1] 徐前方, 肖波, 郭军. 一种基于相关度统计的告警关联规则挖掘算法[J]. 北京邮电大学学报, 2007, 29(1): 63-66. 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, 29(1): 63-66. [2] Zaki M J. Efficiently mining frequent trees in a forest: algorithms and application[J]. IEEE Trans on Knowledge and Data Engineering, 2005, 17(8): 1021-1035. [3] Chi Yun, Yang Yirong, Xia Yi, et al. CMTreeminer: mining both closed and maximal frequent subtrees// PAKDD04. Sydney: , 2004: 63-73. [4] Termier A, Rousset M C, Sebag M, et al. DryadeParent: an efficient and robust closed attribute tree mining algorithm[J]. IEEE Trans on Knowledge and Data Engineering, 2008, 20(3): 300-320. [5] Chi Yun, Wang Haixun, Yu P S, et al. Moment: maintaining closed frequent itemsets over a stream sliding window//ICDM04. Brighton: , 2004: 59-66. [6] 李国徽, 陈辉. 挖掘数据流任意滑动时间窗口内频繁模式[J]. 软件学报, 2008, 19(10): 2585-2596. Li Guohui, Chen Hui. Mining the frequent patterns in an arbitrary sliding window over online data streams[J]. Journal of Software, 2008, 19(10): 2585-2596. [7] Leung C K S, Khan Q I. DSTree: a tree structure for the mining of frequent sets from data streams// ICDM06. Hong Kong: , 2006: 928-932. [8] Hwang J H, Gu M S. Finding frequent structures in XML stream data// CSA 2009. Jeju: , 2009: 3-8. [9] Bifet A, Gavalda R. Mining adaptively frequent closed unlabeled rooted trees in data streams// KDD 2008. Las Vegas: , 2008: 34-42. [10] Chalmers R, Almeroth K. Modeling the branching characteristics and efficiency gains of global multicast trees// IEEE INFOCOM 2001. Anchorage:, 2001: 449-458. [11] Han Jiawei, Kamber M. Data mining concepts and techniques[M]. 2nd ed. San Francisco: Morgan Kaufmann, 2006. |