Finding influencers in networks using social capital

Karthik Subbian, Dhruv Sharma, Zhen Wen, Jaideep Srivastava

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

The existing methods for finding influencers use the process of information diffusion to discover the nodes with the maximum expected information spread. These models capture only the process of information diffusion and not the actual social value of collaborations in the network. We have proposed a method for finding influencers based on the notion that people generate more value for their work by collaborating with peers of high influence. The social value generated through such collaborations denotes the individual social capital. We hypothesize and show that players with high individual social capital are often key influencers in the network. We propose a value-allocation model to compute the social capital and allocate the fair share of this capital to each individual involved in the collaboration. We show that our allocation satisfies several axioms of fairness and falls in the same class as the Myerson’s allocation function. We implement our allocation rule using an efficient algorithm SoCap and show that our algorithm outperforms the baselines in several real-life data sets. Specifically, in DBLP network, our algorithm outperforms PageRank, PMIA and Weighted Degree baselines up to 8 % in terms of precision, recall and $$F_1$$F1-measure.

Original languageEnglish
Article number219
Pages (from-to)1-13
Number of pages13
JournalSocial Network Analysis and Mining
Volume4
Issue number1
DOIs
Publication statusPublished - 1 Jan 2014
Externally publishedYes

Fingerprint

social capital
Values
fairness

ASJC Scopus subject areas

  • Computer Science Applications
  • Human-Computer Interaction
  • Information Systems
  • Communication
  • Media Technology

Cite this

Finding influencers in networks using social capital. / Subbian, Karthik; Sharma, Dhruv; Wen, Zhen; Srivastava, Jaideep.

In: Social Network Analysis and Mining, Vol. 4, No. 1, 219, 01.01.2014, p. 1-13.

Research output: Contribution to journalArticle

Subbian, Karthik ; Sharma, Dhruv ; Wen, Zhen ; Srivastava, Jaideep. / Finding influencers in networks using social capital. In: Social Network Analysis and Mining. 2014 ; Vol. 4, No. 1. pp. 1-13.
@article{de6d6f1c912e420796f6af4ae13cbd44,
title = "Finding influencers in networks using social capital",
abstract = "The existing methods for finding influencers use the process of information diffusion to discover the nodes with the maximum expected information spread. These models capture only the process of information diffusion and not the actual social value of collaborations in the network. We have proposed a method for finding influencers based on the notion that people generate more value for their work by collaborating with peers of high influence. The social value generated through such collaborations denotes the individual social capital. We hypothesize and show that players with high individual social capital are often key influencers in the network. We propose a value-allocation model to compute the social capital and allocate the fair share of this capital to each individual involved in the collaboration. We show that our allocation satisfies several axioms of fairness and falls in the same class as the Myerson’s allocation function. We implement our allocation rule using an efficient algorithm SoCap and show that our algorithm outperforms the baselines in several real-life data sets. Specifically, in DBLP network, our algorithm outperforms PageRank, PMIA and Weighted Degree baselines up to 8 {\%} in terms of precision, recall and $$F_1$$F1-measure.",
author = "Karthik Subbian and Dhruv Sharma and Zhen Wen and Jaideep Srivastava",
year = "2014",
month = "1",
day = "1",
doi = "10.1007/s13278-014-0219-z",
language = "English",
volume = "4",
pages = "1--13",
journal = "Social Network Analysis and Mining",
issn = "1869-5450",
publisher = "Springer Wien",
number = "1",

}

TY - JOUR

T1 - Finding influencers in networks using social capital

AU - Subbian, Karthik

AU - Sharma, Dhruv

AU - Wen, Zhen

AU - Srivastava, Jaideep

PY - 2014/1/1

Y1 - 2014/1/1

N2 - The existing methods for finding influencers use the process of information diffusion to discover the nodes with the maximum expected information spread. These models capture only the process of information diffusion and not the actual social value of collaborations in the network. We have proposed a method for finding influencers based on the notion that people generate more value for their work by collaborating with peers of high influence. The social value generated through such collaborations denotes the individual social capital. We hypothesize and show that players with high individual social capital are often key influencers in the network. We propose a value-allocation model to compute the social capital and allocate the fair share of this capital to each individual involved in the collaboration. We show that our allocation satisfies several axioms of fairness and falls in the same class as the Myerson’s allocation function. We implement our allocation rule using an efficient algorithm SoCap and show that our algorithm outperforms the baselines in several real-life data sets. Specifically, in DBLP network, our algorithm outperforms PageRank, PMIA and Weighted Degree baselines up to 8 % in terms of precision, recall and $$F_1$$F1-measure.

AB - The existing methods for finding influencers use the process of information diffusion to discover the nodes with the maximum expected information spread. These models capture only the process of information diffusion and not the actual social value of collaborations in the network. We have proposed a method for finding influencers based on the notion that people generate more value for their work by collaborating with peers of high influence. The social value generated through such collaborations denotes the individual social capital. We hypothesize and show that players with high individual social capital are often key influencers in the network. We propose a value-allocation model to compute the social capital and allocate the fair share of this capital to each individual involved in the collaboration. We show that our allocation satisfies several axioms of fairness and falls in the same class as the Myerson’s allocation function. We implement our allocation rule using an efficient algorithm SoCap and show that our algorithm outperforms the baselines in several real-life data sets. Specifically, in DBLP network, our algorithm outperforms PageRank, PMIA and Weighted Degree baselines up to 8 % in terms of precision, recall and $$F_1$$F1-measure.

UR - http://www.scopus.com/inward/record.url?scp=84947245222&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84947245222&partnerID=8YFLogxK

U2 - 10.1007/s13278-014-0219-z

DO - 10.1007/s13278-014-0219-z

M3 - Article

AN - SCOPUS:84947245222

VL - 4

SP - 1

EP - 13

JO - Social Network Analysis and Mining

JF - Social Network Analysis and Mining

SN - 1869-5450

IS - 1

M1 - 219

ER -