图 书 馆
加快图形编辑距离的计算与一个二分的启发式Speeding up Graph Edit Distance Computation with a Bipartite Heuristic |
|
| 课程网址: | http://videolectures.net/mlg07_riesen_sugedc/ |
| 主讲教师: | Kaspar Riesen |
| 开课单位: | 伯尔尼大学 |
| 开课时间: | 2007-09-05 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | In the present paper we aim at speeding up the computation of exact graph edit distance. We propose to combine the standard tree search approach to graph edit distance computation with the suboptimal procedure. The idea is to use a fast but suboptimal bipartite graph matching algorithm as a heuristic function that estimates the future costs. The overhead for computing this heuristic function is small, and easily compensated by the speed-up achieved in tree traversal. Since the heuristic function provides us with a lower bound of the future costs, it is guaranteed to return the exact graph edit distance of two given graphs. |
| 关 键 词: | 计算图形编辑距离; 树搜索方法; 次优过程; 二部图匹配算法 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2020-06-29：zyk |
| 阅读次数: | 136 |