Mining Initial Nodes with BSIS Model and BS-G Algorithm on Social Networks for Influence Maximization  

作　　者：Xiaoheng Deng Dejuan Cao Yan Pan Hailan Shen Fang Long 

机构地区：[1]School of Computer Science and Engineering, Central South University,Changsha 410083, China

出　　处：《国际计算机前沿大会会议论文集》2017年第2期33-35,共3页International Conference of Pioneering Computer Scientists, Engineers and Educators（ICPCSEE）

摘　　要：Influence maximization is the problem to identify and find a set of the most influential nodes, whose aggregated influence in the network is maximized. This research is of great application value for advertising,viral marketing and public opinion monitoring. However, we always ignore the tendency of nodes' behaviors and sentiment in the researches of influence maximization. On general, users' sentiment determines users behaviors, and users' behaviors reflect the influence between users in social network. In this paper, we design a training model of sentimental words to expand the existing sentimental dictionary with the marked-commentdata set, and propose an influence spread model considering both the tendency of users' behaviors and sentiment named as BSIS (Behavior and Sentiment Influence Spread) to depict and compute the influence between nodes. We also propose an algorithm for influence maximization named as BS-G (BSIS with Greedy Algorithm) to select the initial node. In the experiments, we use two real social network data sets on the Hadoop and Spark distributed cluster platform for experiments, and the experiment results show that BSIS model and BS-G algorithm on big data platform have better influence spread effects and higher quality of the selection of seed node comparing with the approaches with traditional IC, LT and CDNF models.

关 键 词：Social networks INFLUENCE MAXIMIZATION Behavior TENDENCY SENTIMENT TENDENCY GREEDY ALGORITHM 

分 类 号：C5[社会学]