Abstract
Most of the existing work done in the area of influence maximization (IM) in online social networks (OSNs) aims at the development of an algorithm for identification of seed set or the development of an information diffusion model for spread maximization. IM finds major application in the field of viral marketing, wherein an organization wants to maximize the spread of information about its product/service. Multiple OSNs might be available for initiating the diffusion process. The organization would then want to select an OSN that would lead to highest spread. However, no work exists that helps in assessing which OSN, from amongst the available set of OSNs, can be expected to achieve a higher influence spread. Seeking an answer to this problem, a method for identifying, which OSN shall achieve a higher spread, has been proposed in this paper. The proposed method explores the correlation between self-similar behaviour of user activity in an OSN and the expected influence spread for that OSN. Analogous to real-world human behaviour, which displays self-similarity, behaviour of users in an OSN can also be assumed to display self-similarity. The results achieved for the proposed work display a positive correlation between self-similarity in user activity in an OSN and the influence spread expected to be achieved in that OSN. Based on the findings, an algorithm has been proposed, which can be used to select which OSN, from amongst a set of OSNs, can be expected to achieve higher influence spread. Additionally, a two-step Hurst exponent (H)-based approach has also been proposed for IM, which makes use of the overall global H value for the OSN and local H value for each node in the OSN to ensure maximum influence spread.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Agarwal S, Mehta S (2018) Social influence maximization using genetic algorithm with dynamic probabilities. In: 11th international conference on contemporary computing (IC3). https://doi.org/10.1109/IC3.2018.8530626
Alshahrani M, Fuxi Z, Sameh A, Mekouar S, Huang S (2018) Top-K influential users selection based on combined katz centrality and propagation probability. In: IEEE 3rd international conference on cloud computing and big data analysis (ICCCBDA), pp 52–56. https://doi.org/10.1109/icccbda.2018.8386486
Bucur D, Iacca G (2016) Influence maximization in social networks with genetic algorithms. Lecture notes in computer science, vol 9597. Springer, Cham, pp 379–392. https://doi.org/10.1007/978-3-319-31204-0_25
Chen Y, Ying J (2013) Modeling community influence in social networks with Markov chains. In: 2013 international conference on cloud computing and big data. https://doi.org/10.1109/CLOUDCOM-ASIA.2013.77
Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: 15th ACM SIGKDD international conference on knowledge discovery and data mining (KDD ’09), pp 199-208. https://doi.org/10.1145/1557019.1557047
Definition of influence by Merriam Webster. https://www.merriam-webster.com/dictionary/influence. Accessed 22 June 2019
Deng X, Pan Y, Wu Y, Gui J (2015) Credit distribution and influence maximization in online social networks using node features. In: 12th international conference on fuzzy systems and knowledge discovery (FSKD), pp 2093–2100. https://doi.org/10.1109/FSKD.2015.7382274
Domingos P, Richardson M (2001) Mining the network value of customers. In: 7th ACM SIGKDD international conference on Knowledge discovery and data mining—KDD ’01, pp 57–66. https://doi.org/10.1145/502512.502525
Emami N, Mozafari N, Hamzeh A (2018) Continuous state online influence maximization in social network. Soc Netw Anal Min 8:32. https://doi.org/10.1007/s13278-018-0510-5
Fan C, Guo JL, Zha YL (2012) Fractal analysis on human behaviors dynamics. Phys A 391(2012):6617–6625. https://doi.org/10.1016/j.physa.2012.06.063
Jianqiang Z, Xiaolin G, Feng T (2017) A new method of identifying influential users in the micro-blog networks. IEEE Access 5:3008–3015. https://doi.org/10.1109/ACCESS.2017.2672680
Kempe D, Kleinberg J, Tardos É (2003) Maximizing the spread of influence through a social network. In: 9th ACM SIGKDD international conference on knowledge discovery and data mining, KDD ’03, pp 137–146. https://doi.org/10.1145/956750.956769
Kunegis J, Sekulla M, Heinz H, Dünker D (2017) Linux kernel mailing list replies network. http://konect.uni-koblenz.de/networks/lkml-reply [dataset]
Kurka DB, Godoy A, Von Zuben FJ (2016) Online social network analysis: a survey of research applications in computer science. arXiv preprint arXiv:1504.05655v2
Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, Glance N (2007) Cost-effective outbreak detection in networks. In: 13th ACM SIGKDD international conference on knowledge discovery and data mining (KDD’07), pp 420–429. https://doi.org/10.1145/1281192.1281239
Li K, Zhang L, Huang H (2018) Social influence analysis: models, methods, and evaluation. Engineering 4(1):40–46. https://doi.org/10.1016/j.eng.2018.02.004
Liu Q, Zhao X, Willinger W, Wang X, Zhao BY, Zheng H (2016) Self-similarity in social network dynamics. ACM Trans Model Perform Eval Comput Syst 2(1):1–26. https://doi.org/10.1145/2994142
Liu D, Jing Y, Zhao J, Wang W, Song G (2017) A fast and efficient algorithm for mining top-k nodes in complex networks. OPEN Sci Rep Nat Publ Gr 7:43330. https://doi.org/10.1038/srep43330
Lyudmyla K, Vitalii B, Tamara R (2017) Fractal time series analysis of social network activities. In: 4th international scientific-practical conference problems of infocommunications. Science and Technology (PIC S&T). https://doi.org/10.1109/INFOCOMMST.2017.8246438
Page L, Brin S, Motwani R, Winograd T (1998) The PageRank citation ranking: bringing order to the web. Technical Report. Stanford InfoLab
Paranjape A, Benson AR, Leskovec J (2017a) Math overflow temporal network. http://snap.stanford.edu/data/sx-mathoverflow.html [dataset]
Paranjape A, Benson AR, Leskovec J (2017b) Ask Ubuntu temporal network. http://snap.stanford.edu/data/sx-askubuntu.html [dataset]
Paranjape A, Benson AR, Leskovec J (2017c) Super user temporal network. http://snap.stanford.edu/data/sx-superuser.html [dataset]
Peng S, Wang G, Xie D (2017) Social influence analysis in social networking big data: opportunities and challenges. IEEE Netw 31(1):11–17. https://doi.org/10.1109/mnet.2016.1500104nm
Rescaled range from Wikipedia. https://en.wikipedia.org/wiki/Rescaled_range. Accessed 29 June 2019
Riquelme F, Gonzalez-Cantergiani P, Molinero X, Serna M (2018) Centrality measure in social networks based on linear threshold model. Knowl-Based Syst 140:92–102. https://doi.org/10.1016/j.knosys.2017.10.029
Saxena B, Kumar P (2019) A node activity and connectivity-based model for influence maximization in social networks. Soc Netw Anal Min 9:40. https://doi.org/10.1007/s13278-019-0586-6
Saxena B, Saxena V (2019) Hurst exponent based approach for influence maximization in social networks. J King Saud Univ Comput Inf Sci. https://doi.org/10.1016/j.jksuci.2019.12.010
Self-similarity from Wikipedia. https://en.wikipedia.org/wiki/Self-similarity. Accessed 30 June 2019
Shanker O (2006) Hurst exponent for spectra of complex networks. http://www.geocities.ws/oshanker/complexNetworks.pdf
Srivastava A, Chelmis C, Prasanna VK (2015) The unified model of social influence and its application in influence maximization. Soc Netw Anal Min 5:66. https://doi.org/10.1007/s13278-015-0305-x
Sun J, Tang J (2011) A survey of models and algorithms for social influence analysis. In: Aggarwal CC (ed) Social network data analytics. Kluwer Academic Publishers, Dordrecht, pp 177–214
Tang J, Tang X, Yuan J (2018) An efficient and effective hop-based approach for influence maximization in social networks. Soc Netw Anal Min 8:10. https://doi.org/10.1007/s13278-018-0489-y
Time Series from Wikipedia. https://en.wikipedia.org/wiki/Time_series. Accessed 30 June 2019
Wang Y, Zhang B, Vasilakos AV, Ma J (2014) PRDiscount: A heuristic scheme of initial seeds selection for diffusion maximization in social networks. In: Intelligent computing theory. ICIC 2014. Lecture notes in computer science. vol 8588, Springer, Cham, pp 149–161. https://doi.org/10.1007/978-3-319-09333-8_17
Wavelet transform from Wikipedia. https://en.wikipedia.org/wiki/Wavelet_transform. Accessed 29 June 2019
Xu W, Lu Z, Wu W, Chen Z (2014) A novel approach to online social influence maximization. Soc Netw Anal Min 4:153. https://doi.org/10.1007/s13278-014-0153-0
Zhang H, Dinh TN, Thai MT (2013) Maximizing the spread of positive influence in online social networks. In: IEEE 33rd international conference on distributed computing systems. https://doi.org/10.1109/ICDCS.2013.37
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Saxena, B., Saxena, V. Towards establishing the effect of self-similarity on influence maximization in online social networks. Soc. Netw. Anal. Min. 10, 35 (2020). https://doi.org/10.1007/s13278-020-00654-7
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s13278-020-00654-7