Graph Matching Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - ". ----" to ". ----") |
(→2003) |
||
| Line 30: | Line 30: | ||
[[Category:Concept]] | [[Category:Concept]] | ||
[[Category:Machine Learning]] | [[Category:Machine Learning]] | ||
Latest revision as of 04:47, 2 April 2022
A Graph Matching Algorithm is a graph search algorithm that can be implemented by a graph matching system to solve a graph matching task.
- Context:
- It can be applied by a Graph Matching System.
- It can make use of a Graph Distance Function.
- It can range from being an Exact Graph Matching Algorithm to being an Approximate Graph Matching Algorithm.
- …
- Example(s):
- Counter-Example(s):
- See: Graph Thoery, Combinatorial Optimization Algorithm.
References
2003a
- (Giunchiglia & Shvaiko, 2003) ⇒ Fausto Giunchiglia, and Pavel Shvaiko. (2003). “Semantic Matching.” In: The Knowledge Engineering Review, 18.
2003
- (Massaro & Pelillo, 2003) ⇒ Alessio Massaro, and Marcello Pelillo. (2003). “Matching Graphs by Pivoting.” In: Pattern Recognition Letters Journal, 24(8). doi:10.1016/S0167-8655(02)00256-8