Measuring similarity of graph nodes by neighbor matching.
Mladen NikolicPublished in: Intell. Data Anal. (2012)
Keyphrases
- learning algorithm
- measuring similarity
- graph structure
- directed graph
- graph matching
- similarity measure
- adjacency matrix
- graph structures
- weighted graph
- matching algorithm
- nodes of a graph
- betweenness centrality
- strongly connected
- undirected graph
- shortest path
- edge weights
- random walk
- maximum weight
- planar graphs
- small world
- spanning tree
- root node
- pairwise
- random graphs
- complex networks
- nearest neighbor
- connected graphs
- component analysis
- feature points
- graph mining
- labeled data