Link Prediction in Complex Network via Penalizing Noncontribution Relations of Endpoints

Xuzhen Zhu, Yang Tian and Hui Tian

Mathematical Problems in Engineering, 2014, vol. 2014, 1-8

Abstract:

Similarity based link prediction algorithms become the focus in complex network research. Although endpoint degree as source of influence diffusion plays an important role in link prediction, some noncontribution links, also called noncontribution relations, involved in the endpoint degree serve nothing to the similarity between the two nonadjacent endpoints. In this paper, we propose a novel link prediction algorithm to penalize those endpoints’ degrees including many null links in influence diffusion, namely, noncontribution relations penalization algorithm, briefly called NRP. Seven mainstream baselines are introduced for comparison on nine benchmark datasets, and numerical analysis shows great improvement of accuracy performance, measured by the Area Under roc Curve (AUC). At last, we simply discuss the complexity of our algorithm.

Date: 2014
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2014/453546.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2014/453546.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:453546

DOI: 10.1155/2014/453546

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().