Effective and Efficient Similarity Index for Link Prediction of Complex Networks

Physics – Data Analysis – Statistics and Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

8 pages, 5 figures, 3 tables

Scientific paper

10.1103/PhysRevE.80.046122

Predictions of missing links of incomplete networks like protein-protein interaction networks or very likely but not yet existent links in evolutionary networks like friendship networks in web society can be considered as a guideline for further experiments or valuable information for web users. In this paper, we introduce a local path index to estimate the likelihood of the existence of a link between two nodes. We propose a network model with controllable density and noise strength in generating links, as well as collect data of six real networks. Extensive numerical simulations on both modeled networks and real networks demonstrated the high effectiveness and efficiency of the local path index compared with two well-known and widely used indices, the common neighbors and the Katz index. Indeed, the local path index provides competitively accurate predictions as the Katz index while requires much less CPU time and memory space, which is therefore a strong candidate for potential practical applications in data mining of huge-size networks.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Effective and Efficient Similarity Index for Link Prediction of Complex Networks 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 Effective and Efficient Similarity Index for Link Prediction of Complex Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Effective and Efficient Similarity Index for Link Prediction of Complex Networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-324761

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.