Algorithm of mining alarm association rules based on compressed matrix in communication networks
基于压缩矩阵的通信网告警关联规则挖掘算法

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.