๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Bayesian graph edit distance

โœ Scribed by Myers, R.; Wison, R.C.; Hancock, E.R.

Book ID
117873655
Publisher
IEEE
Year
2000
Tongue
English
Weight
567 KB
Volume
22
Category
Article
ISSN
0162-8828

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A survey of graph edit distance
A survey of graph edit distance
โœ Xinbo Gao; Bing Xiao; Dacheng Tao; Xuelong Li ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 541 KB
HMM-based graph edit distance for image
HMM-based graph edit distance for image indexing
โœ Bing Xiao; Xinbo Gao; Dacheng Tao; Xuelong Li ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 386 KB ๐Ÿ‘ 1 views

## Abstract Most of the existing graph edit distance (GED) algorithms require cost functions which are difficult to be defined exactly. In this article, we propose a cost function free algorithm for computing GED. It only depends on the distribution of nodes rather than node or edge attributes in g