首页> 外文期刊>Decision support systems >Spreading the information in complex networks: Identifying a set of top-N influential nodes using network structure
【24h】

Spreading the information in complex networks: Identifying a set of top-N influential nodes using network structure

机译:在复杂网络中传播信息:使用网络结构识别一组顶级有影响的节点

获取原文
获取原文并翻译 | 示例
           

摘要

The real world contains many complex networks, including research networks, social networks, biological networks, and transport networks. Real-world complex networks are unconstrained and can be characterized as undirected and unweighted. Understanding and controlling the process of information propagation in such networks is significant for decision-making activities and has many uses, such as disease control, market advertising, rumor control, and innovation propagation. Identifying the influencers in complex networks is an important activity, as influencers play a key role in spreading information to aid the decision-making process. In this study, we consider the problem of identifying a set of top-N influential nodes for spreading the information in undirected and unweighted networks using the network structure in the absence of domain-specific knowledge. In this study, we propose a novel method that computes the ranking scores of the nodes in the network and considers the influence of other nodes simultaneously when forming the set of top-N influential nodes. The proposed method is different from other methods of identification of influential nodes in the network, in that it takes into consideration the position of the nodes in the network while computing the ranking score, thereby preventing the clustering of important nodes, which hampers the information flow. Experiments are performed using several real-world complex networks to demonstrate the effectiveness of the proposed method.
机译:现实世界包含许多复杂的网络,包括研究网络,社交网络,生物网络和运输网络。现实世界的复杂网络是无限制的,可以被称为无向和未加权。理解和控制这些网络中的信息传播过程对于决策活动具有重要意义,并且具有许多用途,例如疾病控制,市场广告,谣言控制和创新传播。在复杂网络中识别影响者是一个重要的活动,因为影响者在传播信息中发挥关键作用以帮助决策过程。在这项研究中,我们考虑使用网络结构在没有域特定知识的情况下识别用于扩展无向和未加权网络中的信息的一组顶-N影响的节点的问题。在本研究中,我们提出了一种新的方法,该方法计算网络中节点的排名分数,并在形成一组顶-N影响节点时同时考虑其他节点的影响。所提出的方法与网络中有影响的节点的其他方法不同,因为它考虑了在计算排名分数的同时考虑网络中的节点的位置,从而防止了重要节点的聚类,这妨碍了信息流。使用若干现实世界复杂网络进行实验来证明所提出的方法的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号