On the relation between graph distance and Euclidean distance in random geometric graphs.
Josep DíazDieter MitscheGuillem PerarnauXavier Pérez-GiménezPublished in: CoRR (2014)
Keyphrases
- euclidean distance
- heat kernel
- neighborhood graph
- graph theoretical
- graph representation
- graph theory
- distance measure
- weighted graph
- directed graph
- graph construction
- distance metric
- distance function
- topological information
- graph matching
- graph structure
- adjacency matrix
- graph databases
- manhattan distance
- graph mining
- graph model
- mahalanobis distance
- data points
- bipartite graph
- subgraph isomorphism
- graph clustering
- graph data
- similarity measurement
- euclidean space
- geodesic distance
- undirected graph
- edge weights
- cosine distance
- feature vectors
- similarity measure
- graph partitioning
- dimensionality reduction
- minimum distance
- dynamic time warping
- knn
- random walk
- distance matrix
- spanning tree
- fuzzy c means
- graph kernels
- minimum spanning tree
- image processing
- neighborhood structure
- graph laplacian
- distance measurement
- complex networks
- feature extraction