A novel way to formalize stable graph cores by using matching-graphs

作者：

Highlights：

• We propose a new data structure called matching-graph, that incorporates the similarity core of two graphs.

• We present both, a distance based classifier and a graph embedding kernel based on the novel matching-graphs.

• We confirm a significant improvement of classification algorithms that directly, or indirectly, use matching-graphs.

摘要

•We propose a new data structure called matching-graph, that incorporates the similarity core of two graphs.•We present both, a distance based classifier and a graph embedding kernel based on the novel matching-graphs.•We confirm a significant improvement of classification algorithms that directly, or indirectly, use matching-graphs.

论文关键词：Graph matching,Matching-graphs,Graph edit distance,Structural pattern recognition

论文评审过程：Received 14 January 2022, Revised 18 May 2022, Accepted 9 June 2022, Available online 11 June 2022, Version of Record 16 June 2022.

论文官网地址：https://doi.org/10.1016/j.patcog.2022.108846