Constructing Graph Node Embeddings via Discrimination of Similarity Distributions.
Maxim PanovStanislav TsepaPublished in: ICDM Workshops (2018)
Keyphrases
- graph structure
- directed graph
- distance measure
- random walk
- undirected graph
- inexact graph matching
- similarity graph
- normalized cut
- tree structure
- nodes of a graph
- root node
- graph representation
- euclidean distance
- binary codes
- path length
- low dimensional
- graphical models
- weighted graph
- similarity scores
- overlapping communities
- graph model
- similarity measure
- directed acyclic graph
- random variables
- graph databases
- spanning tree
- bipartite graph
- edge weights
- semantic similarity
- probability distribution
- connected components
- vector space
- distance function
- kullback leibler divergence
- maximum common subgraph
- feature selection
- finding the shortest path
- dimensionality reduction
- similarity matrix
- similarity function
- graph matching
- euclidean space