首页> 美国卫生研究院文献>other >Real-time community detection in full social networks on a laptop
【2h】

Real-time community detection in full social networks on a laptop

机译:在笔记本电脑上的完整社交网络中进行实时社区检测

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

For a broad range of research and practical applications it is important to understand the allegiances, communities and structure of key players in society. One promising direction towards extracting this information is to exploit the rich relational data in digital social networks (the social graph). As global social networks (e.g., Facebook and Twitter) are very large, most approaches make use of distributed computing systems for this purpose. Distributing graph processing requires solving many difficult engineering problems, which has lead some researchers to look at single-machine solutions that are faster and easier to maintain. In this article, we present an approach for analyzing full social networks on a standard laptop, allowing for interactive exploration of the communities in the locality of a set of user specified query vertices. The key idea is that the aggregate actions of large numbers of users can be compressed into a data structure that encapsulates the edge weights between vertices in a derived graph. Local communities can be constructed by selecting vertices that are connected to the query vertices with high edge weights in the derived graph. This compression is robust to noise and allows for interactive queries of local communities in real-time, which we define to be less than the average human reaction time of 0.25s. We achieve single-machine real-time performance by compressing the neighborhood of each vertex using minhash signatures and facilitate rapid queries through Locality Sensitive Hashing. These techniques reduce query times from hours using industrial desktop machines operating on the full graph to milliseconds on standard laptops. Our method allows exploration of strongly associated regions (i.e., communities) of large graphs in real-time on a laptop. It has been deployed in software that is actively used by social network analysts and offers another channel for media owners to monetize their data, helping them to continue to provide free services that are valued by billions of people globally.
机译:对于广泛的研究和实际应用,重要的是要了解社会主要参与者的忠诚,社区和结构。提取此信息的一个有希望的方向是利用数字社交网络(社交图)中的丰富关系数据。由于全球社交网络(例如,Facebook和Twitter)很大,因此大多数方法都使用分布式计算系统来实现此目的。分布图处理需要解决许多棘手的工程问题,这导致一些研究人员开始研究更快,更易于维护的单机解决方案。在本文中,我们提出了一种用于分析标准笔记本电脑上的完整社交网络的方法,该方法允许交互式探索一组用户指定的查询顶点所在社区。关键思想是可以将大量用户的聚合操作压缩为一个数据结构,该数据结构封装了派生图中顶点之间的边权重。可以通过在导出的图中选择连接到具有高边权重的查询顶点的顶点来构建局部社区。这种压缩对噪声具有鲁棒性,并允许实时交互查询本地社区,我们将其定义为小于人类平均反应时间0.25s。我们通过使用minhash签名压缩每个顶点的邻域来实现单机实时性能,并通过“局部敏感哈希”促进快速查询。这些技术将使用在完整图形上运行的工业台式机的时间从几小时减少到标准笔记本电脑上的毫秒数,从而缩短了查询时间。我们的方法允许在笔记本电脑上实时探索大型图的紧密关联的区域(即社区)。它已部署在社交网络分析师积极使用的软件中,并为媒体所有者提供了另一种渠道,以使他们的数据货币化,从而帮助他们继续提供全球数十亿人重视的免费服务。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号