【24h】

Ties that matter

机译:重要的关系

获取原文

摘要

On-line social networks mostly allow individuals to extend friend requests to all forms of possible connections including those related to official purposes, interests, family relations, friendships, and acquaintances. One requires to mine relevant connections in order to make reliable and meaningful interpretations following network analysis. Most networks lack weight assignments that mark the strength of a connection. Thus there is a requirement of methods that can effectively identify essential edges from only the topological information available. The method discussed in this article identifies unique and high number of mutual connections through weighted self-information. The extracted skeleton network has highly reduced number of edges, still conserving the centrality distributions as far as possible. The method used is applied locally to each node, to extract connections relevant to every node. Results are demonstrated on five datasets which show that the proposed method is able to eliminate a large number of irrelevant edges. The method is also found to scale well to large datasets.
机译:在线社交网络主要允许个人向所有形式的可能连接扩展朋友请求,包括与官方目的,利益,家庭关系,友谊和熟人有关的各种形式。一个需要挖掘相关联系,以便在网络分析后进行可靠和有意义的解释。大多数网络缺少标记连接强度的重量分配。因此,需要一种方法可以仅从可用的拓扑信息有效地识别基本边缘。本文讨论的方法识别通过加权自信息的唯一和大量的相互连接。提取的骨架网络具有高度减少的边缘,仍然尽可能地节省中心分布。使用的方法在本地应用于每个节点,以提取与每个节点相关的连接。结果在五个数据集上进行了说明,表明所提出的方法能够消除大量不相关的边缘。还发现该方法展示了大型数据集。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号