Currently those algorithms to mine the alarm association rules are limited to the minimal support, so that they can only obtain the association rules among the frequently occurring alarm events, furthermore, the rules couldn't be visual display. This paper provides a novel mining alarm correlation visualization algorithm based on the non-linear reduced-feature mapping. The algorithm firstly projects the alarms on multidimensional space according to co-occurrence strength of the alarms, and then reduces the dimensions of the space, finally provides the relationship of the alarms to user with visualization. Experimental results based on synthetic and real datasets demonstrated that this algorithm not only discovered correlation among alarms, but also acquired the fault in the telecommunications network based on the graph transformation.
[1]
Tomasz Imielinski,et al.
Mining association rules between sets of items in large databases
,
1993,
SIGMOD Conference.
[2]
Liu Yunhui,et al.
Study on the Low-Dimensional Embedding and the Embedding Dimensionality of Manifold of High-Dimensional Data
,
2005
.
[3]
Edward Omiecinski,et al.
Alternative Interest Measures for Mining Associations in Databases
,
2003,
IEEE Trans. Knowl. Data Eng..
[4]
J. Tenenbaum,et al.
A global geometric framework for nonlinear dimensionality reduction.
,
2000,
Science.
[5]
Guo Jun.
A Mining Algorithm with Alarm Association Rules Based on Statistical Correlation
,
2007
.