Uncovering missing links with cold ends

Details Uncovering missing links with cold ends Uncovering missing links with cold ends

2011-04-03

arxiv.org/abs/1104.0395v2

Physics

Data Analysis, Statistics and Probability

16 pages, 5 figures, 6 tables

Scientific paper

To evaluate the performance of prediction of missing links, the known data are randomly divided into two parts, the training set and the probe set. We argue that this straightforward and standard method may lead to terrible bias, since in real biological and information networks, missing links are more likely to be links connecting low-degree nodes. We therefore study how to uncover missing links with low-degree nodes, namely links in the probe set are of lower degree products than a random sampling. Experimental analysis on ten local similarity indices and four disparate real networks reveals a surprising result that the Leicht-Holme-Newman index [E. A. Leicht, P. Holme, and M. E. J. Newman, Phys. Rev. E 73, 026120 (2006)] performs the best, although it was known to be one of the worst indices if the probe set is a random sampling of all links. We further propose an parameter-dependent index, which considerably improves the prediction accuracy. Finally, we show the relevance of the proposed index on three real sampling methods.

Affiliated with

Also associated with

No associations

Rating

Uncovering missing links with cold ends does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Uncovering missing links with cold ends, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Uncovering missing links with cold ends will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-131947