Graph Mover's Distance: An Efficiently Computable Distance Measure for Geometric Graphs.
Sushovan MajhiPublished in: CCCG (2023)
Keyphrases
- distance measure
- graph theoretical
- efficiently computable
- graph theory
- graph structure
- directed graph
- graph matching
- graph construction
- weighted graph
- euclidean distance
- graph model
- topological information
- graph databases
- upper bound
- graph mining
- similarity measure
- distance metric
- sufficient conditions
- undirected graph
- neighborhood graph
- bipartite graph
- graph kernels
- distance function
- vector space
- spanning tree
- vector representation
- dynamic time warping
- hausdorff distance
- random walk
- kullback leibler
- computationally hard
- hamming distance
- edge weights
- edit distance
- distance matrix
- nearest neighbor classifier
- pairwise
- bhattacharyya distance
- machine learning
- k nearest neighbor
- dimensionality reduction
- lower bound
- winnow algorithm