RankMerging: A supervised learning-to-rank framework to predict links in large social network release_7tqivpxjmbfvtew5r63wm3kj4u

by Lionel Tabourier, Daniel Faria Bernardes, Anne-Sophie Libert, Renaud Lambiotte

Released as a article .

2015  

Abstract

Uncovering unknown or missing links in social networks is a difficult task because of their sparsity and because links may represent different types of relationships, characterized by different structural patterns. In this paper, we define a simple yet efficient supervised learning-to-rank framework, called RankMerging, which aims at combining information provided by various unsupervised rankings. We illustrate our method on three different kinds of social networks and show that it substantially improves the performances of unsupervised metrics of ranking. We also compare it to other combination strategies based on standard methods. Finally, we explore various aspects of RankMerging, such as feature selection and parameter estimation and discuss its area of relevance: the prediction of an adjustable number of links on large networks.
In text/plain format

Archived Files and Locations

application/pdf  1.1 MB
file_ohix63ap2vdw7bzdnvbhaaojeq
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2015-03-14
Version   v3
Language   en ?
arXiv  1407.2515v3
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 61691a16-dab2-4679-97f8-647afe53fb2d
API URL: JSON