.png){kind=icon}
返回
Embedding the node-to-node mappings to learn the Graph edit distance parameters
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2018.08.026.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a learning method to automatically deduce the insertion, deletion and substitution costs of the Graph edit distance. The method is based on embedding the ground-truth node-to-node mappings into a Euclidean space and learning the edit costs through the hyperplane that splits the nodes into mapped ones and non-mapped ones in this new space. In this way, the algorithm does not need to compute any graph matching process, which is the main drawback of other methods due to its intrinsic exponential computational complexity. Nevertheless, our learning method has two main restrictions: 1) the insertion and deletion edit costs have to be constants; 2) the substitution edit costs have to be represented as inner products of two vectors. One vector represents certain weights and the other vector represents the distances between attributes. Experimental validation shows that the matching accuracy of this method outperforms the current methods. Furthermore, there is a significant reduction in the runtime in the learning process. (c) 2018 Elsevier B.V. All rights reserved.
Keyword:
COMPUTATION
RECOGNITION
OPTIMALITY
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
7.9K
被引数:
1.6W
机构
引用论文
Does it take older adults longer than younger adults to perceptually segregate a speech target from a background masker?在感知上将语音目标与背景掩蔽器隔离开来是否需要老年人比年轻人更长的时间？
PREAI
分享收藏分享收藏Graph-based representations and techniques for image processing and image analysis.png)
PATTERN RECOGNITION
OAAI
PATTERN RECOGNITIONIF7.6
OAAI分享收藏Approximate graph edit distance computation by means of bipartite graph matching通过二分图匹配计算近似图编辑距离
PREAI
分享收藏
查看更多内容