.png){kind=icon}
返回
The graph matching problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s10044-012-0284-8.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we propose a survey concerning the state of the art of the graph matching problem, conceived as the most important element in the definition of inductive inference engines in graph-based pattern recognition applications. We review both methodological and algorithmic results, focusing on inexact graph matching procedures. We consider different classes of graphs that are roughly differentiated considering the complexity of the defined labels for both vertices and edges. Emphasis will be given to the understanding of the underlying methodological aspects of each identified research branch. A selection of inexact graph matching algorithms is proposed and synthetically described, aiming at explaining some significant instances of each graph matching methodology mainly considered in the technical literature.
Keyword:
Graph-based pattern recognition
Inexact graph matching
Graph edit distance
Graph kernels
Graph embedding
期刊
IF:
2
论文数:
1.9K
被引数:
1.9K
机构
引用论文
分享收藏Does it take older adults longer than younger adults to perceptually segregate a speech target from a background masker?在感知上将语音目标与背景掩蔽器隔离开来是否需要老年人比年轻人更长的时间？
PREAI
分享收藏
分享收藏A Statistical Physics Perspective to Understand Social Visual Attention in Autism Spectrum Disorder.png)
Perception
PerceptionIF0
PREAI
分享收藏
查看更多内容