BIGMAT: A Distributed Affinity-Preserving Random Walk Strategy for Instance Matching on Knowledge Graphs.
Ali AssiHamid McheickWajdi DhifliPublished in: IEEE BigData (2019)
Keyphrases
- random walk
- directed graph
- hyper graph
- graph matching
- markov chain
- spectral methods
- average degree
- transition probabilities
- link prediction
- nodes of a graph
- web graph
- search algorithm
- machine learning
- distributed systems
- transition probability matrix
- markov random walk
- bipartite graph
- constraint satisfaction
- constraint satisfaction problems
- peer to peer
- pagerank algorithm
- pairwise
- multi db