Towards establishing the effect of self-similarity on influence maximization in online social networks

被引:0
作者
Bhawna Saxena
Vikas Saxena
机构
[1] Jaypee Institute of Information Technology,Department of Computer Science & Engineering and Information Technology
来源
Social Network Analysis and Mining | 2020年 / 10卷
关键词
Self-similarity; Influence maximization; Node activity; Online social networks;
D O I
暂无
中图分类号
学科分类号
摘要
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.
引用
收藏
相关论文
共 44 条
[1]  
Emami N(2018)Continuous state online influence maximization in social network Soc Netw Anal Min 8 32-6625
[2]  
Mozafari N(2012)Fractal analysis on human behaviors dynamics Phys A 391 6617-3015
[3]  
Hamzeh A(2017)A new method of identifying influential users in the micro-blog networks IEEE Access 5 3008-46
[4]  
Fan C(2018)Social influence analysis: models, methods, and evaluation Engineering 4 40-26
[5]  
Guo JL(2016)Self-similarity in social network dynamics ACM Trans Model Perform Eval Comput Syst 2 1-17
[6]  
Zha YL(2017)A fast and efficient algorithm for mining top-k nodes in complex networks OPEN Sci Rep Nat Publ Gr 7 43330-102
[7]  
Jianqiang Z(2017)Social influence analysis in social networking big data: opportunities and challenges IEEE Netw 31 11-undefined
[8]  
Xiaolin G(2018)Centrality measure in social networks based on linear threshold model Knowl-Based Syst 140 92-undefined
[9]  
Feng T(2019)A node activity and connectivity-based model for influence maximization in social networks Soc Netw Anal Min 9 40-undefined
[10]  
Li K(2019)Hurst exponent based approach for influence maximization in social networks J King Saud Univ Comput Inf Sci 5 66-undefined