Aarhus University Seal / Aarhus Universitets segl

GRASP: Graph Alignment through Spectral Signatures

Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

Dokumenter

DOI

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 paper, 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. Our experimental study, featuring noise levels higher than anything used in previous studies, shows that GRASP outperforms state-of-the-art methods for graph alignment across noise levels and graph types.
OriginalsprogEngelsk
TitelWeb and Big Data
RedaktørerL Hou U, M Spaniol, Y Sakurai, J Chen
Antal sider9
ForlagSpringer
Udgivelsesår10 jun. 2021
Sider44-52
ISBN (trykt)978-3-030-85896-4
DOI
StatusUdgivet - 10 jun. 2021
SerietitelLecture Notes in Computer Science
Vol/bind12858
ISSN0302-9743

    Forskningsområder

  • cs.IR

Se relationer på Aarhus Universitet Citationsformater

Download-statistik

Ingen data tilgængelig

ID: 222515976