On the Troll-Trust Model for Edge Sign Prediction in Social Networks

Abstract : In the problem of edge sign prediction, we are given a directed graph (representing a social network), and our task is to predict the binary labels of the edges (i.e., the positive or negative nature of the social relationships). Many successful heuristics for this problem are based on the troll-trust features, estimating at each node the fraction of outgoing and incoming positive/negative edges. We show that these heuristics can be understood, and rigorously analyzed, as approximators to the Bayes optimal classifier for a simple proba-bilistic model of the edge labels. We then show that the maximum likelihood estimator for this model approximately corresponds to the predictions of a Label Propagation algorithm run on a transformed version of the original social graph. Extensive experiments on a number of real-world datasets show that this algorithm is competitive against state-of-the-art classifiers in terms of both accuracy and scalability. Finally, we show that troll-trust features can also be used to derive online learning algorithms which have theoretical guarantees even when edges are adversarially labeled.
Type de document :
[Research Report] INRIA Lille. 2016
Liste complète des métadonnées

Contributeur : Team Magnet <>
Soumis le : mardi 3 janvier 2017 - 13:25:29
Dernière modification le : mardi 3 juillet 2018 - 11:45:43
Document(s) archivé(s) le : mardi 4 avril 2017 - 13:20:35


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01425137, version 1
  • ARXIV : 1606.00182


Géraud Le Falher, Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale. On the Troll-Trust Model for Edge Sign Prediction in Social Networks. [Research Report] INRIA Lille. 2016. 〈hal-01425137〉



Consultations de la notice


Téléchargements de fichiers