Playing the role of weak clique property in link prediction: A friend recommendation model

Abstract

An important fact in studying the link prediction is that the structural properties of networks have significant impacts on the performance of algorithms. Therefore, how to improve the performance of link prediction with the aid of structural properties of networks is an essential problem. By analyzing many real networks, we find a common structure property: nodes are preferentially linked to the nodes with the weak clique structure (abbreviated as PWCS to simplify descriptions). Based on this PWCS phenomenon, we propose a local friend recommendation (FR) index to facilitate link prediction. Our experiments show that the performance of FR index is generally better than some famous local similarity indices, such as Common Neighbor (CN) index, Adamic-Adar (AA) index and Resource Allocation (RA) index. We then explain why PWCS can give rise to the better performance of FR index in link prediction. Finally, a mixed friend recommendation index (labelled MFR) is proposed by utilizing the PWCS phenomenon, which further improves the accuracy of link prediction.

7 figures, 4 tables

References in corpus (9)

• Hierarchical structure and the prediction of missing links in networks
• Predicting Missing Links via Local Information
• Community Structure in Jazz
• Missing and spurious interactions and the reconstruction of complex networks
• Effective and Efficient Similarity Index for Link Prediction of Complex Networks
• Learning Latent Block Structure in Weighted Networks
• Predicting missing links and their weights via reliable-route-based method
• Predicting link directions via a recursive subgraph-based ranking
• Local degree blocking model for link prediction in complex networks

Cited by in corpus (2)

• Experimental analyses on 2-hop-based and 3-hop-based link prediction algorithms
• Improving link prediction in complex networks by adaptively exploiting multiple structural features of networks