基于节点亲密度挖掘的谣言抑制算法

田亚平; 杨力; 王小琴; 乔雅峰

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

您当前的位置：

首页 >

文章列表页 >

基于节点亲密度挖掘的谣言抑制算法

学术论文 | 更新时间：2024-06-03

- 基于节点亲密度挖掘的谣言抑制算法
- Suppress the diffusion of rumors with nodes closeness mining
- 网络与信息安全学报 2016年2卷第11期页码：61-69
- 作者机构：
- 作者简介：
  
  [ "田亚平（1991-），女，河北保定人，西安电子科技大学硕士生，主要研究方向为复杂网络、移动和无线网络安全。" ]
  [ "杨力（1977-），男，陕西西安人，博士，西安电子科技大学副教授、硕士生导师，主要研究方向为移动互联网安全——认证方法与技术、云计算安全、数据安全存储与删除、移动终端安全、运行环境安全验证、可信计算、远程证明技术。" ]
  [ "王小琴（1990-），女，山西长治人，西安电子科技大学硕士生，主要研究方向为复杂网络、移动和无线网络安全。" ]
  [ "乔雅峰（1993-），女，内蒙古呼伦贝尔人，西安电子科技大学硕士生，主要研究方向为复杂网络、移动和无线网络安全。" ]
- 基金信息：
  
  国家自然科学基金资助项目;The National Natural Science Foundation of China(61671360);信息保障重点实验室基金资助项目(KJ-14-109);中央高校基本科研业务费基金资助项目;The Fundamental Research Funds for the Central Universities(JB161505)
- DOI：10.11959/j.issn.2096-109x.2016.00114
  中图分类号： TP393
- 网络首发：2016-11，
  
  纸质出版：2016-11-15
- 稿件说明：
移动端阅览
田亚平, 杨力, 王小琴, 等. 基于节点亲密度挖掘的谣言抑制算法[J]. 网络与信息安全学报, 2016,2(11):61-69.

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.
田亚平, 杨力, 王小琴, 等. 基于节点亲密度挖掘的谣言抑制算法[J]. 网络与信息安全学报, 2016,2(11):61-69. DOI： 10.11959/j.issn.2096-109x.2016.00114.

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 .

浏览量

1426

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

基于注意力机制的社交垃圾文本检测方法