2.5k citations · 4.3k across the 50 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2018★ 58 cited
M-Walk: Learning to Walk over Graphs using Monte Carlo Tree Search
Yelong Shen, Jianshu Chen, Po-Sen Huang +2
Learning to walk over a graph towards a target node for a given query and a source node is an important problem in applications such as knowledge base completion (KBC). It can be f…
cs.AI2016★ 7 cited
Link Prediction using Embedded Knowledge Graphs
Yelong Shen, Po-Sen Huang, Ming-Wei Chang +1
Since large knowledge bases are typically incomplete, missing facts need to be inferred from observed facts in a task called knowledge base completion. The most successful approach…