The server is under maintenance between 08:00 to 12:00 (GMT+08:00), and please visit later.
We apologize for any inconvenience caused
Login  | Sign Up  |  Oriprobe Inc. Feed
China/Asia On Demand
Journal Articles
Laws/Policies/Regulations
Companies/Products
Clustering for directed network using affinity propagation
Author(s): 
Pages: 1950-1952,1957
Year: Issue:  7
Journal: Application Research of Computers

Keyword:  network clusteringdirected networkaffinity propagationSimRank;
Abstract: Most of the current clustering algorithms are designed only for undirected networks. The few existing algorithms for directed networks are designed based on traditional clustering methods which have some drawbacks. For these problems, this paper proposed a clustering method for directed networks using affinity propagation. Firstly, it calculated the SimRank simila-rities between the pairs of nodes in the given directed network. Then it converted the similarities into the equivalent negative value. Finally, it partitioned the networks into clusters using the famous and outstanding affinity propagation algorithm taking the calculated similarity matrix as input. The experimental results demonstrate that the performance of the proposed algorithm is superior to the state-of-art methods.
Related Articles
loading...