Link prediction via a neighborhood-based nonnegative matrix factorization model

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Link prediction is an important issue to understand the dynamics and evolution mechanisms of complex networks. Traditional link prediction algorithms are based on the topological properties of the underlying network in terms of graph theory. In order to improve the accuracy of link prediction, recent researches increasingly focus on modeling the link behaviors from the latent structure information of the networks. In this paper, we propose a neighborhood-based nonnegative matrix factorization model to solve the problem of link prediction. Our model learns latent feature factors from the overall topological structure combing with local neighborhood structures of the underlying network. Extensive experiments on real-world networks demonstrate the effectiveness and efficiency of our proposed model.

Cite

CITATION STYLE

APA

Zhao, Y., Li, S., Zhao, C., & Jiang, W. (2015). Link prediction via a neighborhood-based nonnegative matrix factorization model. In Lecture Notes in Electrical Engineering (Vol. 322, pp. 603–611). Springer Verlag. https://doi.org/10.1007/978-3-319-08991-1_62

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