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

高阶邻域桁架分解

Higher-Order Neighborhood Truss Decomposition

Zi Chen, Long Yuan, Li Han, Zhengping Qian

摘要:

$k$ -桁架模型是一种典型的凝聚子图模型,近年来受到了广泛的关注.然而,$k$ -桁架模型只考虑边的直接公共邻居,这限制了它揭示图的细粒度结构信息的能力。基于此,本文提出了一种新的边缘检测模型$(k, τ)$ -truss,该模型考虑了边缘的高阶邻域($τ$ hop)信息。基于$(k, τ)$ -桁架模型,研究了高阶桁架分解问题,即对于给定的$τ$,计算所有可能的$k$值的$(k, τ)$ -桁架.高阶桁架分解可用于社区发现和搜索、层次结构分析和图可视化等应用。为了解决这个问题,我们首先提出了一个自下而上的分解范式的$k$值的递增顺序来计算相应的$(k, τ)$ -桁架。基于自底向上的分解范式,我们进一步设计了三种优化策略,以减少不必要的计算。我们在真实数据集和合成数据集上对所提出的算法进行了评估,实验结果证明了我们提出的算法的效率、有效性和可扩展性。

英文摘要:

$k$-truss model is a typical cohesive subgraph model and has been received considerable attention recently. However, the $k$-truss model only considers the direct common neighbors of an edge, which restricts its ability to reveal fine-grained structure information of the graph. Motivated by this, in this paper, we propose a new model named $(k, τ)$-truss that considers the higher-order neighborhood ($τ$ hop) information of an edge. Based on the $(k, τ)$-truss model, we study the higher-order truss decomposition problem which computes the $(k, τ)$-trusses for all possible $k$ values regarding a given $τ$. Higher-order truss decomposition can be used in the applications such as community detection and search, hierarchical structure analysis, and graph visualization. To address this problem, we first propose a bottom-up decomposition paradigm in the increasing order of $k$ values to compute the corresponding $(k, τ)$-truss. Based on the bottom-up decomposition paradigm, we further devise three optimization strategies to reduce the unnecessary computation. We evaluate our proposed algorithms on real datasets and synthetic datasets, the experimental results demonstrate the efficiency, effectiveness and scalability of our proposed algorithms.

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

↑