Information diffusion blocking model of node influence-oriented in online social network

被引：0
|
作者：
Zhao Y. [1 ,2 ]
Huang K. [1 ,2 ]
Guo Y. [1 ]
Zhao X. [1 ,2 ]
机构：
[1] National Digital Switching System Engineering and Technological R & D Center, Zhengzhou
[2] National Engineering Laboratory for Mobile Network Security, Beijing
来源：
Huang, Kaizhi (huangkaizhi@tsinghua.edu.cn) | 1600年 / Tsinghua University卷 / 57期
关键词：
Information diffusion blocking; Minimum influence; Mixed integer programming (MIP); Social network; Stochastic optimization;
D O I：
10.16511/j.cnki.qhdxxb.2017.25.061
中图分类号：
学科分类号：
摘要：
Information diffusion blocking maximization is used to select and delete the best l nodes (edges) to minimize the number of nodes receiving information in the network. However, the model does not take into account the node's influence which blocks the information flow and lowers the efficiency. This paper presents an information diffusion blocking model that considers the node's influence with a method based on the sampling average approximation (SAA). The model is selects and deletes the best l nodes to change the network structure which minimizing the influence of the target nodes. The model is a stochastic optimization problem which is transferred into a deterministic problem using SAA. The problem is then encoded as a mixed integer programming (MIP) problem. Finally, a quantum genetic algorithm is used to select the best l nodes and remove them. Simulations show that the best l nodes selected by this model influence the information diffusion over a smaller range and the processing time is shorter than the traditional model. © 2017, Tsinghua University Press. All right reserved.
引用
收藏
页码：1245 / 1253
页数：8
相关论文
共 18 条
  • [1] Chen W., Research on influence diffusion in social netwok, Big Data, 1, 3, (2017)
  • [2] Nowzari C., Preciado V.M., Pappas G.J., Analysis and control of epidemics: A survey of spreading processes on complex networks, IEEE Control Systems, 36, 1, pp. 26-46, (2016)
  • [3] Prakash B.A., Chakrabarti D., Valler N.C., Et al., Threshold conditions for arbitrary cascade models on arbitrary networks, Knowledge and Information Systems, 33, 3, pp. 549-575, (2012)
  • [4] Tong H., Prakash B.A., Eliassi-Rad T., Et al., Gelling, and melting, large graphs by edge manipulation, Proceedings of the 21st ACM International Conference on Information and Knowledge Management, pp. 245-254, (2012)
  • [5] Saha S., Adiga A., Prakash B.A., Et al., Approximation algorithms for reducing the spectral radius to control epidemic spread, Proceedings of the 2015 SIAM International Conference on Data Mining, pp. 568-576, (2015)
  • [6] Chen C., Tong H., Prakash B.A., Et al., Node immunization on large graphs: Theory and algorithms, IEEE Transactions on Knowledge and Data Engineering, 28, 1, pp. 113-126, (2016)
  • [7] Khalil E.B., Dilkina B., Song L., Scalable diffusion-aware optimization of network topology, Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1226-1235, (2014)
  • [8] Zhang Y., Adiga A., Saha S., Et al., Near-optimal algorithms for controlling propagation at group scale on networks, IEEE Transactions on Knowledge and Data Engineering, 28, 12, pp. 3339-3352, (2016)
  • [9] Kempe D., Kleinberg J.M., Tardos E., Maximizing the spread of influence through a social network, Theory of Computing, 11, 4, pp. 105-147, (2015)
  • [10] Liu Y., Tang M., Zhou T., Et al., Identify influential spreaders in complex networks, the role of neighborhood, Physia A: Statistical Mechanics and Its Applications, 452, pp. 289-298, (2016)
12