Suppress the diffusion of rumors with nodes closeness mining

Ya-ping TIAN; Li YANG; Xiao-qin WANG; Ya-feng QIAO

doi:10.11959/j.issn.2096-109x.2016.00114

您当前的位置：

首页 >

文章列表页 >

Suppress the diffusion of rumors with nodes closeness mining

Papers | 更新时间：2024-06-03

- Suppress the diffusion of rumors with nodes closeness mining
- Chinese Journal of Network and Information Security Vol. 2, Issue 11, Pages: 61-69(2016)
- 作者机构：
- 作者简介：
- 基金信息：
- DOI：10.11959/j.issn.2096-109x.2016.00114
  CLC： TP393
- Online First：2016-11，
  
  Published：15 November 2016
- 稿件说明：
移动端阅览
Ya-ping TIAN, Li YANG, Xiao-qin WANG, et al. Suppress the diffusion of rumors with nodes closeness mining[J]. Chinese Journal of Network and Information Security, 2016, 2(11): 61-69.
DOI：

Ya-ping TIAN, Li YANG, Xiao-qin WANG, et al. Suppress the diffusion of rumors with nodes closeness mining[J]. Chinese Journal of Network and Information Security, 2016, 2(11): 61-69. DOI： 10.11959/j.issn.2096-109x.2016.00114.

摘要

通过对谣言等易误导大众舆论的信息传播进行抑制，从而实现对谣言、错误舆论等负面信息的控制。首先，通过对社交网络的结构拓扑以及节点行为特点的分析，提出了基于节点亲密度的社交网络舆论领袖节点识别方法；然后，利用谣言传播特性及节点的亲密度，建立谣言传播模型，并分析谣言在社交网络中传播时节点的状态转化过程；最后，提出了一种利用节点亲密度实现谣言抑制的方法。

Abstract

Through making the analysis of information spread in social networks

the supression of rumors

error information and other negative information was realized.Firstly

by analyzing the structure of social networks and the characteristics of node behavior

a method for the identification of opinion leader nodes was proposed based on the degree of intimacy between nodes in social networks.Then

the rumor propagation model and the analysis of nodes’ state transformation process were made when the rumor spread in social networks.At last

the control method was proposed to suppress the diffusion of rumors with the nodes’ closeness.

关键词

Keywords

references

BAKSHY E , KARRER B , ADAMIC L A . Social influence and the diffusion of user-created content [C ] // The 10th ACM Conference on Electronic Commerce . 2009 : 325 - 334 .

ONNELA J P , SARAMÄKI J , HYVÖNEN J , et al . Structure and tie strengths in mobile communication networks [J ] . The National Academy of Sciences , 2007 , 104 ( 18 ): 7332 - 7336 .

SOH D W , QUEK T Q S , TAY W P . Randomized rumor spreading in non-static networks [C ] // IEEE International Conference on ICT Convergence . 2011 : 156 - 160 .

PANAGIOTOU K , PÉREZGIMÉNEZ X , SUN T S H . Randomized rumour spreading:the effect of the network topology [J ] . Combinatorics Probability ＆ Computing , 2014 , 24 ( 2 ): 1 - 23 .

ACAN H , COLLEVECCHIO A , MEHRABIAN A , et al . On the push＆pull protocol for rumour spreading [J ] . Klinische Padiatrie , 2014 , 226 ( 3 ): 161 - 168 .

FOUNTOULAKIS N , HUBER A , PANAGIOTOU K . Reliable broadcasting in random networks and the effect of density [C ] // Infocom . 2010 : 1 - 9 .

GIAKKOUPIS G , . Tight bounds for rumor spreading in graphs of a given conductance [C ] // The 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011) . 2011 : 57 - 68 .

CHIERICHETTI F , LATTANZI S , PANCONESI A.Almost tight bounds for rumour spreading with conductance . [J ] . The ACM International Symposium on Theory of Computing , 2010 : 399 - 408 .

WEN S , JIANG J , XIANG Y , et al . To shut them up or to clarify:restraining the spread of rumors in online social networks [J ] . Parallel and Distributed Systems , 2014 , 25 ( 12 ): 3306 - 3316 .

AI J , ZHAO H , CARLEY K M , et al . Neighbor vector centrality of complex networks based on neighbors degree distribution [J ] . Physics of Condensed Matter , 2013 , 86 ( 4 ): 1 - 7 .

WEHMUTH K , ZIVIANI A . Distributed assessment of the closeness centrality ranking in complex networks [C ] // The Workshop on Simplifying Complex Networks for Practitioners . 2012 : 43 - 48 .

BRANDESU . A faster algorithm for betweenness centrality [J ] . Journal of Mathematical Sociology , 2010 , 25 ( 2 ): 163 - 177 .

KITSAK M , GALLOS L K , HAVLIN S , et al . Identification of influential spreaders in complex networks [J ] . Nature Physics , 2010 , 6 ( 11 ): 888 - 893 .

YANG L , QIAO Y , LIU Z , et al . Identifying opinion leader nodes in online social networks with a new closeness evaluation algorithm [J ] . Soft Computing , 2016 : 1 - 12 .

LU Z , FAN L , WU W , et al . Efficient influence spread estimation for influence maximization under the linear threshold model [J ] . Computational Social Networks , 2014 , 1 ( 1 ): 1 - 19 .

Views

1426

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Attention-based approach of detecting spam in social networks

Related Author

Qiang QU

Hongtao YU

Ruiyang HUANG

Related Institution

No data

⁰