arrow
返回

GRASP: Scalable Graph Alignment by Spectral Corresponding Functions

delete2023-02-24
delete2
PRE
AI
J
Judith Hermanns *
K
Konstantinos Skitsas
A
Anton Tsitsulin
M
Marina Munkhoeva
A
Alexander Kyster
S
Simon Daugaard Nielsen
A
Alex Bronstein
D
Davide Mottin
P
Panagiotis Karras
DOI:10.1145/3561058delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
What is the best way to match the nodes of two graphs? This graph alignment problem generalizes graph isomorphism and arises in applications from social network analysis to bioinformatics. Some solutions assume that auxiliary information on known matches or node or edge attributes is available, or utilize arbitrary graph features. Such methods fare poorly in the pure form of the problem, in which only graph structures are given. Other proposals translate the problem to one of aligning node embeddings, yet, by doing so, provide only a single-scale view of the graph. In this article, we transfer the shape-analysis concept of functional maps from the continuous to the discrete case, and treat the graph alignment problem as a special case of the problem of finding a mapping between functions on graphs. We present GRASP, a method that first establishes a correspondence between functions derived from Laplacian matrix eigenvectors, which capture multiscale structural characteristics, and then exploits this correspondence to align nodes. We enhance the basic form of GRASP by altering two of its components, namely the embedding method and the assignment procedure it employs, leveraging itsmodular, hence adaptable design. Our experimental study, featuring noise levels higher than anything used in previous studies, shows that the enhanced form of GRASP outperforms scalable state-of-the-art methods for graph alignment across noise levels and graph types, and performs competitively with respect to the best nonscalable ones. We include in our study another modular graph alignment algorithm, CONE, which is also adaptable thanks to its modular nature, and show it can manage graphs with skewed power-law degree distributions.
Keyword:
Graph alignment
graph mining
graph matching
network alignment

期刊

ACM Transactions on Knowledge Discovery from Data 封面图
ACM Transactions on Knowledge Discovery from Data
IF:
4.8
论文数:
1.3K
被引数:
4.4K

机构

A
alphabet inc.
学者数:
1.1K
论文数: 663
被引数: 0
A
Aarhus University
学者数:
4.3W
论文数: 4.2W
被引数: 4.8W
M
Max Planck Society
学者数:
8.2W
论文数: 7.7W
被引数: 3.3W
G
Google Incorporated
学者数:
3.5K
论文数: 1.8K
被引数: 8
学者 查看更多机构
引用论文

引用论文

err
IF0
err
err0
PREAI
err
err分享
err收藏
err分享
err收藏
Combined application of mixture experimental design and artificial neural networks in the solid dispersion development
err2015-06-11
err0
PREAI
errDjordje P. Medarević; Peter Kleinebudde; Jelena Djuriš; Zorica Djurić; Svetlana Ibrić
err分享
err收藏
学者 查看更多内容