A new algorithm for positive influence maximization in signed networks

2020 ◽  
Vol 512 ◽  
pp. 1571-1591 ◽  
Author(s):  
Weijia Ju ◽  
Ling Chen ◽  
Bin Li ◽  
Wei Liu ◽  
Jun Sheng ◽  
...  
2017 ◽  
Vol 48 (3) ◽  
pp. 570-593 ◽  
Author(s):  
Mohammad Mehdi Daliri Khomami ◽  
Alireza Rezvanian ◽  
Negin Bagherpour ◽  
Mohammad Reza Meybodi

2018 ◽  
Vol 49 (3) ◽  
pp. 912-928 ◽  
Author(s):  
Wei Liu ◽  
Xin Chen ◽  
Byeungwoo Jeon ◽  
Ling Chen ◽  
Bolun Chen

Author(s):  
Liqing Qiu ◽  
Shuang Zhang ◽  
Jinfeng Yu

The purpose of influence maximization problem is to select a small seed set to maximize the number of nodes influenced by the seed set. For viral marketing, the problem of influence maximization plays a vital role. Current works mainly focus on the unsigned social networks, which include only positive relationship between users. However, the influence maximization in the signed social networks including positive and negative relationships between users is still a challenging issue. Moreover, the existing works pay more attention to the positive influence. Therefore, this paper first analyzes the positive maximization influence in the signed social networks. The purpose of this problem is to select the seed set with the most positive influence in the signed social networks. Afterwards, this paper proposes a model that incorporates the state of node, the preference of individual and polarity relationship, called Independent Cascade with the Negative and Polarity (ICWNP) propagation model. On the basis of the ICWNP model, this paper proposes a Greedy with ICWNP algorithm. Finally, on four real social networks, experimental results manifest that the proposed algorithm has higher accuracy and efficiency than the related methods.


2017 ◽  
Vol 260 ◽  
pp. 69-78 ◽  
Author(s):  
Dong Li ◽  
Cuihua Wang ◽  
Shengping Zhang ◽  
Guanglu Zhou ◽  
Dianhui Chu ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document