演化网络中的有效桁架维护
Efficient Truss Maintenance in Evolving Networks
摘要:
Truss被提出来研究由图表示的社会网络数据。图的k-桁架是一个凝聚子图,其中每个边至少包含在k-2个三角形中。虽然桁架已被证明优于模型的密切关系,在社交网络和有效的算法,发现桁架已被广泛研究,很少注意桁架的维护。然而,大多数社交网络都是不断发展的网络。为了在不断发展的网络中找到最新的$k$ -桁架,有时从头开始重新计算桁架可能是不可行的。在本文中,我们讨论了如何维护桁架在图中的动态更新。首先讨论了桁架的维护性质,然后给出了在边删除和边插入时桁架的维护算法,最后讨论了桁架索引的维护。我们在真实数据集上测试了所提出的技术。实验结果表明我们的工作是有希望的。
英文摘要:
Truss was proposed to study social network data represented by graphs. A k-truss of a graph is a cohesive subgraph, in which each edge is contained in at least k-2 triangles within the subgraph. While truss has been demonstrated as superior to model the close relationship in social networks and efficient algorithms for finding trusses have been extensively studied, very little attention has been paid to truss maintenance. However, most social networks are evolving networks. It may be infeasible to recompute trusses from scratch from time to time in order to find the up-to-date $k$-trusses in the evolving networks. In this paper, we discuss how to maintain trusses in a graph with dynamic updates. We first discuss a set of properties on maintaining trusses, then propose algorithms on maintaining trusses on edge deletions and insertions, finally, we discuss truss index maintenance. We test the proposed techniques on real datasets. The experiment results show the promise of our work.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。