Abstract

Link prediction is a hot issue in information filtering. Link prediction algorithms, based on local similarity indices, are widely used in many fields due to their high efficiency and high prediction accuracy. However, most existing link prediction algorithms are available for unweighted networks, and there are relatively few studies for weighted networks. In the previous studies on weighted networks, some scholars pointed out that links with small weights play a more important role in link prediction and emphasized that weak-ties theory has a significant impact on prediction accuracy. On this basis, we studied the edges with different weights, and we discovered that, for edges with large weights, this weak-ties theory actually does not work; Instead, the weak-ties theory works in the prediction of edges with small weights. Our discovery has instructive implications for link predictions in weighted networks.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.