Convex Graph Invariant Relaxations For Graph Edit Distance.
Utkan Onur CandoganVenkat ChandrasekaranPublished in: CoRR (2019)
Keyphrases
- graph edit distance
- graph matching
- adjacency matrix
- convex relaxation
- graph kernels
- edit distance
- string edit distance
- convex optimization
- lower bound
- connected components
- graph representation
- np hard
- directed graph
- matching algorithm
- pattern recognition
- distance function
- graph model
- graph partitioning
- graph clustering
- random walk
- pairwise
- object recognition