{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/distance-enhanced-graph-neural-network-for","title":"Distance-Enhanced Graph Neural Network for Link Prediction","arxiv_id":null,"date":"2021-05-20","proceeding":"NA 2021 5","authors":["Boling Li","Yingce Xia","Shufang Xie","Lijun Wu","Tao Qin"],"abstract":"Link prediction, which is to predict the existence of a link/edge between two vertices in a graph, is a classical problem in machine learning. Intuitively, if it takes a long distance to walk from u to v along the existing edges, there should not be a link between them, and vice versa. This motivates us to explicitly combine the distance information with graph neural networks (GNNs) to improve link prediction. Calculating the distances between any two vertices (e.g., shortest path, expectation of random walk) in training is time consuming. To overcome this difficulty, we propose an anchorbased distance: First, we randomly select K anchor vertices from the graph and then calculate the shortest distances of all vertices in the graph to them. The distance between vertices u and v is estimated as the average of their distances to the K anchor vertices. After that, we feed the distance into the GNN module. Our method brings significant improvement for link prediction with few additional parameters. We achieved state-of-the-art result on the drug-drug-interaction (i.e., DDI) and protein-protein-association (i.e., PPA) tasks of OGB (Hu et al., 2020). Our code is available at https://github.com/lbn187/DLGNN.","url_abs":"https://www.dropbox.com/s/is3f4dfvtvnis7w/DEGNN_linkPrediction.pdf?dl=0","url_pdf":"https://www.dropbox.com/s/is3f4dfvtvnis7w/DEGNN_linkPrediction.pdf?dl=0","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"distance-enhanced-graph-neural-network-for","repo_url":"https://github.com/lbn187/DLGNN","is_official":0,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"graph-neural-network","task_name":"Graph Neural Network"},{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"link-property-prediction","task_name":"Link Property Prediction"},{"task_slug":"prediction","task_name":"Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/link-property-prediction-on-ogbl-ddi","task":"Link Property Prediction","dataset":"ogbl-ddi","model":"GraphSAGE+anchor distance","rank_in_archive_order":12,"of":31,"metrics":{"Ext. data":"No","Number of params":"3760134","Test Hits@20":"0.8239 ± 0.0437","Validation Hits@20":"0.8206 ± 0.0298"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"lbn187/DLGNN","kind":"named_in_paper","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"78d36b2c3620e1119a19c7b9b841fd813ce1571be1bba1ce4286ec1174258d2e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}