Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Predicting missing links via significant paths (1402.6225v3)

Published 25 Feb 2014 in physics.soc-ph, cs.SI, and physics.data-an

Abstract: Link prediction plays an important role in understanding intrinsic evolving mechanisms of networks. With the belief that the likelihood of the existence of a link between two nodes is strongly related with their similarity, many methods have been proposed to calculate node similarity based on node attributes and/or topological structures. Among a large variety of methods that take into account paths connecting the target pair of nodes, most of which neglect the heterogeneity of those paths. Our hypothesis is that a path consisting of small-degree nodes provides a strong evidence of similarity between two ends, accordingly, we propose a so-called sig- nificant path index in this Letter to leverage intermediate nodes' degrees in similarity calculation. Empirical experiments on twelve disparate real networks demonstrate that the proposed index outperforms the mainstream link prediction baselines.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Xuzhen Zhu (6 papers)
  2. Hui Tian (167 papers)
  3. Shimin Cai (13 papers)
  4. Tao Zhou (398 papers)
Citations (27)

Summary

We haven't generated a summary for this paper yet.