Efficient Distributed Mining Algorithm for Alarm Correlation in Communication Networks
Xingming Li · 2009
This paper described the alarm correlation in communication networks based on data mining.A direct application of sequential algorithms to distributed databases is not effective,because it requires a large amount of communication overhead.An efficient algorithm-EDMA was proposed.It minimized the number of candidate sets and exchanged messages by local and global pruning.In local sites,it runs the application based on the improved algorithm-CMatrix,which is used to calculate local support counts.Our solution also reduced the size of average transactions and datasets that leads to reduction of scan time.The performance study shows that EDMA has superior running efficiency,lower communication cost and stronger scalability than direct application of a sequential algorithm in distributed databases.