Exact and Approximate Graph Matching Using Random Walks.
Marco GoriMarco MagginiLorenzo SartiPublished in: IEEE Trans. Pattern Anal. Mach. Intell. (2005)
Keyphrases
- random walk
- exact and approximate
- graph matching
- string matching
- edit distance
- pairwise
- object recognition
- lower bound
- pattern recognition
- point sets
- graph matching algorithm
- matching algorithm
- query evaluation
- markov chain
- pattern matching
- link prediction
- inexact graph matching
- dynamic programming
- branch and bound
- directed graph
- image matching
- lower and upper bounds
- point correspondences
- reinforcement learning
- machine learning
- vector space
- data management
- upper bound
- feature vectors
- feature extraction
- data sets