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

DOI10.1007/S10994-019-05792-4MaRDI QIDQ2320535zbMATH OpenOpenAlexWikidataFDO

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

Publication date 23 August 2019

Published in Machine Learning (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1407.2515

zbMATH Keywords

large networkslearning to ranklink predictionsocial network analysissupervised learning

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Statistical ranking and selection procedures (62F07) Learning and adaptive systems in artificial intelligence (68T05) Social networks; opinion dynamics (91D30)

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.

Recommendations

• Learning to rank based link prediction algorithm in social networks
• Learning to rank in vector spaces and social networks
• Learning to Rank in Vector Spaces and Social Networks
• Joint latent space models for ranking data and social network
• Learning to rank on graphs
• Link prediction based on feature representation and fusion

Cites work

• 10.1162/1532443041827916
• Empirical Analysis of an Evolving Social Network
• Local community identification in social networks
• Predicting missing links via local information
• Scikit-learn: machine learning in Python
• Social choice and individual values

Cited in

(6)

• Discovering missing \texttt{me} edges across social networks
• Actively learning to infer social ties
• Learning to rank based link prediction algorithm in social networks
• RankMerging
• PNR: how to optimally combine different link prediction approaches?
• A combined multi-criteria risk decision and rank aggregation approach with multiple risk factors with an application to greenhouse gas emission risk assessment of sectors

Describes a project that uses

Uses Software

• Scikit
• LinkBoost

This page was built for publication: RankMerging: a supervised learning-to-rank framework to predict links in large social networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2320535)