Weighted One Mode Projection of a Bipartite Graph as a Local Similarity Measure

Author(s):  
Rotem Stram ◽  
Pascal Reuss ◽  
Klaus-Dieter Althoff
Author(s):  
M. Jahari ◽  
S. Khairunniza-Bejo ◽  
A. R. M. Shariff ◽  
H. Z. M. Shafri ◽  
H. Ibrahim

2012 ◽  
Vol 588-589 ◽  
pp. 364-367
Author(s):  
Tao Wang ◽  
Heng Zhou ◽  
Pan Zou

A power network partitioning model based on the weighed local similarity measure is presented in this paper considering the regional decoupling characteristics of reactive power. A weighted graph model of reactive power network is established and a new measurement of local similarity based on weighed graph is defined. To utilize our measurement of similarity to partition reactive power network, a partitioning algorithm based on generalized ward hierarchical clustering method is proposed. The algorithm can ensure balance of the reactive power inside partition. Applying the proposed algorithm to IEEE 39-bus system, the results show that the proposed algorithm is feasible and effective.


Author(s):  
Martin Kochan ◽  
Marc Modat ◽  
Tom Vercauteren ◽  
Mark White ◽  
Laura Mancini ◽  
...  

2009 ◽  
Vol 25 (5-7) ◽  
pp. 499-508 ◽  
Author(s):  
Shuangyuan Wu ◽  
Shihong Xia ◽  
Zhaoqi Wang ◽  
Chunpeng Li

2021 ◽  
Author(s):  
Amin Rezaeipanah

Abstract Online social networks are an integral element of modern societies and significantly influence the formation and consolidation of social relationships. In fact, these networks are multi-layered so that there may be multiple links between a user’ on different social networks. In this paper, the link prediction problem for the same user in a two-layer social network is examined, where we consider Twitter and Foursquare networks. Here, information related to the two-layer communication is used to predict links in the Foursquare network. Link prediction aims to discover spurious links or predict the emergence of future links from the current network structure. There are many algorithms for link prediction in unweighted networks, however only a few have been developed for weighted networks. Based on the extraction of topological features from the network structure and the use of reliable paths between users, we developed a novel similarity measure for link prediction. Reliable paths have been proposed to develop unweight local similarity measures to weighted measures. Using these measures, both the existence of links and their weight can be predicted. Empirical analysis shows that the proposed similarity measure achieves superior performance to existing approaches and can more accurately predict future relationships. In addition, the proposed method has better results compared to single-layer networks. Experiments show that the proposed similarity measure has an advantage precision of 1.8% over the Katz and FriendLink measures.


Sign in / Sign up

Export Citation Format

Share Document