NED: An Inter-Graph Node Metric Based On Edit Distance.
Haohan ZhuXianrui MengGeorge KolliosPublished in: CoRR (2016)
Keyphrases
- edit distance
- graph matching
- levenshtein distance
- graph edit distance
- triangle inequality
- subgraph isomorphism
- distance function
- distance measure
- graph structure
- adjacency matrix
- triangular inequality
- directed graph
- cosine distance
- edit operations
- string matching
- undirected graph
- string edit distance
- approximate string matching
- edge weights
- approximate matching
- similarity measure
- dissimilarity measure
- graph representation
- tree structure
- pattern recognition
- directed acyclic graph
- tree structured data
- tree edit distance
- string similarity
- normalized edit distance
- finite alphabet
- metric space
- point sets
- matching algorithm
- dynamic programming
- object recognition
- graph clustering
- quality metrics
- weighted graph
- random walk
- nearest neighbor
- graph mining
- graph kernels
- computer vision
- structured data
- similarity search
- pairwise
- feature selection