Influence Maximization in Social Networks using Hurst exponent based Diffusion Model

Influence maximization (IM) in online social networks (OSNs) has been extensively studied in the past few years, owing to its potential of impacting online marketing. IM aims at solving the problem of selecting a small set of influential nodes, who can lead to maximum influence spread across a social network. An integral part of IM is the modelling of the underlying diffusion process, which has a substantial impact on the spread achieved by any seed set. In this paper, Hurst-based diffusion model for IM has been proposed, under which node’s activation depends upon the nature of self-similarity exhibited in its past activity pattern. Assessment of the self-similarity trend exhibited by a node’s activity pattern, has been done using Hurst exponent (H). On the basis of the results achieved, the proposed model has been found to perform significantly better than two widely popular diffusion models, Independent Cascade and Linear Threshold, which are often used for IM in OSNs.

[1]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[2]  Bulakh Vitalii,et al.  Fractal time series analysis of social network activities , 2017, 2017 4th International Scientific-Practical Conference Problems of Infocommunications. Science and Technology (PIC S&T).

[3]  P. Clifford,et al.  A model for spatial conflict , 1973 .

[4]  Li Pan,et al.  An Improved Group-based Influence Maximization Method in Social Networks , 2018, 2018 Third International Conference on Security of Smart Cities, Industrial Control System and Communications (SSIC).

[5]  Gui Xiaolin,et al.  A New Method of Identifying Influential Users in the Micro-Blog Networks , 2017, IEEE Access.

[6]  Jingsong Gui,et al.  Credit Distribution and influence maximization in online social networks using node features , 2015, 2015 12th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD).

[7]  Shaojie Tang,et al.  Adaptive Influence Maximization in Dynamic Social Networks , 2015, IEEE/ACM Transactions on Networking.

[8]  Matthew Richardson,et al.  Mining the network value of customers , 2001, KDD '01.

[9]  Andreas Krause,et al.  Cost-effective outbreak detection in networks , 2007, KDD '07.

[10]  Florian Probst,et al.  Identifying Key Users in Online Social Networks: A PageRank Based Approach , 2010, ICIS.

[11]  Mostafa Nouri-Baygi,et al.  Maximum Degree Based Heuristics for Influence Maximization , 2018, 2018 8th International Conference on Computer and Knowledge Engineering (ICCKE).

[12]  Jianhua Ma,et al.  PRDiscount: A Heuristic Scheme of Initial Seeds Selection for Diffusion Maximization in Social Networks , 2014, ICIC.

[13]  Wei Chen,et al.  Efficient influence maximization in social networks , 2009, KDD.

[14]  Padam Kumar,et al.  A node activity and connectivity-based model for influence maximization in social networks , 2019, Social Network Analysis and Mining.

[15]  Dong Liu,et al.  A Fast and Efficient Algorithm for Mining Top-k Nodes in Complex Networks , 2017, Scientific Reports.

[16]  Doina Bucur,et al.  Influence Maximization in Social Networks with Genetic Algorithms , 2016, EvoApplications.

[17]  Jin-Li Guo,et al.  Fractal Analysis on Human Behaviors Dynamics , 2010, ArXiv.

[18]  Eyal Even-Dar,et al.  A note on maximizing the spread of influence in social networks , 2007, Inf. Process. Lett..

[19]  Jinghua Zhu,et al.  A New Structure-Hole-Based Algorithm For Influence Maximization in Large Online Social Networks , 2017, IEEE Access.

[20]  Jin-Li Guo,et al.  Fractal analysis on human dynamics of library loans , 2012 .

[21]  Yuchen Li,et al.  Influence Maximization on Social Graphs: A Survey , 2018, IEEE Transactions on Knowledge and Data Engineering.

[22]  Yuzhong Chen,et al.  Modeling Community Influence in Social Networks with Markov Chains , 2013, 2013 International Conference on Cloud Computing and Big Data.

[23]  Sakshi Agarwal,et al.  Social Influence Maximization Using Genetic Algorithm with Dynamic Probabilities , 2018, 2018 Eleventh International Conference on Contemporary Computing (IC3).

[24]  Marina Resta.  Hurst Exponent and its Applications in Time-series Analysis , 2012 .

[25]  Zhi Zhang,et al.  Research on the influence maximization based on community detection , 2018, 2018 13th IEEE Conference on Industrial Electronics and Applications (ICIEA).

[26]  Ahmed Sameh,et al.  Top-K influential users selection based on combined Katz centrality and propagation probability , 2018, 2018 IEEE 3rd International Conference on Cloud Computing and Big Data Analysis (ICCCBDA).