The DOI matches its Crossref record; 45 of the 45 references it cites were found in a registry or an index.
A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks
Abstract
Our study concerns an important current problem, that of diffusion of information in social networks. This problem has received significant attention from the Internet research community in the recent times, driven by many potential applications such as viral marketing and sales promotions. In this paper, we focus on the target set selection problem, which involves discovering a small subset of influential players in a given social network, to perform a certain task of information diffusion. The target set selection problem manifests in two forms: 1) top-knodes problem and 2) λ -coverage problem. In the top-knodes problem, we are required to find a set ofkkey nodes that would maximize the number of nodes being influenced in the network. The λ-coverage problem is concerned with finding a set of key nodes having minimal size that can influence a given percentage λ of the nodes in the entire network. We propose a new way of solving these problems using the concept of Shapley value which is a well known solution concept in cooperative game theory. Our approach leads to algorithms which we call the ShaPley value-based Influential Nodes (SPINs) algorithms for solving the top-knodes problem and the λ -coverage problem. We compare the performance of the proposed SPIN algorithms with well known algorithms in the literature. Through extensive experimentation on four synthetically generated random graphs and six real-world data sets (Celegans, Jazz, NIPS coauthorship data set, Netscience data set, High-Energy Physics data set, and Political Books data set), we show that the proposed SPIN approach is more powerful and computationally efficient.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Granovetter, M. S. (1973) · American Journal of Sociology · doi:10.1086/225469 · Cited by 40,491
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
Centrality in social networks conceptual clarification
Freeman, L. C. (1978) · Social Networks · doi:10.1016/0378-8733(78)90021-7 · Cited by 17,062
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
Maximizing the spread of influence through a social network
Kempe, D., Kleinberg, J., & Tardos, É. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956769 · Cited by 7,326
Stanton, B. F., & Rogers, E. M. (1963) · Journal of Farm Economics · doi:10.2307/1235767 · Cited by 6,675
Bollobás, B. (1985) · Cited by 6,196
Threshold models of collective behavior
Granovetter, M. (1978) · American Journal of Sociology · doi:10.1086/226707 · Cited by 6,072
Finding community structure in networks using the eigenvectors of matrices
Newman, M. E. J. (2006) · Physical Review E · doi:10.1103/physreve.74.036104 · Cited by 4,761
The structure of scientific collaboration networks
Newman, M. E. J. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.98.2.404 · Cited by 4,482
Simulation modeling and analysis
(1999) · Journal of Manufacturing Systems · doi:10.1016/s0278-6125(99)90119-x · Cited by 3,833
Game theory: analysis of conflict
(1992) · Choice Reviews Online · doi:10.5860/choice.29-2753 · Cited by 3,325
Mining the network value of customers
Domingos, P., & Richardson, M. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502525 · Cited by 2,830
A simple model of global cascades on random networks
Watts, D. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.082090499 · Cited by 2,673
Cost-effective outbreak detection in networks
Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., & Glance, N. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281239 · Cited by 2,502
Efficient influence maximization in social networks
Chen, W., Wang, Y., & Yang, S. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557047 · Cited by 2,156
The dynamics of viral marketing
Leskovec, J., Adamic, L. A., & Huberman, B. A. (2007) · ACM Transactions on the Web · doi:10.1145/1232722.1232727 · Cited by 2,032
Micromotives and Macrobehavior.
Connolly, T., & Schelling, T. C. (1979) · Administrative Science Quarterly · doi:10.2307/2989930 · Cited by 2,009
Talk of the Network: A Complex Systems Look at the Underlying Process of Word-of-Mouth
Goldenberg, J., Libai, B., & Muller, E. (2001) · Marketing Letters · doi:10.1023/a:1011122126881 · Cited by 1,995
Mining knowledge-sharing sites for viral marketing
Richardson, M., & Domingos, P. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775057 · Cited by 1,612
Graphs and Cooperation in Games
Myerson, R. B. (1977) · Mathematics of Operations Research · doi:10.1287/moor.2.3.225 · Cited by 1,446
The diffusion of hybrid seed corn in two Iowa communities
Ryan, B. (1943) · Rural Sociology · Cited by 1,429
Six degrees: the science of a connected age
(2003) · Choice Reviews Online · doi:10.5860/choice.40-6452 · Cited by 1,362
Gilbert, E. N. (1959) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177706098 · Cited by 1,122
Ergodic Theorems for Weakly Interacting Infinite Systems and the Voter Model
Holley, R. A., & Liggett, T. M. (1975) · The Annals of Probability · doi:10.1214/aop/1176996306 · Cited by 1,109
Information diffusion through blogspace
Gruhl, D., Guha, R., Liben-Nowell, D., & Tomkins, A. (2004) · Proceedings of the 13th international conference on World Wide Web · doi:10.1145/988672.988739 · Cited by 1,041
GLEISER, P. M., & DANON, L. (2003) · Advances in Complex Systems · doi:10.1142/s0219525903001067 · Cited by 1,032
Influential Nodes in a Diffusion Model for Social Networks
Kempe, D., Kleinberg, J., & Tardos, É. (2005) · Lecture Notes in Computer Science · doi:10.1007/11523468_91 · Cited by 948
From the Cover: The structure of scientific collaboration networks
Newman, M. E. J. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.021544898 · Cited by 837
A measurement-driven analysis of information propagation in the flickr social network
Cha, M., Mislove, A., & Gummadi, K. P. (2009) · Proceedings of the 18th international conference on World wide web · doi:10.1145/1526709.1526806 · Cited by 768
The effect of network topology on the spread of epidemics
Ganesh, A., Massoulie, L., & Towsley, D. (2005) · Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. · doi:10.1109/infcom.2005.1498374 · Cited by 734
On the Complexity of Cooperative Solution Concepts
Deng, X., & Papadimitriou, C. H. (1994) · Mathematics of Operations Research · doi:10.1287/moor.19.2.257 · Cited by 629
Halting viruses in scale-free networks
Dezső, Z., & Barabási, A.-L. (2002) · Physical Review E · doi:10.1103/physreve.65.055103 · Cited by 583
Probability and Statistics with Reliability, Queueing and Computer Science Applications
Williams, T. (1983) · Journal of the Operational Research Society · doi:10.1057/jors.1983.197 · Cited by 527
Identifying the influential bloggers in a community
Agarwal, N., Liu, H., Tang, L., & Yu, P. S. (2008) · Proceedings of the international conference on Web search and web data mining - WSDM '08 · doi:10.1145/1341531.1341559 · Cited by 511
Small Worlds: The Dynamics of Networks between Order and Randomness
Roberts, J. M., & Watts, D. J. (2001) · Contemporary Sociology · doi:10.2307/2655441 · Cited by 491
Tractable Models for Information Diffusion in Social Networks
Kimura, M., & Saito, K. (2006) · Lecture Notes in Computer Science · doi:10.1007/11871637_27 · Cited by 444
Tracking Information Epidemics in Blogspace
Adar, E., & Adamic, L. A. (2005) · The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05) · doi:10.1109/wi.2005.151 · Cited by 408
Cascading Behavior in Networks: Algorithmic and Economic Issues
Kleinberg, J. (2007) · Algorithmic Game Theory · doi:10.1017/cbo9780511800481.026 · Cited by 279
On the submodularity of influence in social networks
Mossel, E., & Roch, S. (2007) · Proceedings of the thirty-ninth annual ACM symposium on Theory of computing · doi:10.1145/1250790.1250811 · Cited by 217
Contributions to the Theory of Games, Vol. II
Rubin, H., Kuhn, H. W., & Tucker, A. W. (1954) · Econometrica · doi:10.2307/1907552 · Cited by 152
Modeling the Spread of Influence on the Blogosphere
Java, A., Kolari, P., Finin, T., & Oates, T. (2006) · Maryland Shared Open Access Repository (USMAI Consortium) · doi:10.13016/m2rj48z9q · Cited by 144
Selecting the Most Influential Nodes in Social Networks
Estévez, P. A., Vera, P., & Saito, K. (2007) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2007.4371333 · Cited by 82
Cited by
Scalable Influence Maximization in Social Networks under the Linear Threshold Model
Chen, W., Yuan, Y., & Zhang, L. (2010) · 2010 IEEE International Conference on Data Mining · doi:10.1109/icdm.2010.118 · Cited by 924
Influence Maximization on Social Graphs: A Survey
Li, Y., Fan, J., Wang, Y., & Tan, K.-L. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2807843 · Cited by 659
Big Data and supply chain management: A review and bibliometric analysis
Mishra, D., Gunasekaran, A., Papadopoulos, T., & Childe, S. J. (2018) · Annals of Operations Research · doi:10.1007/s10479-016-2236-y · Cited by 382
Identifying Influential Nodes in Large-Scale Directed Networks: The Role of Clustering
Chen, D.-B., Gao, H., Lü, L., & Zhou, T. (2013) · PLoS ONE · doi:10.1371/journal.pone.0077455 · Cited by 364
Influence Maximization in Social Networks When Negative Opinions May Emerge and Propagate
Chen, W., Collins, A., Cummings, R., Ke, T., Liu, Z., Rincon, D., Sun, X., Wang, Y., Wei, W., & Yuan, Y. (2011) · Proceedings of the 2011 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972818.33 · Cited by 352
Metadata
- Authors
- Narayanam, R., & Narahari, Y.
- Venue
- IEEE Transactions on Automation Science and Engineering
- Published
- 2011-01
- Volume
- 8
- Issue
- 1
- Pages
- 130-147
- ISSN
- 1545-5955 (ISSN-L)
- OpenAlex
- W2065851162
- Cited by
- 382
- References
- 45
- FWCI
- 12.94
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.