A study on the influence propagation model in topic attention networks

被引:0
作者
Chen X. [1 ,2 ,4 ]
Guo J. [1 ,4 ]
Tian K. [1 ]
Fan C. [1 ]
Pan X. [3 ]
机构
[1] College of Information Science and Engineering, YanShan University, Qinhuangdao
[2] Qian'An College, North China University of Science and Technology, Qian'an
[3] College of Economic and Management, Shijiazhuang Tiedao University, Shijiazhuang
[4] Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province, Qinhuangdao
基金
中国国家自然科学基金;
关键词
Connected degree; Influence maximization; Information diffusion; Markov random walk; Topic attention networks; Topic preference;
D O I
10.23940/ijpe.17.05.p15.721730
中图分类号
学科分类号
摘要
The social networks with the complex user relations and huge amount of data and hidden information, bring new opportunities and challenges for the study of information diffusion and influence maximization. In recent years, there are more and more researches on the influence maximization of topic preference. However, most of the existing researches only take the topic as an attribute of the users, and the importance of the topic in network structure is not considered. In view of this situation, firstly, this paper constructed a new topic attention network model fusing the social relation and the topic preference. Secondly, based on connected degree of set pair and Markov random walk model, we propose the calculated method of the topic preference for users, and then mining the seed set with influence by the greedy strategy. Thirdly, we propose the calculated method of the activation probability of the user based on the user relation and the topic preference, and propose the influence maximization algorithm TAN-CELF in topic attention networks. Finally, on Dou-ban network dataset, from three metrics ISST, ISRT and ISRNT, compare with algorithm L-GAUP and CELF, the experimental results show that algorithm TAN-CELF that is proposed by this paper has a higher performance on influence scope. © 2017 Totem Publisher, Inc. All rights reserved.
引用
收藏
页码:721 / 730
页数:9
相关论文
共 50 条
[31]   Information Diffusion of Topic Propagation in Social Media [J].
Mahdizadehaghdam, Shahin ;
Wang, Han ;
Krim, Hamid ;
Dai, Liyi .
IEEE TRANSACTIONS ON SIGNAL AND INFORMATION PROCESSING OVER NETWORKS, 2016, 2 (04) :569-581
[32]   CLUS-BET: improving influence propagation and classification in networks using a novel seed selection technique [J].
Saxena, Rahul ;
Paira, Pranjal ;
Jadeja, Mahipal .
SOCIAL NETWORK ANALYSIS AND MINING, 2024, 14 (01)
[33]   Influence Diffusion Model in Multiplex Networks [J].
Chen, Senbo ;
Tan, Wenan .
CMC-COMPUTERS MATERIALS & CONTINUA, 2020, 64 (01) :345-358
[34]   Influence diffusion model in multiplex networks [J].
Chen S. ;
Tan W. .
Computers, Materials and Continua, 2020, 64 (01) :35-358
[35]   Graph convolutional networks with the self-attention mechanism for adaptive influence maximization in social networks [J].
Tang, Jianxin ;
Song, Shihui ;
Du, Qian ;
Yao, Yabing ;
Qu, Jitao .
COMPLEX & INTELLIGENT SYSTEMS, 2024, 10 (06) :8383-8401
[36]   Cascade with Varying Activation Probability Model for Influence Maximization in Social Networks [J].
Lu, Zhiyi ;
Long, Yi ;
Li, Victor O. K. .
2015 INTERNATIONAL CONFERENCE ON COMPUTING, NETWORKING AND COMMUNICATIONS (ICNC), 2015, :869-873
[37]   A New Rumor Propagation Model and Control Strategy on Social Networks [J].
Bao, Yuanyuan ;
Yi, Chengqi ;
Xue, Yibo ;
Dong, Yingfei .
2013 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM), 2013, :1472-1473
[38]   Influence Maximization in Social Networks using Hurst exponent based Diffusion Model [J].
Saxena, Bhawna ;
Saxena, Vikas .
PROCEEDINGS OF THE CONFLUENCE 2020: 10TH INTERNATIONAL CONFERENCE ON CLOUD COMPUTING, DATA SCIENCE & ENGINEERING, 2020, :167-171
[39]   Influence Maximization in Independent Cascade Model with Limited Propagation Distance [J].
Lv, Shunming ;
Pan, Li .
WEB TECHNOLOGIES AND APPLICATIONS, APWEB 2014, PT II, 2014, 8710 :23-34
[40]   A mean-field-theoretic model for dual information propagation in networks [J].
Niranjan, Utkarsh ;
Singh, Anurag ;
Agrawal, Ramesh Kumar .
JOURNAL OF COMPLEX NETWORKS, 2019, 7 (04) :585-602