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

基于图神经网络(GNN)的交通网络图边排序

Edge Ranking of Graphs in Transportation Networks using a Graph Neural Network (GNN)

University of California Los Angeles(加州大学洛杉矶分校)

Debasish Jana, Sven Malama, Sriram Narasimhan, Ertugrul Taciroglu

摘要:

许多网络,如交通、电力和水分配,都可以用图来表示。图表示的关键挑战是识别图边缘的重要性及其对整体网络效率和信息流性能的影响。例如,交通网络中的重要边缘是那些受到影响时会显著改变网络整体效率的道路。找到这些重要边的常用方法是“边介数中心性”(EBC),这是一种边排序度量,用于根据连通性和信息扩散确定图的有影响力的边。利用常见的Brandes算法计算EBC涉及计算每个节点对的最短路径,这在计算上可能是昂贵的和限制性的,特别是对于大型图。图形参数的变化,例如,在边权值或节点或边的添加和删除时,需要重新计算EBC。作为主要贡献,我们提出了一种近似方法来估计EBC使用图神经网络(GNN),一个基于深度学习的方法。我们表明,它是计算效率相比,传统的方法,特别是对于大型图。所提出的基于GNN的边排名方法在几个合成图和一个真实的交通数据集上进行了评估。我们表明,这种框架可以估计的近似边缘排名比传统的方法快得多。这种方法是归纳的,即,在具有不同数目的节点和边的不同图形集合上执行训练和测试。该方法特别适用于需要边缘信息的大规模网络应用,如城市基础设施改善项目、电力和自来水网络弹性分析以及工程网络资源分配优化等。

英文摘要:

Many networks, such as transportation, power, and water distribution, can be represented as graphs. Crucial challenge in graph representations is identifying the importance of graph edges and their influence on overall network efficiency and information flow performance. For example, important edges in a transportation network are those roads that, when affected, will significantly alter the network's overall efficiency. Commonly used approach to finding such important edges is ``edge betweenness centrality'' (EBC), an edge ranking measure to determine the influential edges of the graph based on connectivity and information spread. Computing the EBC utilizing the common Brandes algorithm involves calculating the shortest paths for every node pair, which can be computationally expensive and restrictive, especially for large graphs. Changes in the graph parameters, e.g., in the edge weight or the addition and deletion of nodes or edges, require the recalculation of the EBC. As the main contribution, we propose an approximate method to estimate the EBC using a Graph Neural Network (GNN), a deep learning-based approach. We show that it is computationally efficient compared to the conventional method, especially for large graphs. The proposed method of GNN-based edge ranking is evaluated on several synthetic graphs and a real-world transportation data set. We show that this framework can estimate the approximate edge ranking much faster compared to the conventional method. This approach is inductive, i.e., training and testing are performed on different sets of graphs with varying numbers of nodes and edges. The proposed method is especially suitable for applications on large-scale networks when edge information is desired, for example, in urban infrastructure improvement projects, power, and water network resilience analyses, and optimizing resource allocations in engineering networks.

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

↑