RankMerging: a supervised learning-to-rank framework to predict links in large social networks

Lionel Tabourier, Daniel F. Bernardes, Anne Sophie Libert, Renaud Lambiotte

Résultats de recherche: Contribution à un journal/une revueArticleRevue par des pairs

2 Téléchargements (Pure)

Résumé

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 methods of ranking as well as standard supervised combination strategies. We also describe various properties of RankMerging, such as its computational complexity, its robustness to feature selection and parameter estimation and discuss its area of relevance: the prediction of an adjustable number of links on large networks.

langue originaleAnglais
Pages (de - à)1729-1756
Nombre de pages28
journalMachine Learning
Volume108
Numéro de publication10
Les DOIs
Etat de la publicationPublié - 14 oct. 2019

Empreinte digitale

Examiner les sujets de recherche de « RankMerging: a supervised learning-to-rank framework to predict links in large social networks ». Ensemble, ils forment une empreinte digitale unique.

Contient cette citation