arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.01928cs.DScs.IR
收藏

从时态图中挖掘最大生成桁架的有效算法

Efficient Algorithms to Mine Maximal Span-Trusses From Temporal Graphs

Quintino Francesco Lotito, Alberto Montresor

摘要:

在过去的十年中,人们对时间图的兴趣越来越大,这是由于来自社会,生物和金融网络的时间注释网络数据越来越多。尽管分析复杂的时态网络很重要,但可用于研究大型静态图的定义、算法和工具集与可用于时态图的定义、算法和工具集之间存在巨大差距。时态图分析中的一个重要任务是挖掘密集结构,即,识别高密度子图以及观察到这种高密度的跨度。在本文中,我们引入了时间图中的$(k, Δ)$ -桁架(跨度桁架)的概念,这是$k$ -桁架的时间推广,其中$k$捕获关于密度的信息,而$Δ$捕获该密度保持的时间跨度。然后,我们提出了新的和有效的算法来识别最大跨度桁架,即不占主导地位的任何其他跨度桁架既不是在顺序$k$,也不是在间隔$Δ$,并评估他们的一些公共可用的数据集。

英文摘要:

Over the last decade, there has been an increasing interest in temporal graphs, pushed by a growing availability of temporally-annotated network data coming from social, biological and financial networks. Despite the importance of analyzing complex temporal networks, there is a huge gap between the set of definitions, algorithms and tools available to study large static graphs and the ones available for temporal graphs. An important task in temporal graph analysis is mining dense structures, i.e., identifying high-density subgraphs together with the span in which this high density is observed. In this paper, we introduce the concept of $(k, Δ)$-truss (span-truss) in temporal graphs, a temporal generalization of the $k$-truss, in which $k$ captures the information about the density and $Δ$ captures the time span in which this density holds. We then propose novel and efficient algorithms to identify maximal span-trusses, namely the ones not dominated by any other span-truss neither in the order $k$ nor in the interval $Δ$, and evaluate them on a number of public available datasets.

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

↑