NDLI: Iterated endorsement deduction and ranking

Content Provider	Springer Nature Link
Author	Pérez Rosés, Hebert Sebé, Francesc
Copyright Year	2016
Abstract	Some social networks, such as LinkedIn and ResearchGate, allow user endorsements for specific skills. From the number and quality of the endorsements received, an authority score can be assigned to each profile. In Pérez-Rosés et al (Proceedings of INNOV 2015: the fourth international conference on communications, computation, networks and technologies, Barcelona, pp. 68–73. http://www.thinkmind.org/index.php?view=instance&instance=INNOV+2015 , 2015; Comput Commun 73:200–210. http://dx.doi.org/10.1016/j.comcom.2015.08.018 , 2016), an authority score computation method was proposed, which takes into account the relations existing among different skills. The method described in Pérez-Rosés et al (Proceedings of INNOV 2015: the fourth international conference on communications, computation, networks and technologies, Barcelona, pp 68–73. http://www.thinkmind.org/index.php?view=instance&instance=INNOV+2015 , 2015; Comput Commun 73:200–210. http://dx.doi.org/10.1016/j.comcom.2015.08.018 , 2016) is based on enriching the digraph of endorsements corresponding to a specific skill, and then applying a ranking method suitable for weighted digraphs, such as PageRank. In this paper we take the method of Pérez-Rosés et al (Proceedings of INNOV 2015: the fourth international conference on communications, computation, networks and technologies, Barcelona, pp 68–73. http://www.thinkmind.org/index.php?view=instance&instance=INNOV+2015 , 2015; Comput Commun 73:200–210. http://dx.doi.org/10.1016/j.comcom.2015.08.018 , 2016) to the limit, by successive application of the enrichment step, and we study the mathematical properties of the endorsement digraphs resulting from that process. In particular, we prove that the endorsements converge to some values between 0 and 1, and they reach the value 1 only in some specific circumstances. This allows the use of the limit values as input to the ranking algorithm.
Ending Page	446
Page Count	16
Starting Page	431
File Format	PDF
ISSN	0010485X
e-ISSN	14365057
Journal	Computing
Issue Number	5
Volume Number	99
Language	English
Publisher	Springer Vienna
Publisher Date	2016-09-07
Publisher Place	Vienna
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Information Systems Applications (incl.Internet) Signed and weighted graphs ResearchGate PageRank Ranking and selection Internet topics Social networks LinkedIn Expertise retrieval Software Engineering Point estimation Measures of association (correlation, canonical correlation, etc.) Computer Application in Administrative Data Processing Computer Science Artificial Intelligence (incl. Robotics) Directed graphs (digraphs), tournaments Graphs and linear algebra (matrices, eigenvalues, etc.) Computer Communication Networks
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Computational Theory and Mathematics Computational Mathematics Numerical Analysis Computer Science Applications Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Eigenvalues of some classes of signed complete graphs

Generalized competition index of primitive digraphs

The S2NS Digraphs and the Cycle Linear System of a Digraph

The k-point exponent set of primitive digraphs with girth 2

Zero forcing in iterated line digraphs

Walk-Sums, Continued Fractions and Unique Factorisation on Digraphs

Homomorphically Full Oriented Graphs

Rock, Paper, Scissors, Etc -- Topics in the Theory of Regular Tournaments

On irreversible spread of influence in edge-weighted graphs

Iterated endorsement deduction and ranking

Similar Documents

Eigenvalues of some classes of signed complete graphs

Generalized competition index of primitive digraphs

The S2NS Digraphs and the Cycle Linear System of a Digraph

The k-point exponent set of primitive digraphs with girth 2

Zero forcing in iterated line digraphs

Walk-Sums, Continued Fractions and Unique Factorisation on Digraphs

Homomorphically Full Oriented Graphs

Rock, Paper, Scissors, Etc -- Topics in the Theory of Regular Tournaments

On irreversible spread of influence in edge-weighted graphs

Iterated endorsement deduction and ranking