? An Efficient Two-Phase Model for Computing Influential Nodes in Social Networks Using Social Actions
Journal of Computer Science and Technology
Quick Search in JCST
 Advanced Search 
      Home | PrePrint | SiteMap | Contact Us | FAQ
Indexed by   SCIE, EI ...
Bimonthly    Since 1986
Journal of Computer Science and Technology 2018, Vol. 33 Issue (2) :286-304    DOI: 10.1007/s11390-018-1820-9
Artificial Intelligence and Pattern Recognition Current Issue | Archive | Adv Search << Previous Articles | Next Articles >>
An Efficient Two-Phase Model for Computing Influential Nodes in Social Networks Using Social Actions
Mehdi Azaouzi, Lotfi Ben Romdhane
Modeling of Automated Reasoning Systems Research Laboratory LR17 ES05 Higher Institute of Computer Science and Telecom, University of Sousse, Sousse 526-4002, Tunisia

Related Articles
Download: [PDF 2457KB]     Export: BibTeX or EndNote (RIS)  
Abstract The measurement of influence in social networks has received a lot of attention in the data mining community. Influence maximization refers to the process of finding influential users who make the most of information or product adoption. In real settings, the influence of a user in a social network can be modeled by the set of actions (e.g., "like", "share", "retweet", "comment") performed by other users of the network on his/her publications. To the best of our knowledge, all proposed models in the literature treat these actions equally. However, it is obvious that a "like" of a publication means less influence than a "share" of the same publication. This suggests that each action has its own level of influence (or importance). In this paper, we propose a model (called Social Action-Based Influence Maximization Model, SAIM) for influence maximization in social networks. In SAIM, actions are not considered equally in measuring the "influence power" of an individual, and it is composed of two major steps. In the first step, we compute the influence power of each individual in the social network. This influence power is computed from user actions using PageRank. At the end of this step, we get a weighted social network in which each node is labeled by its influence power. In the second step of SAIM, we compute an optimal set of influential nodes using a new concept named "influence-BFS tree". Experiments conducted on large-scale real-world and synthetic social networks reveal the good performance of our model SAIM in computing, in acceptable time scales, a minimal set of influential nodes allowing the maximum spreading of information.
Articles by authors
Keywordssocial network   social influence   social action   personalized PageRank   influence-BFS tree     
Received 2016-12-13;
Corresponding Authors: 10.1007/s11390-018-1820-9   
About author: Mehdi Azaouzi is currently a Ph.D. student at the National School of Computer Sciences, University of Manouba, Tunisia. He received his Bachelor's degree and his Master's degree from the Faculty of Sciences, University of Monastir, Tunisia, both in computer science, in 2009 and 2012, respectively. His current research interests include social networks analyses, graph mining, and graph indexing. He is member of the MARS (Modeling of Automated Reasoning Systems) Research Laboratory
Cite this article:   
Mehdi Azaouzi, Lotfi Ben Romdhane.An Efficient Two-Phase Model for Computing Influential Nodes in Social Networks Using Social Actions[J]  Journal of Computer Science and Technology, 2018,V33(2): 286-304
Copyright 2010 by Journal of Computer Science and Technology