An Influence Model Based on Heterogeneous Online Social Network for Influence Maximization

Influence maximization is an important technique in advertisement post, viral marketing, and public opinion monitoring. Seed set identification is one of the key issues in influence maximization. In reality, there exist heterogeneous nodes, such as user nodes, message nodes in social networks. The complex association relationship among heterogeneous nodes, which are seldom considered, significantly increases the complexity of the seed set identification. In this paper, we propose a Measuring Influence (MIF) model to capture social influence with heterogeneity. MIF considers the interaction among adjacent nodes, the tag of users, the users’ social friendships and the similarity in user interests, and studies the interaction based influence, tag based influence, friendship based influence, and topic based influence, respectively. As obtaining the seed set in social networks has been proved to be a NP-hard problem, we propose an algorithm called Influence Maximization Greedy Algorithm (IMGA) to solve this problem by maximizing the marginal influence of selected seed nodes. Series of experiments are designed to evaluate the performance of the proposed model and algorithm. Our results show that MIF model and IMGA algorithm have better influence spread effects and higher quality of the seed set identification comparing to the approaches under IC, LT, CDNF, MIA, and BBA, models.

[1]  Christos Faloutsos,et al.  Graphs Over Time: Densification and Shrinking Diameters , 2006 .

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

[3]  Matthew Richardson,et al.  Mining knowledge-sharing sites for viral marketing , 2002, KDD.

[4]  Michael R. Lyu,et al.  Learning to recommend with social trust ensemble , 2009, SIGIR.

[5]  Dianhui Chu,et al.  Positive influence maximization in signed social networks based on simulated annealing , 2017, Neurocomputing.

[6]  Zhetao Li,et al.  Minimizing Convergecast Time and Energy Consumption in Green Internet of Things , 2020, IEEE Transactions on Emerging Topics in Computing.

[7]  Xiang Li,et al.  Towards Structural Controllability of Temporal Complex Networks , 2016 .

[8]  Gang Hua,et al.  Hyperspectral Image Classification Through Bilayer Graph-Based Learning , 2014, IEEE Transactions on Image Processing.

[9]  Qi Zhang,et al.  Modelling temporal networks of human face-to-face contacts with public activity and individual reachability , 2016, The European Physical Journal B.

[10]  Srinivas Shakkottai,et al.  Influence maximization in social networks: An ising-model-based approach , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[11]  Wei Chen,et al.  Scalable influence maximization for prevalent viral marketing in large-scale social networks , 2010, KDD.

[12]  Naixue Xiong,et al.  Design and Analysis of Probing Route to Defense Sink-Hole Attacks for Internet of Things Security , 2020, IEEE Transactions on Network Science and Engineering.

[13]  Yifei Yuan,et al.  Scalable Influence Maximization in Social Networks under the Linear Threshold Model , 2010, 2010 IEEE International Conference on Data Mining.

[14]  Ning Zhang,et al.  Time-Critical Influence Maximization in Social Networks with Time-Delayed Diffusion Process , 2012, AAAI.

[15]  Lars Schmidt-Thieme,et al.  Pairwise interaction tensor factorization for personalized tag recommendation , 2010, WSDM '10.

[16]  Jian Gao,et al.  Promotion and resignation in employee networks , 2015, ArXiv.

[17]  Nitesh V. Chawla,et al.  Link Prediction and Recommendation across Heterogeneous Social Networks , 2012, 2012 IEEE 12th International Conference on Data Mining.

[18]  Ali Moeini,et al.  A fast algorithm for finding most influential people based on the linear threshold model , 2015, Expert Syst. Appl..

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

[20]  Michael R. Lyu,et al.  Learning to recommend with trust and distrust relationships , 2009, RecSys '09.

[21]  Jiaqi Liu,et al.  Analysis for Behavioral Economics in Social Networks: An Altruism-Based Dynamic Cooperation Model , 2019, International Journal of Parallel Programming.

[22]  Hui Liu,et al.  An Incentive Mechanism Combined With Anchoring Effect and Loss Aversion to Stimulate Data Offloading in IoT , 2019, IEEE Internet of Things Journal.

[23]  Xiang Li,et al.  Bridging Time Series Dynamics and Complex Network Theory with Application to Electrocardiogram Analysis , 2012, IEEE Circuits and Systems Magazine.

[24]  Xiaoheng Deng,et al.  Credit Distribution for Influence Maximization in Online Social Networks with Time Constraint , 2015, 2015 IEEE International Conference on Smart City/SocialCom/SustainCom (SmartCity).

[25]  Masahiro Kimura,et al.  Prediction of Information Diffusion Probabilities for Independent Cascade Model , 2008, KES.

[26]  Ludovic Lietard,et al.  Two evidential data based models for influence maximization in Twitter , 2017, Knowl. Based Syst..

[27]  John C. S. Lui,et al.  Analyzing competitive influence maximization problems with partial information: An approximation algorithmic framework , 2015, Perform. Evaluation.

[28]  Hang Li,et al.  A Short Introduction to Learning to Rank , 2011, IEICE Trans. Inf. Syst..

[29]  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).

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