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

Lionel Tabourier (1) , Daniel F Bernardes (2) , Anne-Sophie Libert (3) , Renaud Lambiotte (4)

1 ComplexNetworks
2 L2TI - Laboratoire de Traitement et Transport de l'Information
3 NaXys - Namur Center for Complex Systems [Namur]
4 MI - Mathematical Institute [Oxford]

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.

Mots clés: link prediction; supervised learning; learning to rank; social networks; complex networks; large graphs

Domaines: Informatique [cs]; Intelligence artificielle [cs.AI]; Réseaux sociaux et d'information [cs.SI]

Lionel Tabourier, Daniel F Bernardes, Anne-Sophie Libert, Renaud Lambiotte. RankMerging: A supervised learning-to-rank framework to predict links in large social networks. Machine Learning, 2019, 108 (10), pp.1729-1756. ⟨10.1007/s10994-019-05792-4⟩. ⟨hal-04462323⟩