Abstract
In many complex networked systems such as online social networks, at any given time, activity originates at certain nodes and subsequently spreads on the network through influence. Under such scenarios, influencer mining does not involve explicit seeding as in the case of viral marketing. Being an influencer necessitates creating content and disseminating the same to active followers who can then spread the same on the network. In this work, we present a simple probabilistic formulation that models such self-evolving systems where information diffusion occurs primarily because of the intrinsic activity of users and the spread of activity occurs due to influence. We provide an algorithm to mine for the influential seeds in such a scenario by modifying the well-known influence maximization framework with the independent cascade diffusion model. A small example is provided to illustrate how the incorporation of intrinsic and influenced activation mechanisms help us better model the influence dynamics in social networks. Following that, for a larger dataset, we compare the lists of influential users identified by the given formulation with a computationally efficient centrality metric derived from a linear probabilistic model that incorporates self activation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Adamic, L.A., Glance, N.: The political blogosphere and the 2004 us election: divided they blog. In: Proceedings of the 3rd International Workshop on Link Discovery, pp. 36–43. ACM (2005)
Chen, W., Collins, A., Cummings, R., Ke, T., Liu, Z., Rincon, D., Sun, X., Wang, Y., Wei, W., Yuan, Y.: Influence maximization in social networks when negative opinions may emerge and propagate. In: SIAM Data Mining, pp. 379–390 (2011)
Farajtabar, M., Du, N., Gomez-Rodriguez, M., Valera, I., Zha, H., Song, L.: Shaping social activity by incentivizing users. In: Advances in Neural Information Processing Systems, pp. 2474–2482 (2014)
Friedkin, N.E., Johnsen, E.C.: Social influence networks and opinion change. Ad. Group Proces. 16(1), 1–29 (1999)
Gionis, A., Terzi, E., Tsaparas, P.: Opinion maximization in social networks. In: SIAM Data Mining Conference, pp. 387–395. SIAM (2013)
Halappanavar, M., Sathanur, A., Nandi, A.: Accelerating the mining of influential nodes in complex networks through community detection. In: Proceedings of the 13th ACM International Conference on Computing Frontiers, CF 2016, Como, Italy, May 16–18, 2016
Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of ACM SIGKDD, pp. 137–146. ACM, New York (2003)
Kempe, D., Kleinberg, J., Tardos, É.: Influential nodes in a diffusion model for social networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1127–1138. Springer, Heidelberg (2005). doi:10.1007/11523468_91
Krause, A., Golovin, D.: Submodular function maximization. Tractability Pract. Approaches Hard Probl. 3(19), 8 (2012)
Lancichinetti, A., Fortunato, S.: Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys. Rev. E 80(1), 016118 (2009)
Li, Y., Chen, W., Wang, Y., Zhang, Z.L.: Influence diffusion dynamics and influence maximization in social networks with friend and foe relationships. In: Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, pp. 657–666. ACM (2013)
Myers, S.A., Zhu, C., Leskovec, J.: Information diffusion and external influence in networks. In: ACM SIGKDD, pp. 33–41. ACM (2012)
Sathanur, A.V., Jandhyala, V., Xing, C.: Physense: Scalable sociological interaction models for influence estimation on online social networks. In: IEEE International Conference on Intelligence and Security Informatics, pp. 358–363. IEEE (2013)
Srivastava, A., Chelmis, C., Prasanna, V.K.: Influence in social networks: A unified model? In: 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 451–454. IEEE (2014)
Webber, W., Moffat, A., Zobel, J.: A similarity measure for indefinite rankings. ACM Trans. Inf. Syst. (TOIS) 28(4), 20 (2010)
Acknowledgement
This research was supported by the High Performance Data Analytics program at the Pacific Northwest National Laboratory (PNNL). PNNL is a multi- program national laboratory operated by Battelle Memorial Institute for the US Department of Energy under DE-AC06-76RLO1830.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Sathanur, A.V., Halappanavar, M. (2016). Influence Maximization on Complex Networks with Intrinsic Nodal Activation. In: Spiro, E., Ahn, YY. (eds) Social Informatics. SocInfo 2016. Lecture Notes in Computer Science(), vol 10047. Springer, Cham. https://doi.org/10.1007/978-3-319-47874-6_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-47874-6_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-47873-9
Online ISBN: 978-3-319-47874-6
eBook Packages: Computer ScienceComputer Science (R0)