title: Predicting missing links in complex networks based on common neighbors and distance.
abstract: The algorithms based on common neighbors metric to predict missing links in complex networks are very popular, but most of these algorithms do not account for missing links between nodes with no common neighbors. It is not accurate enough to reconstruct networks by using these methods in some cases especially when between nodes have less common neighbors. We proposed in this paper a new algorithm based on common neighbors and distance to improve accuracy of link prediction. Our proposed algorithm makes remarkable effect in predicting the missing links between nodes with no common neighbors and performs better than most existing currently used methods for a variety of real-world networks without increasing complexity.
authors.affiliation: School of Mathematical Science, MOE-LSC, SHL-MAC, Shanghai Jiao Tong University, 800 Dongchuan Road, Shanghai, 200240, P.R. China.
authors.forename: Jinxuan
authors.initials: J
authors.lastname: Yang
authors.affiliation: School of Mathematical Science, MOE-LSC, SHL-MAC, Shanghai Jiao Tong University, 800 Dongchuan Road, Shanghai, 200240, P.R. China.
authors.forename: Xiao-Dong
authors.initials: XD
authors.lastname: Zhang