Abstract
Among the numerous link prediction algorithms in complex networks, similarity-based algorithms play an important role due to promising accuracy and low computational complexity. Apart from the classical CN-based indexes, several interdisciplinary methods provide new ideas to this problem and achieve improvements in some aspects. In this article, we propose a new model from the perspective of an intermediary process and introduce indexes under the framework, which show better performance for precision. Combined with k-shell decomposition, our deeper analysis gives a reasonable explanation and presents an insight on classical and proposed algorithms, which can further contribute to the understanding of link prediction problem.
Sign-in/Register to access full text options 
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 callMore From: Physica A: Statistical Mechanics and its Applications
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.
