Predicting recent links in FOAF networks

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

Abstract

For social networks, prediction of new links or edges can be important for many reasons, in particular for understanding future network growth. Recent work has shown that graph vertex similarity measures are good at predicting graph link formation for the near future, but are less effective in predicting further out. This could imply that recent links can be more important than older links in link prediction. To see if this is indeed the case, we apply a new relation strength similarity (RSS) measure on a coauthorship network constructed from a subset of the CiteSeer X dataset to study the power of recency. We choose RSS because it is one of the few similarity measures designed for weighted networks and easily models FOAF networks. By assigning different weights to the links according to authors coauthoring history, we show that recency is helpful in predicting the formation of new links. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Chen, H. H., Gou, L., Zhang, X., & Giles, C. L. (2012). Predicting recent links in FOAF networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7227 LNCS, pp. 156–163). https://doi.org/10.1007/978-3-642-29047-3_19

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