arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1906.00140cs.DBcs.AIcs.DS
收藏

一种快速的公私图K-Truss发现算法

Fast Algorithm for K-Truss Discovery on Public-Private Graphs

Sharif University of Technology(谢里夫理工大学);Hong Kong Baptist University(香港浸会大学)

Soroush Ebadian, Xin Huang

摘要:

在公私图中,用户共享一个公共图,并拥有自己的私有图。私有图由仅对其所有者可见的个人私有联系人组成,例如,Facebook上的隐藏好友名单和新浪微博上的秘密追随者。然而,现有的公私分析算法还没有调查的密集子图发现的k-桁架,其中每个边包含在至少k-2个三角形。本文的目的是在公共-私有图中有效地寻找k-桁架。我们的解决方案的核心是一个新的算法更新k-truss节点插入。我们开发了一种基于分类的节点插入和边插入的混合策略来增量计算公私图中的k-桁架。大量的实验验证了我们提出的算法对现实世界的数据集上的最先进的方法的优越性。

英文摘要:

In public-private graphs, users share one public graph and have their own private graphs. A private graph consists of personal private contacts that only can be visible to its owner, e.g., hidden friend lists on Facebook and secret following on Sina Weibo. However, existing public-private analytic algorithms have not yet investigated the dense subgraph discovery of k-truss, where each edge is contained in at least k-2 triangles. This paper aims at finding k-truss efficiently in public-private graphs. The core of our solution is a novel algorithm to update k-truss with node insertions. We develop a classification-based hybrid strategy of node insertions and edge insertions to incrementally compute k-truss in public-private graphs. Extensive experiments validate the superiority of our proposed algorithms against state-of-the-art methods on real-world datasets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑