Diffusion profile embedding as a basis for graph vertex similarity.
Scott PayneEdgar FullerGeorge SpirouCun-Quan ZhangPublished in: Netw. Sci. (2021)
Keyphrases
- directed graph
- undirected graph
- diffusion process
- labeled graphs
- edge weights
- similarity measure
- random walk
- hamiltonian cycle
- similarity function
- bipartite graph
- vertex set
- similarity scores
- spectral embedding
- weighted graph
- graph model
- spanning tree
- graph embedding
- maximum cardinality
- minimum weight
- strongly connected
- graph theory
- similarity graph
- average degree
- attributed graphs
- pairwise
- multidimensional scaling
- similarity matrix
- graph representation
- graph databases
- anisotropic diffusion
- semantic similarity
- distance function
- distance measure
- inexact graph matching
- nodes of a graph
- graph partitioning
- graph structure
- connected components
- betweenness centrality
- euclidean distance
- maximum common subgraph