Sampling-based link prediction in complex networks

MaRDI QIDQ5371549zbMATH OpenFDO

Authors Caiyan Dai, Ling Chen, Bin Li, Bo-Lun Chen

Publication date 20 October 2017

zbMATH Keywords

complex networksfault tolerant thresholdlink predictionrandom walksimilarity errorsub-graph

Mathematics Subject Classification ID

Random walks on graphs (05C81) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Stochastic network models in operations research (90B15)

Recommendations

• Sampling-based algorithm for link prediction in temporal networks
• Relative-path-based algorithm for link prediction on complex networks using a basic similarity factor
• Predicting missing links via local information
• Sampling from complex networks with high community structures
• Link prediction via controlling the leading eigenvector

Cited in

(10)

• Predicting unobserved links in incompletely observed networks
• Link prediction in complex network via penalizing noncontribution relations of endpoints
• Sampling-based algorithm for link prediction in temporal networks
• Sampling from complex networks with high community structures
• Performance of local information-based link prediction: a sampling perspective
• Unbiased sampling of network ensembles
• scientific article; zbMATH DE number 5524713 (Why is no real title available?)
• Nonparametric link prediction in large scale dynamic networks
• Relative-path-based algorithm for link prediction on complex networks using a basic similarity factor
• Accurate similarity index based on activity and connectivity of node for link prediction

This page was built for publication: Sampling-based link prediction in complex networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5371549)