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

GraphDCA --实图与合成图中节点分布比较的框架

GraphDCA -- a Framework for Node Distribution Comparison in Real and Synthetic Graphs

KTH Royal Institute of Technology(皇家理工学院);SEB Group(SEB集团)

Ciwan Ceylan, Petra Poklukar, Hanna Hultin, Alexander Kravchenko, Anastasia Varava, Danica Kragic

摘要:

我们认为,当比较两个图时,节点结构特征的分布比实践中经常使用的全局图统计信息更丰富,特别是用于评估图生成模型。因此,我们提出了GraphDCA -一个框架,用于评估图形之间的相似性的基础上对齐各自的节点表示集。集合比较使用最近提出的方法比较表示空间,称为Delaunay分量分析(DCA),我们扩展到图形数据。为了评估我们的框架,我们生成了一个具有不同结构模式的图的基准数据集,并使用三个节点结构特征提取器显示,GraphDCA识别具有相似和不相似局部结构的图。然后,我们应用我们的框架来评估三个公开的真实世界的图数据集,并证明,使用逐渐边缘扰动,GraphDCA令人满意地捕获逐渐减少的相似性,而不是全局统计。最后,我们使用GraphDCA来评估两个最先进的图生成模型,NetGAN和CELL,并得出结论,这些模型需要进一步改进,以充分再现局部结构特征。

英文摘要:

We argue that when comparing two graphs, the distribution of node structural features is more informative than global graph statistics which are often used in practice, especially to evaluate graph generative models. Thus, we present GraphDCA - a framework for evaluating similarity between graphs based on the alignment of their respective node representation sets. The sets are compared using a recently proposed method for comparing representation spaces, called Delaunay Component Analysis (DCA), which we extend to graph data. To evaluate our framework, we generate a benchmark dataset of graphs exhibiting different structural patterns and show, using three node structure feature extractors, that GraphDCA recognizes graphs with both similar and dissimilar local structure. We then apply our framework to evaluate three publicly available real-world graph datasets and demonstrate, using gradual edge perturbations, that GraphDCA satisfyingly captures gradually decreasing similarity, unlike global statistics. Finally, we use GraphDCA to evaluate two state-of-the-art graph generative models, NetGAN and CELL, and conclude that further improvements are needed for these models to adequately reproduce local structural features.

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

↑