Endorsement deduction and ranking in social networks
MetadataShow full item record
Some social networks, such as LinkedIn and ResearchGate, allow user endorsements for specific skills. In this way, for each skill we get a directed graph where the nodes correspond to users’ profiles and the arcs represent endorsement relations. From the number and quality of the endorsements received,
an authority score can be assigned to each profile. In this paper we propose an authority score computation method that takes into account the relations existing among different skills. Our method is based on enriching the information contained in the digraph of endorsements corresponding to a specific skill, and then applying a ranking method admitting weighted digraphs, such as PageRank. We describe the method, and test it on a synthetic network of 1493 nodes, fitted with endorsements.
Is part ofComputer Communications, 2016, vol. 73, núm. B, p. 200-210
The following license files are associated with this item:
Except where otherwise noted, this item's license is described as cc-by-nc-nd (c) H. Pérez-Rosés et al., 2016
Showing items related by title, author, creator and subject.
Pérez Rosés, Hebert; Sebé Feixas, Francesc (Palgrave Macmillan, 2014)In many simulation studies involving networks there is the need to rely on a sample network to perform the simulation experiments. In many cases, real network data is not available due to privacy concerns. In that case we ...
López Lorenzo, Ignacio; Pérez Rosés, Hebert; Pujolàs Boix, Jordi; Zdimalovà, Maria (Elsevier B.V., 2016-09-27)The Degree/Diameter Problem is an extremal problem in graph theory with applications in network design. One of the main research areas in the Degree/Diameter Problem consists of finding large graphs whose order approach ...
Brankovic, Ljiljana; López Lorenzo, Ignacio; Miller, Mirka; Sebé Feixas, Francesc (Society of Mathematicians, Physicists and Astronomers of SloveniaInstitute of Mathematics, Physics, and MechanicsUniversity of Primorska (Slovenia), 2014-06-27)In order to protect privacy of social network participants, network graph data should be anonymised prior to its release. Most proposals in the literature aim to achieve $k$-anonymity under specific assumptions about the ...