{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/subgraph-neighboring-relations-infomax-for","title":"Subgraph Neighboring Relations Infomax for Inductive Link Prediction on Knowledge Graphs","arxiv_id":"2208.00850","date":"2022-07-28","proceeding":null,"authors":["Xiaohan Xu","Peng Zhang","Yongquan He","Chengpeng Chao","Chaoyang Yan"],"abstract":"Inductive link prediction for knowledge graph aims at predicting missing links between unseen entities, those not shown in training stage. Most previous works learn entity-specific embeddings of entities, which cannot handle unseen entities. Recent several methods utilize enclosing subgraph to obtain inductive ability. However, all these works only consider the enclosing part of subgraph without complete neighboring relations, which leads to the issue that partial neighboring relations are neglected, and sparse subgraphs are hard to be handled. To address that, we propose Subgraph Neighboring Relations Infomax, SNRI, which sufficiently exploits complete neighboring relations from two aspects: neighboring relational feature for node feature and neighboring relational path for sparse subgraph. To further model neighboring relations in a global way, we innovatively apply mutual information (MI) maximization for knowledge graph. Experiments show that SNRI outperforms existing state-of-art methods by a large margin on inductive link prediction task, and verify the effectiveness of exploring complete neighboring relations in a global way to characterize node features and reason on sparse subgraphs.","url_abs":"https://arxiv.org/abs/2208.00850v3","url_pdf":"https://arxiv.org/pdf/2208.00850v3.pdf","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":"subgraph-neighboring-relations-infomax-for","repo_url":"https://github.com/Tebmer/SNRI","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"inductive-link-prediction","task_name":"Inductive Link Prediction"},{"task_slug":"knowledge-graphs","task_name":"Knowledge Graphs"},{"task_slug":"link-prediction","task_name":"Link Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2208.00850","atlas_url":"https://app.syntology.ai/?focus=2208.00850","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.00850"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Tebmer/SNRI","reach":null}],"summary":{"ran":7,"unverified":3},"by_repo_kind":{"official":{"samples":10,"ran":7,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":10,"samples":[{"code_sha256_prefix":"d46dff6f46c30ccc","entry":"Aggregator","repo":"Tebmer/SNRI","repo_kind":"official","path":"model/dgl/graph_classifier.py","file_url":"https://github.com/Tebmer/SNRI/blob/HEAD/model/dgl/graph_classifier.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"d46dff6f46c30ccc"}},{"code_sha256_prefix":"3435ce02c9a39883","entry":"BatchGRU","repo":"Tebmer/SNRI","repo_kind":"official","path":"model/dgl/graph_classifier.py","file_url":"https://github.com/Tebmer/SNRI/blob/HEAD/model/dgl/graph_classifier.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"3435ce02c9a39883"}},{"code_sha256_prefix":"d58499a1c7e73bae","entry":"Discriminator","repo":"Tebmer/SNRI","repo_kind":"official","path":"model/dgl/graph_classifier.py","file_url":"https://github.com/Tebmer/SNRI/blob/HEAD/model/dgl/graph_classifier.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"d58499a1c7e73bae"}},{"code_sha256_prefix":"8a3af90773c72327","entry":"GRUAggregator","repo":"Tebmer/SNRI","repo_kind":"official","path":"model/dgl/graph_classifier.py","file_url":"https://github.com/Tebmer/SNRI/blob/HEAD/model/dgl/graph_classifier.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"8a3af90773c72327"}},{"code_sha256_prefix":"df20ae228378ef18","entry":"Identity","repo":"Tebmer/SNRI","repo_kind":"official","path":"model/dgl/graph_classifier.py","file_url":"https://github.com/Tebmer/SNRI/blob/HEAD/model/dgl/graph_classifier.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"df20ae228378ef18"}},{"code_sha256_prefix":"82fd85090dac6db9","entry":"MLPAggregator","repo":"Tebmer/SNRI","repo_kind":"official","path":"model/dgl/graph_classifier.py","file_url":"https://github.com/Tebmer/SNRI/blob/HEAD/model/dgl/graph_classifier.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"82fd85090dac6db9"}},{"code_sha256_prefix":"89a158e1fe91f82a","entry":"SumAggregator","repo":"Tebmer/SNRI","repo_kind":"official","path":"model/dgl/graph_classifier.py","file_url":"https://github.com/Tebmer/SNRI/blob/HEAD/model/dgl/graph_classifier.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"89a158e1fe91f82a"}},{"code_sha256_prefix":"9771c2055d849ed6","entry":"GraphClassifier","repo":"Tebmer/SNRI","repo_kind":"official","path":"model/dgl/graph_classifier.py","file_url":"https://github.com/Tebmer/SNRI/blob/HEAD/model/dgl/graph_classifier.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"9771c2055d849ed6"}},{"code_sha256_prefix":"73029d39434303a6","entry":"RGCN","repo":"Tebmer/SNRI","repo_kind":"official","path":"model/dgl/graph_classifier.py","file_url":"https://github.com/Tebmer/SNRI/blob/HEAD/model/dgl/graph_classifier.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"73029d39434303a6"}},{"code_sha256_prefix":"4eab4e0975e40901","entry":"RGCNLayer","repo":"Tebmer/SNRI","repo_kind":"official","path":"model/dgl/graph_classifier.py","file_url":"https://github.com/Tebmer/SNRI/blob/HEAD/model/dgl/graph_classifier.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"4eab4e0975e40901"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}