Matching of Matching-Graphs - A Novel Approach for Graph Classification

被引:6
作者
Fuchs, Mathias [1 ]
Riesen, Kaspar [2 ]
机构
[1] Univ Bern, Inst Comp Sci, CH-3012 Bern, Switzerland
[2] Univ Appl Sci Northwestern Switzerland, Inst Informat Syst, CH-4600 Olten, Switzerland
来源
2020 25TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION (ICPR) | 2021年
基金
瑞士国家科学基金会;
关键词
Graph Matching; Matching-Graphs; Graph Edit Distance;
D O I
10.1109/ICPR48806.2021.9411926
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Due to fast developments in data acquisition, we observe rapidly increasing amounts of data available in diverse areas. Simultaneously, we observe that in many applications the underlying data is inherently complex, making graphs a very useful and adequate data structure for formal representation. A large amount of graph based methods for pattern recognition have been proposed. Many of these methods actually rely on graph matching. In the present paper a novel encoding of graph matching information is proposed. The idea of this encoding is to formalize the stable cores of specific classes by means of graphs. In an empirical evaluation we show that it can be highly beneficial to focus on these stable parts of graphs during graph classification.
引用
收藏
页码:6570 / 6576
页数:7
相关论文
共 23 条
[1]  
Borgwardt KM, 2007, PACIFIC SYMPOSIUM ON BIOCOMPUTING 2007, P4
[2]   Inexact graph matching for structural pattern recognition [J].
Bunke, H. ;
Allermann, G. .
PATTERN RECOGNITION LETTERS, 1983, 1 (04) :245-253
[3]   Thirty years of graph matching in pattern recognition [J].
Conte, D ;
Foggia, P ;
Sansone, C ;
Vento, M .
INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 2004, 18 (03) :265-298
[4]   Learning graph-matching edit-costs based on the optimality of the oracle's node correspondences [J].
Cortes, Xavier ;
Serratosa, Francesc .
PATTERN RECOGNITION LETTERS, 2015, 56 :22-29
[5]   Early Detection of Alzheimer's Disease: Detecting Asymmetries with a Return Random Walk Link Predictor [J].
Curado, Manuel ;
Escolano, Francisco ;
Lozano, Miguel A. ;
Hancock, Edwin R. .
ENTROPY, 2020, 22 (04)
[6]   Approximation of graph edit distance based on Hausdorff matching [J].
Fischer, Andreas ;
Suen, Ching Y. ;
Frinken, Volkmar ;
Riesen, Kaspar ;
Bunke, Horst .
PATTERN RECOGNITION, 2015, 48 (02) :331-343
[7]  
Fischer A, 2014, LECT NOTES COMPUT SC, V8621, P83, DOI 10.1007/978-3-662-44415-3_9
[8]   GRAPH MATCHING AND LEARNING IN PATTERN RECOGNITION IN THE LAST 10 YEARS [J].
Foggia, Pasquale ;
Percannella, Gennaro ;
Vento, Mario .
INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 2014, 28 (01)
[9]   Two new graphs kernels in chemoinformatics [J].
Gauezere, Benoit ;
Brun, Luc ;
Villemin, Didier .
PATTERN RECOGNITION LETTERS, 2012, 33 (15) :2038-2047
[10]  
Jiang XY, 2001, IEEE T PATTERN ANAL, V23, P1144