Fast link prediction for large networks using spectral embedding

13Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Many link prediction algorithms require the computation of a similarity metric on each vertex pair, which is quadratic in the number of vertices and infeasible for large networks. We develop a class of link prediction algorithms based on a spectral embedding and the k closest pairs algorithm that are scalable to very large networks. We compare the prediction accuracy and runtime of these methods to existing algorithms on several large link prediction tasks. Our methods achieve comparable accuracy to standard algorithms but are significantly faster.

Cite

CITATION STYLE

APA

Pachev, B., & Webb, B. (2018). Fast link prediction for large networks using spectral embedding. Journal of Complex Networks, 6(1), 79–94. https://doi.org/10.1093/comnet/cnx021

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free