Exact and approximate graph matching using random walks
In this paper, we propose a general framework for graph matching which is suitable for different problems of pattern recognition. The pattern representation we assume is at the same time highly structured, like for classic syntactic and structural approaches, and of subsymbolic nature with real-valu...
| Veröffentlicht in: | IEEE transactions on pattern analysis and machine intelligence. - 1998. - 27(2005), 7 vom: 01. Juli, Seite 1100-11 |
|---|---|
| 1. Verfasser: | |
| Weitere Verfasser: | , |
| Format: | Aufsatz |
| Sprache: | English |
| Veröffentlicht: |
2005
|
| Zugriff auf das übergeordnete Werk: | IEEE transactions on pattern analysis and machine intelligence |
| Schlagworte: | Comparative Study Evaluation Study Journal Article Research Support, Non-U.S. Gov't |