High-Order Relation Construction and Mining for Graph Matching

by   Hui Xu, et al.

Graph matching pairs corresponding nodes across two or more graphs. The problem is difficult as it is hard to capture the structural similarity across graphs, especially on large graphs. We propose to incorporate high-order information for matching large-scale graphs. Iterated line graphs are introduced for the first time to describe such high-order information, based on which we present a new graph matching method, called High-order Graph Matching Network (HGMN), to learn not only the local structural correspondence, but also the hyperedge relations across graphs. We theoretically prove that iterated line graphs are more expressive than graph convolution networks in terms of aligning nodes. By imposing practical constraints, HGMN is made scalable to large-scale graphs. Experimental results on a variety of settings have shown that, HGMN acquires more accurate matching results than the state-of-the-art, verifying our method effectively captures the structural similarity across different graphs.


page 1

page 2

page 3

page 4


Efficient and High-Quality Seeded Graph Matching: Employing High Order Structural Information

Driven by many real applications, we study the problem of seeded graph m...

iGraphMatch: an R Package for the Analysis of Graph Matching

iGraphMatch is an R package for finding corresponding vertices between t...

Measuring Similarity of Graphs and their Nodes by Neighbor Matching

The problem of measuring similarity of graphs and their nodes is importa...

Dynamic Structural Similarity on Graphs

One way of characterizing the topological and structural properties of v...

Confluent Vessel Trees with Accurate Bifurcations

We are interested in unsupervised reconstruction of complex near-capilla...

K-Core Decomposition on Super Large Graphs with Limited Resources

K-core decomposition is a commonly used metric to analyze graph structur...

GraphMatch: Efficient Large-Scale Graph Construction for Structure from Motion

We present GraphMatch, an approximate yet efficient method for building ...