Transcription of Link Prediction Based on Graph Neural Networks
{{id}} {{{paragraph}}}
link Prediction Based on Graph Neural NetworksMuhan ZhangDepartment of CSEW ashington University in St. ChenDepartment of CSEW ashington University in St. Prediction is a key problem for network -structured data. link predictionheuristics use some score functions, such as common neighbors and Katz index,to measure the likelihood of links. They have obtained wide practical uses due totheir simplicity, interpretability, and for some of them, scalability. However, everyheuristic has a strong assumption on when two nodes are likely to link , whichlimits their effectiveness on Networks where these assumptions fail.
However, it is shown that high-order heuristics such as rooted PageRank and Katz often have much better performance than first and second-order ones [6]. To effectively learn good high-order features, it seems that we need a very large hop number h so that the enclosing subgraph becomes the entire network.
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}