| 基于压缩矩阵的通信网告警关联规则挖掘算法 |
| |
| 引用本文： | 朱振华,李兴明. 基于压缩矩阵的通信网告警关联规则挖掘算法[J]. 计算机应用研究, 2008, 25(2): 342-344 |
| |
| 作者姓名： | 朱振华 李兴明 |
| |
| 作者单位： | 电子科技大学,宽带光纤传输与通信网技术教育部重点实验室,成都,610054;电子科技大学,宽带光纤传输与通信网技术教育部重点实验室,成都,610054 |
| |
| 摘 要： | 提出了一种基于压缩矩阵运算的电信告警关联规则挖掘算法.它解决了apriori等算法需多次扫描数据库的问题,通过扫描告警事务库并进行压缩变换得到压缩告警关联矩阵,对关联矩阵进行运算得到告警间的关联规则.仿真实验证明,该算法与apriori等算法相比,时间效率有了明显提高,同时有效节约了存储空间.
|
| 关 键 词： | 故障管理 关联规则 数据挖掘 |
| 文章编号： | 1001-3695（2008）02-0342-03 |
| 收稿时间： | 2006-12-20 |
| 修稿时间： | 2007-03-02 |
Algorithm of mining alarm association rules based on compressed matrix in communication networks |
| |
| ZHU Zhen hu,LI Xing ming. Algorithm of mining alarm association rules based on compressed matrix in communication networks[J]. Application Research of Computers, 2008, 25(2): 342-344 |
| |
| Authors: | ZHU Zhen hu LI Xing ming |
| |
| Affiliation: | (Key Laboratory of Broadband Optic Fiber Transmission & Communication Systems, University of Electronic Science & Technology of China, Chengdu 610054, China) |
| |
| Abstract: | 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. |
| |
| Keywords: | fault management association rules data mining |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用研究》浏览原始摘要信息 |
|
点击此处可从《计算机应用研究》下载全文 |
|
