Abstract
The problem of finding the influencers in social networks has been traditionally dealt in an optimization setting by finding the top-k nodes that has the maximum information spread in the network. These methods aim to find the influencers in a network through the process of information diffusion. However, none of these approaches model the individual social value generated by collaborations in these networks. Such social value is often the real motivation for which the nodes connect to each other. In this work, we propose a framework to compute this network social value using the concept of social capital, namely the amount of bonding and bridging connections in the network. We first compute the social capital value of the network and then allocate this network value to the nodes of the network. We establish the fairness of our allocation using several axioms of fairness. Our experiments on the real data sets show that the computed social capital is an excellent proxy for finding influencers and our approach outperforms several popular baselines.
Original language | English (US) |
---|---|
Title of host publication | 12th International Conference on Autonomous Agents and Multiagent Systems 2013, AAMAS 2013 |
Publisher | International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS) |
Pages | 1243-1244 |
Number of pages | 2 |
Volume | 2 |
State | Published - Jan 1 2013 |
Event | 12th International Conference on Autonomous Agents and Multiagent Systems 2013, AAMAS 2013 - Saint Paul, MN, United States Duration: May 6 2013 → May 10 2013 |
Other
Other | 12th International Conference on Autonomous Agents and Multiagent Systems 2013, AAMAS 2013 |
---|---|
Country/Territory | United States |
City | Saint Paul, MN |
Period | 5/6/13 → 5/10/13 |
Keywords
- Collaborative Networks
- Influencer Mining
- Information Diffusion
- Social Capital