基于压缩矩阵的通信网告警关联规则挖掘算法  

Algorithm of mining alarm association rules based on compressed matrix in communication networks

作　　者：朱振华[1] 李兴明[1] 

机构地区：[1]电子科技大学宽带光纤传输与通信网技术教育部重点实验室,成都610054

出　　处：《计算机应用研究》2008年第2期342-344,共3页Application Research of Computers

基　　金：国家自然科学基金资助项目(60572091)

摘　　要：提出了一种基于压缩矩阵运算的电信告警关联规则挖掘算法。它解决了apriori等算法需多次扫描数据库的问题,通过扫描告警事务库并进行压缩变换得到压缩告警关联矩阵,对关联矩阵进行运算得到告警间的关联规则。仿真实验证明,该算法与apriori等算法相比,时间效率有了明显提高,同时有效节约了存储空间。This paper introduced an algorithm of mining association rules based on compressed matrix. Compared with the apriori and other apriori-based algorithms, which visiting database for many times, the algorithm visited database only once. By scanning the database and applying a compression technique at the same time, the algorithm converted the alarm database into compressed matrix, and then calculated the matrix to get the association rules. The performance testing of the algorithm indicates that compared with apriori algorithm, this one need less memory and has higher temporal efficiency.

关 键 词：故障管理 关联规则 数据挖掘 

分 类 号：TN915.07[电子电信—通信与信息系统]