Constructing Graph Node Embeddings via Discrimination of Similarity Distributions.
Stanislav TsepaMaxim PanovPublished in: CoRR (2018)
Keyphrases
- graph structure
- directed graph
- distance measure
- finding the shortest path
- edge weights
- graph theory
- feature selection
- undirected graph
- similarity measure
- similarity graph
- similarity scores
- random walk
- similarity function
- directed acyclic graph
- binary codes
- bipartite graph
- tree structure
- random variables
- inexact graph matching
- probability distribution
- graph model
- normalized cut
- low dimensional
- betweenness centrality
- degree distribution
- root node
- path length
- high dimensional data
- graph matching
- vector space
- power law
- semantic similarity
- similarity matrix
- graphical models
- heavy tailed
- topological information
- probability measure
- strongly connected
- structured data
- weighted graph
- overlapping communities
- euclidean distance
- similarity metric
- feature space