{"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":"/task/knowledge-graph-completion/papers/2","list_of":"/task/knowledge-graph-completion","task":"Knowledge Graph Completion","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":5,"rows_per_page":100,"rows":[101,200],"of":482,"counts":{"archive_papers_tagged":482,"with_a_code_link":251,"where_syntology_ran_a_sample":47,"not_listed_spam_title":0,"listed":482,"listed_where_code_ran":47,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":41,"every_run_a_failure_of_syntologys_instrument":6,"listed_with_a_run_with_no_instrument_failure":41,"listed_every_run_a_failure_of_syntologys_instrument":6,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/knowledge-graph-completion","prev":"/task/knowledge-graph-completion","next":"/task/knowledge-graph-completion/papers/3","papers":[{"url":"/paper/model-based-subsampling-for-knowledge-graph","slug":"model-based-subsampling-for-knowledge-graph","title":"Model-based Subsampling for Knowledge Graph Completion","date":"2023-09-17","arxiv_id":"2309.09296","repositories_listed":1,"syntology":null},{"url":"/paper/extending-transductive-knowledge-graph","slug":"extending-transductive-knowledge-graph","title":"Extending Transductive Knowledge Graph Embedding Models for Inductive Logical Relational Inference","date":"2023-09-07","arxiv_id":"2309.03773","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-large-language-models-for-knowledge","slug":"exploring-large-language-models-for-knowledge","title":"Exploring Large Language Models for Knowledge Graph Completion","date":"2023-08-26","arxiv_id":"2308.13916","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/exploring-large-language-models-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/2308.13916","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.13916"}},"official":{"repos":["yao8839836/kg-llm"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-comprehensive-study-on-knowledge-graph","slug":"a-comprehensive-study-on-knowledge-graph","title":"A Comprehensive Study on Knowledge Graph Embedding over Relational Patterns Based on Rule Learning","date":"2023-08-15","arxiv_id":"2308.07889","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-knowledge-graph-completion-with","slug":"inductive-knowledge-graph-completion-with","title":"Inductive Knowledge Graph Completion with GNNs and Rules: An Analysis","date":"2023-08-14","arxiv_id":"2308.07942","repositories_listed":1,"syntology":null},{"url":"/paper/maco-a-modality-adversarial-and-contrastive","slug":"maco-a-modality-adversarial-and-contrastive","title":"MACO: A Modality Adversarial and Contrastive Framework for Modality-missing Multi-modal Knowledge Graph Completion","date":"2023-08-13","arxiv_id":"2308.06696","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-temporal-knowledge-graph","slug":"a-survey-on-temporal-knowledge-graph","title":"A Survey on Temporal Knowledge Graph Completion: Taxonomy, Progress, and Prospects","date":"2023-08-04","arxiv_id":"2308.02457","repositories_listed":1,"syntology":null},{"url":"/paper/cause-towards-causal-knowledge-graph","slug":"cause-towards-causal-knowledge-graph","title":"CausE: Towards Causal Knowledge Graph Embedding","date":"2023-07-21","arxiv_id":"2307.11610","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-inferential-benchmarks-for","slug":"revisiting-inferential-benchmarks-for","title":"Revisiting Inferential Benchmarks for Knowledge Graph Completion","date":"2023-06-07","arxiv_id":"2306.04814","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/revisiting-inferential-benchmarks-for#ran","syntology_url":"https://syntology.ai/paper/2306.04814","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.04814"}},"official":{"repos":["shuwen-liu-ox/loginfer"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/ingram-inductive-knowledge-graph-embedding","slug":"ingram-inductive-knowledge-graph-embedding","title":"InGram: Inductive Knowledge Graph Embedding via Relation Graphs","date":"2023-05-31","arxiv_id":"2305.19987","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/ingram-inductive-knowledge-graph-embedding#ran","syntology_url":"https://syntology.ai/paper/2305.19987","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.19987"}},"official":{"repos":["bdi-lab/ingram"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/commonsense-knowledge-graph-completion-via","slug":"commonsense-knowledge-graph-completion-via","title":"Commonsense Knowledge Graph Completion Via Contrastive Pretraining and Node Clustering","date":"2023-05-26","arxiv_id":"2305.17019","repositories_listed":1,"syntology":null},{"url":"/paper/text-augmented-open-knowledge-graph","slug":"text-augmented-open-knowledge-graph","title":"Text-Augmented Open Knowledge Graph Completion via Pre-Trained Language Models","date":"2023-05-24","arxiv_id":"2305.15597","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/text-augmented-open-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2305.15597","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.15597"}},"official":{"repos":["pat-jj/tagreal"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/to-copy-rather-than-memorize-a-vertical","slug":"to-copy-rather-than-memorize-a-vertical","title":"To Copy Rather Than Memorize: A Vertical Learning Paradigm for Knowledge Graph Completion","date":"2023-05-23","arxiv_id":"2305.14126","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/to-copy-rather-than-memorize-a-vertical#ran","syntology_url":"https://syntology.ai/paper/2305.14126","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.14126"}},"official":{"repos":["rui9812/vlp"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/logical-entity-representation-in-knowledge","slug":"logical-entity-representation-in-knowledge","title":"Logical Entity Representation in Knowledge-Graphs for Differentiable Rule Learning","date":"2023-05-22","arxiv_id":"2305.12738","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/logical-entity-representation-in-knowledge#ran","syntology_url":"https://syntology.ai/paper/2305.12738","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.12738"}},"official":{"repos":["glaciohound/lerp"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/self-distillation-with-meta-learning-for-1","slug":"self-distillation-with-meta-learning-for-1","title":"Self-Distillation with Meta Learning for Knowledge Graph Completion","date":"2023-05-20","arxiv_id":"2305.12209","repositories_listed":1,"syntology":null},{"url":"/paper/investigating-the-effect-of-hard-negative","slug":"investigating-the-effect-of-hard-negative","title":"HaSa: Hardness and Structure-Aware Contrastive Knowledge Graph Embedding","date":"2023-05-17","arxiv_id":"2305.10563","repositories_listed":1,"syntology":null},{"url":"/paper/iteratively-learning-representations-for","slug":"iteratively-learning-representations-for","title":"Iteratively Learning Representations for Unseen Entities with Inter-Rule Correlations","date":"2023-05-17","arxiv_id":"2305.10531","repositories_listed":1,"syntology":null},{"url":"/paper/pre-trained-language-model-with-prompts-for","slug":"pre-trained-language-model-with-prompts-for","title":"Pre-trained Language Model with Prompts for Temporal Knowledge Graph Completion","date":"2023-05-13","arxiv_id":"2305.07912","repositories_listed":1,"syntology":null},{"url":"/paper/actc-active-threshold-calibration-for-cold","slug":"actc-active-threshold-calibration-for-cold","title":"ACTC: Active Threshold Calibration for Cold-Start Knowledge Graph Completion","date":"2023-05-10","arxiv_id":"2305.06395","repositories_listed":1,"syntology":null},{"url":"/paper/normalizing-flow-based-neural-process-for-few","slug":"normalizing-flow-based-neural-process-for-few","title":"Normalizing Flow-based Neural Process for Few-Shot Knowledge Graph Completion","date":"2023-04-17","arxiv_id":"2304.08183","repositories_listed":1,"syntology":null},{"url":"/paper/improving-few-shot-inductive-learning-on","slug":"improving-few-shot-inductive-learning-on","title":"Improving Few-Shot Inductive Learning on Temporal Knowledge Graphs using Confidence-Augmented Reinforcement Learning","date":"2023-04-02","arxiv_id":"2304.00613","repositories_listed":1,"syntology":null},{"url":"/paper/neural-compositional-rule-learning-for","slug":"neural-compositional-rule-learning-for","title":"Neural Compositional Rule Learning for Knowledge Graph Reasoning","date":"2023-03-07","arxiv_id":"2303.03581","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/neural-compositional-rule-learning-for#ran","syntology_url":"https://syntology.ai/paper/2303.03581","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.03581"}},"official":{"repos":["vivian1993/ncrl"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/knowledge-graph-completion-based-on-tensor","slug":"knowledge-graph-completion-based-on-tensor","title":"Knowledge Graph Completion based on Tensor Decomposition for Disease Gene Prediction","date":"2023-02-18","arxiv_id":"2302.09335","repositories_listed":1,"syntology":null},{"url":"/paper/nnkgc-improving-knowledge-graph-completion","slug":"nnkgc-improving-knowledge-graph-completion","title":"NNKGC: Improving Knowledge Graph Completion with Node Neighborhoods","date":"2023-02-13","arxiv_id":"2302.06132","repositories_listed":1,"syntology":null},{"url":"/paper/toward-degree-bias-in-embedding-based","slug":"toward-degree-bias-in-embedding-based","title":"Toward Degree Bias in Embedding-Based Knowledge Graph Completion","date":"2023-02-10","arxiv_id":"2302.05044","repositories_listed":1,"syntology":null},{"url":"/paper/double-permutation-equivariance-for-knowledge","slug":"double-permutation-equivariance-for-knowledge","title":"Double Equivariance for Inductive Link Prediction for Both New Nodes and New Relation Types","date":"2023-02-02","arxiv_id":"2302.01313","repositories_listed":1,"syntology":{"n":6,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 6 unverified","sample_list":"/paper/double-permutation-equivariance-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/2302.01313","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.01313"}},"official":{"repos":["purdueminds/isdea"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":6,"ran_from_kinds":[]}}},{"url":"/paper/can-persistent-homology-provide-an-efficient","slug":"can-persistent-homology-provide-an-efficient","title":"Can Persistent Homology provide an efficient alternative for Evaluation of Knowledge Graph Completion Methods?","date":"2023-01-30","arxiv_id":"2301.12929","repositories_listed":1,"syntology":null},{"url":"/paper/a-retrieve-and-read-framework-for-knowledge","slug":"a-retrieve-and-read-framework-for-knowledge","title":"A Retrieve-and-Read Framework for Knowledge Graph Link Prediction","date":"2022-12-19","arxiv_id":"2212.09724","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-relation-aware-neighborhood","slug":"efficient-relation-aware-neighborhood","title":"Efficient Relation-aware Neighborhood Aggregation in Graph Neural Networks via Tensor Decomposition","date":"2022-12-11","arxiv_id":"2212.05581","repositories_listed":1,"syntology":null},{"url":"/paper/logic-and-commonsense-guided-temporal","slug":"logic-and-commonsense-guided-temporal","title":"Logic and Commonsense-Guided Temporal Knowledge Graph Completion","date":"2022-11-30","arxiv_id":"2211.16865","repositories_listed":1,"syntology":null},{"url":"/paper/kglm-integrating-knowledge-graph-structure-in","slug":"kglm-integrating-knowledge-graph-structure-in","title":"KGLM: Integrating Knowledge Graph Structure in Language Models for Link Prediction","date":"2022-11-04","arxiv_id":"2211.02744","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/kglm-integrating-knowledge-graph-structure-in#ran","syntology_url":"https://syntology.ai/paper/2211.02744","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.02744"}},"official":{"repos":["ibpa/kglm"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/search-to-pass-messages-for-temporal","slug":"search-to-pass-messages-for-temporal","title":"Search to Pass Messages for Temporal Knowledge Graph Completion","date":"2022-10-30","arxiv_id":"2210.16740","repositories_listed":1,"syntology":null},{"url":"/paper/palt-parameter-lite-transfer-of-language","slug":"palt-parameter-lite-transfer-of-language","title":"PALT: Parameter-Lite Transfer of Language Models for Knowledge Graph Completion","date":"2022-10-25","arxiv_id":"2210.13715","repositories_listed":1,"syntology":null},{"url":"/paper/adapters-for-enhanced-modeling-of","slug":"adapters-for-enhanced-modeling-of","title":"Adapters for Enhanced Modeling of Multilingual Knowledge and Text","date":"2022-10-24","arxiv_id":"2210.13617","repositories_listed":1,"syntology":null},{"url":"/paper/along-the-time-timeline-traced-embedding-for","slug":"along-the-time-timeline-traced-embedding-for","title":"Along the Time: Timeline-traced Embedding for Temporal Knowledge Graph Completion","date":"2022-10-17","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/joint-multilingual-knowledge-graph-completion","slug":"joint-multilingual-knowledge-graph-completion","title":"Joint Multilingual Knowledge Graph Completion and Alignment","date":"2022-10-17","arxiv_id":"2210.08922","repositories_listed":1,"syntology":null},{"url":"/paper/mose-modality-split-and-ensemble-for","slug":"mose-modality-split-and-ensemble-for","title":"MoSE: Modality Split and Ensemble for Multimodal Knowledge Graph Completion","date":"2022-10-17","arxiv_id":"2210.08821","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/mose-modality-split-and-ensemble-for#ran","syntology_url":"https://syntology.ai/paper/2210.08821","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.08821"}},"official":{"repos":["oreozhao/mose4mkgc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/mico-a-multi-alternative-contrastive-learning","slug":"mico-a-multi-alternative-contrastive-learning","title":"MICO: A Multi-alternative Contrastive Learning Framework for Commonsense Knowledge Representation","date":"2022-10-14","arxiv_id":"2210.07570","repositories_listed":1,"syntology":null},{"url":"/paper/relational-message-passing-for-fully","slug":"relational-message-passing-for-fully","title":"Relational Message Passing for Fully Inductive Knowledge Graph Completion","date":"2022-10-08","arxiv_id":"2210.03994","repositories_listed":1,"syntology":null},{"url":"/paper/learning-hierarchy-aware-quaternion-knowledge","slug":"learning-hierarchy-aware-quaternion-knowledge","title":"Learning Hierarchy-Aware Quaternion Knowledge Graph Embeddings with Representing Relations as 3D Rotations","date":"2022-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/joint-language-semantic-and-structure","slug":"joint-language-semantic-and-structure","title":"Joint Language Semantic and Structure Embedding for Knowledge Graph Completion","date":"2022-09-19","arxiv_id":"2209.08721","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-knowledge-graph-evaluation-under","slug":"rethinking-knowledge-graph-evaluation-under","title":"Rethinking Knowledge Graph Evaluation Under the Open-World Assumption","date":"2022-09-19","arxiv_id":"2209.08858","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-is-flat-a-seq2seq-generative","slug":"knowledge-is-flat-a-seq2seq-generative","title":"Knowledge Is Flat: A Seq2Seq Generative Framework for Various Knowledge Graph Completion","date":"2022-09-15","arxiv_id":"2209.07299","repositories_listed":1,"syntology":null},{"url":"/paper/learning-representations-for-hyper-relational","slug":"learning-representations-for-hyper-relational","title":"Learning Representations for Hyper-Relational Knowledge Graphs","date":"2022-08-30","arxiv_id":"2208.14322","repositories_listed":1,"syntology":null},{"url":"/paper/greenkgc-a-lightweight-knowledge-graph","slug":"greenkgc-a-lightweight-knowledge-graph","title":"GreenKGC: A Lightweight Knowledge Graph Completion Method","date":"2022-08-19","arxiv_id":"2208.09137","repositories_listed":1,"syntology":null},{"url":"/paper/kracl-contrastive-learning-with-graph-context","slug":"kracl-contrastive-learning-with-graph-context","title":"KRACL: Contrastive Learning with Graph Context Modeling for Sparse Knowledge Graph Completion","date":"2022-08-16","arxiv_id":"2208.07622","repositories_listed":1,"syntology":null},{"url":"/paper/refactor-gnns-revisiting-factorisation-based","slug":"refactor-gnns-revisiting-factorisation-based","title":"ReFactor GNNs: Revisiting Factorisation-based Models from a Message-Passing Perspective","date":"2022-07-20","arxiv_id":"2207.09980","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/refactor-gnns-revisiting-factorisation-based#ran","syntology_url":"https://syntology.ai/paper/2207.09980","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.09980"}},"official":{"repos":["yihong-chen/refactorgnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-borrow-relation-representation-2","slug":"learning-to-borrow-relation-representation-2","title":"Learning to Borrow– Relation Representation for Without-Mention Entity-Pairs for Knowledge Graph Completion","date":"2022-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/statik-structure-and-text-for-inductive","slug":"statik-structure-and-text-for-inductive","title":"StATIK: Structure and Text for Inductive Knowledge Graph Completion","date":"2022-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/comdense-combined-dense-embedding-of-relation","slug":"comdense-combined-dense-embedding-of-relation","title":"ComDensE : Combined Dense Embedding of Relation-aware and Common Features for Knowledge Graph Completion","date":"2022-06-29","arxiv_id":"2206.14925","repositories_listed":1,"syntology":null},{"url":"/paper/er-equivariance-regularizer-for-knowledge","slug":"er-equivariance-regularizer-for-knowledge","title":"ER: Equivariance Regularizer for Knowledge Graph Completion","date":"2022-06-24","arxiv_id":"2206.12142","repositories_listed":1,"syntology":null},{"url":"/paper/geometry-interaction-knowledge-graph","slug":"geometry-interaction-knowledge-graph","title":"Geometry Interaction Knowledge Graph Embeddings","date":"2022-06-24","arxiv_id":"2206.12418","repositories_listed":1,"syntology":{"n":14,"n_ran":13,"n_constructed":3,"n_ran_checked":3,"n_instrument":10,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":14,"phrase":"13 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 10 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/geometry-interaction-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2206.12418","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.12418"}},"official":{"repos":["lion-zs/gie"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/expressive-a-spatio-functional-embedding-for","slug":"expressive-a-spatio-functional-embedding-for","title":"ExpressivE: A Spatio-Functional Embedding For Knowledge Graph Completion","date":"2022-06-08","arxiv_id":"2206.04192","repositories_listed":1,"syntology":null},{"url":"/paper/challenging-the-assumption-of-structure-based","slug":"challenging-the-assumption-of-structure-based","title":"Challenging the Assumption of Structure-based embeddings in Few- and Zero-shot Knowledge Graph Completion","date":"2022-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/enriching-hindi-wordnet-using-knowledge-graph","slug":"enriching-hindi-wordnet-using-knowledge-graph","title":"Enriching Hindi WordNet Using Knowledge Graph Completion Approach","date":"2022-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/relphormer-relational-graph-transformer-for","slug":"relphormer-relational-graph-transformer-for","title":"Relphormer: Relational Graph Transformer for Knowledge Graph Representations","date":"2022-05-22","arxiv_id":"2205.10852","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/relphormer-relational-graph-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2205.10852","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10852"}},"official":{"repos":["zjunlp/relphormer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/are-graph-neural-networks-really-helpful-for","slug":"are-graph-neural-networks-really-helpful-for","title":"Are Message Passing Neural Networks Really Helpful for Knowledge Graph Completion?","date":"2022-05-21","arxiv_id":"2205.10652","repositories_listed":1,"syntology":null},{"url":"/paper/hybrid-transformer-with-multi-level-fusion","slug":"hybrid-transformer-with-multi-level-fusion","title":"Hybrid Transformer with Multi-level Fusion for Multimodal Knowledge Graph Completion","date":"2022-05-04","arxiv_id":"2205.02357","repositories_listed":1,"syntology":null},{"url":"/paper/do-pre-trained-models-benefit-knowledge-graph-1","slug":"do-pre-trained-models-benefit-knowledge-graph-1","title":"Do Pre-trained Models Benefit Knowledge Graph Completion? A Reliable Evaluation and a Reasonable Approach","date":"2022-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/tempcaps-a-capsule-network-based-embedding","slug":"tempcaps-a-capsule-network-based-embedding","title":"TempCaps: A Capsule Network-based Embedding Model for Temporal Knowledge Graph Completion","date":"2022-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-borrow-relation-representation-1","slug":"learning-to-borrow-relation-representation-1","title":"Learning to Borrow -- Relation Representation for Without-Mention Entity-Pairs for Knowledge Graph Completion","date":"2022-04-27","arxiv_id":"2204.13097","repositories_listed":1,"syntology":null},{"url":"/paper/transher-translating-knowledge-graph","slug":"transher-translating-knowledge-graph","title":"TranSHER: Translating Knowledge Graph Embedding with Hyper-Ellipsoidal Restriction","date":"2022-04-27","arxiv_id":"2204.13221","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/transher-translating-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2204.13221","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.13221"}},"official":{"repos":["yizhilll/transher"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/temporal-knowledge-graph-reasoning-with-low","slug":"temporal-knowledge-graph-reasoning-with-low","title":"Temporal Knowledge Graph Reasoning with Low-rank and Model-agnostic Representations","date":"2022-04-10","arxiv_id":"2204.04783","repositories_listed":1,"syntology":null},{"url":"/paper/multilingual-knowledge-graph-completion-with-1","slug":"multilingual-knowledge-graph-completion-with-1","title":"Multilingual Knowledge Graph Completion with Self-Supervised Adaptive Graph Alignment","date":"2022-03-28","arxiv_id":"2203.14987","repositories_listed":1,"syntology":{"n":13,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/multilingual-knowledge-graph-completion-with-1#ran","syntology_url":"https://syntology.ai/paper/2203.14987","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.14987"}},"official":{"repos":["amzn/ss-aga-kgc"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/sequence-to-sequence-knowledge-graph-1","slug":"sequence-to-sequence-knowledge-graph-1","title":"Sequence-to-Sequence Knowledge Graph Completion and Question Answering","date":"2022-03-19","arxiv_id":"2203.10321","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/sequence-to-sequence-knowledge-graph-1#ran","syntology_url":"https://syntology.ai/paper/2203.10321","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.10321"}},"official":{"repos":["apoorvumang/kgt5"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/cake-a-scalable-commonsense-aware-framework","slug":"cake-a-scalable-commonsense-aware-framework","title":"CAKE: A Scalable Commonsense-Aware Framework For Multi-View Knowledge Graph Completion","date":"2022-02-25","arxiv_id":"2202.13785","repositories_listed":1,"syntology":null},{"url":"/paper/from-discrimination-to-generation-knowledge","slug":"from-discrimination-to-generation-knowledge","title":"From Discrimination to Generation: Knowledge Graph Completion with Generative Transformer","date":"2022-02-04","arxiv_id":"2202.02113","repositories_listed":1,"syntology":null},{"url":"/paper/trustworthy-knowledge-graph-completion-based","slug":"trustworthy-knowledge-graph-completion-based","title":"Trustworthy Knowledge Graph Completion Based on Multi-sourced Noisy Data","date":"2022-01-21","arxiv_id":"2201.08580","repositories_listed":1,"syntology":null},{"url":"/paper/lp-bert-multi-task-pre-training-knowledge","slug":"lp-bert-multi-task-pre-training-knowledge","title":"Multi-task Pre-training Language Model for Semantic Network Completion","date":"2022-01-13","arxiv_id":"2201.04843","repositories_listed":1,"syntology":null},{"url":"/paper/self-attention-presents-low-dimensional","slug":"self-attention-presents-low-dimensional","title":"Self-attention Presents Low-dimensional Knowledge Graph Embeddings for Link Prediction","date":"2021-12-20","arxiv_id":"2112.10644","repositories_listed":1,"syntology":null},{"url":"/paper/two-view-graph-neural-networks-for-knowledge","slug":"two-view-graph-neural-networks-for-knowledge","title":"Two-view Graph Neural Networks for Knowledge Graph Completion","date":"2021-12-16","arxiv_id":"2112.09231","repositories_listed":1,"syntology":null},{"url":"/paper/qubite-qubit-embedding-for-knowledge-graph","slug":"qubite-qubit-embedding-for-knowledge-graph","title":"QubitE: Qubit Embedding for Knowledge Graph Completion","date":"2021-11-16","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/time-in-a-box-advancing-knowledge-graph","slug":"time-in-a-box-advancing-knowledge-graph","title":"Time in a Box: Advancing Knowledge Graph Completion with Temporal Scopes","date":"2021-11-12","arxiv_id":"2111.06854","repositories_listed":1,"syntology":null},{"url":"/paper/parallel-training-of-knowledge-graph","slug":"parallel-training-of-knowledge-graph","title":"Parallel Training of Knowledge Graph Embedding Models: A Comparison of Techniques","date":"2021-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/rmna-a-neighbor-aggregation-based-knowledge","slug":"rmna-a-neighbor-aggregation-based-knowledge","title":"RMNA: A Neighbor Aggregation-Based Knowledge Graph Representation Learning Model Using Rule Mining","date":"2021-11-01","arxiv_id":"2111.00658","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-heterogeneous-hierarchies-with","slug":"modeling-heterogeneous-hierarchies-with","title":"Modeling Heterogeneous Hierarchies with Relation-specific Hyperbolic Cones","date":"2021-10-28","arxiv_id":"2110.14923","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/modeling-heterogeneous-hierarchies-with#ran","syntology_url":"https://syntology.ai/paper/2110.14923","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14923"}},"official":{"repos":["snap-stanford/ConE"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/smore-knowledge-graph-completion-and-multi","slug":"smore-knowledge-graph-completion-and-multi","title":"SMORE: Knowledge Graph Completion and Multi-hop Reasoning in Massive Knowledge Graphs","date":"2021-10-28","arxiv_id":"2110.14890","repositories_listed":1,"syntology":null},{"url":"/paper/vector-valued-distance-and-gyrocalculus-on","slug":"vector-valued-distance-and-gyrocalculus-on","title":"Vector-valued Distance and Gyrocalculus on the Space of Symmetric Positive Definite Matrices","date":"2021-10-26","arxiv_id":"2110.13475","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/vector-valued-distance-and-gyrocalculus-on#ran","syntology_url":"https://syntology.ai/paper/2110.13475","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.13475"}},"official":{"repos":["fedelopez77/gyrospd"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-topological-view-of-rule-learning-in","slug":"a-topological-view-of-rule-learning-in","title":"Cycle Representation Learning for Inductive Relation Prediction","date":"2021-10-06","arxiv_id":"2110.02510","repositories_listed":1,"syntology":null},{"url":"/paper/relation-prediction-as-an-auxiliary-training","slug":"relation-prediction-as-an-auxiliary-training","title":"Relation Prediction as an Auxiliary Training Objective for Improving Multi-Relational Graph Representations","date":"2021-10-06","arxiv_id":"2110.02834","repositories_listed":1,"syntology":null},{"url":"/paper/how-does-knowledge-graph-embedding","slug":"how-does-knowledge-graph-embedding","title":"How Does Knowledge Graph Embedding Extrapolate to Unseen Data: A Semantic Evidence View","date":"2021-09-24","arxiv_id":"2109.11800","repositories_listed":1,"syntology":null},{"url":"/paper/temporal-knowledge-graph-completion-using-box","slug":"temporal-knowledge-graph-completion-using-box","title":"Temporal Knowledge Graph Completion using Box Embeddings","date":"2021-09-18","arxiv_id":"2109.08970","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/temporal-knowledge-graph-completion-using-box#ran","syntology_url":"https://syntology.ai/paper/2109.08970","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.08970"}},"official":null}},{"url":"/paper/are-missing-links-predictable-an-inferential","slug":"are-missing-links-predictable-an-inferential","title":"Are Missing Links Predictable? An Inferential Benchmark for Knowledge Graph Completion","date":"2021-08-03","arxiv_id":"2108.01387","repositories_listed":1,"syntology":null},{"url":"/paper/metap-meta-pattern-learning-for-one-shot","slug":"metap-meta-pattern-learning-for-one-shot","title":"MetaP: Meta Pattern Learning for One-Shot Knowledge Graph Completion","date":"2021-07-11","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/robust-knowledge-graph-completion-with","slug":"robust-knowledge-graph-completion-with","title":"Robust Knowledge Graph Completion with Stacked Convolutions and a Student Re-Ranking Network","date":"2021-06-11","arxiv_id":"2106.06555","repositories_listed":1,"syntology":null},{"url":"/paper/integrating-lexical-information-into-entity","slug":"integrating-lexical-information-into-entity","title":"Integrating Lexical Information into Entity Neighbourhood Representations for Relation Prediction","date":"2021-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/temporal-knowledge-graph-completion-using-a","slug":"temporal-knowledge-graph-completion-using-a","title":"Temporal Knowledge Graph Completion using a Linear Temporal Regularizer and Multivector Embeddings","date":"2021-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/quatde-dynamic-quaternion-embedding-for","slug":"quatde-dynamic-quaternion-embedding-for","title":"QuatDE: Dynamic Quaternion Embedding for Knowledge Graph Completion","date":"2021-05-19","arxiv_id":"2105.09002","repositories_listed":1,"syntology":null},{"url":"/paper/cafe-knowledge-graph-completion-using","slug":"cafe-knowledge-graph-completion-using","title":"CAFE: Knowledge graph completion using neighborhood-aware features","date":"2021-05-18","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/an-adversarial-transfer-network-for-knowledge","slug":"an-adversarial-transfer-network-for-knowledge","title":"An Adversarial Transfer Network for Knowledge Representation Learning","date":"2021-04-30","arxiv_id":"2104.14757","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/an-adversarial-transfer-network-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/2104.14757","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.14757"}},"official":{"repos":["LemonNoel/ATransN"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/relational-learning-with-gated-and-attentive","slug":"relational-learning-with-gated-and-attentive","title":"Relational Learning with Gated and Attentive Neighbor Aggregator for Few-Shot Knowledge Graph Completion","date":"2021-04-27","arxiv_id":"2104.13095","repositories_listed":1,"syntology":null},{"url":"/paper/tie-a-framework-for-embedding-based","slug":"tie-a-framework-for-embedding-based","title":"TIE: A Framework for Embedding-based Incremental Temporal Knowledge Graph Completion","date":"2021-04-17","arxiv_id":"2104.08419","repositories_listed":1,"syntology":null},{"url":"/paper/improving-hyper-relational-knowledge-graph","slug":"improving-hyper-relational-knowledge-graph","title":"Improving Hyper-Relational Knowledge Graph Completion","date":"2021-04-16","arxiv_id":"2104.08167","repositories_listed":1,"syntology":null},{"url":"/paper/neptune-neural-powered-tucker-network-for","slug":"neptune-neural-powered-tucker-network-for","title":"NePTuNe: Neural Powered Tucker Network for Knowledge Graph Completion","date":"2021-04-15","arxiv_id":"2104.07824","repositories_listed":1,"syntology":null},{"url":"/paper/node-co-occurrence-based-graph-neural","slug":"node-co-occurrence-based-graph-neural","title":"Node Co-occurrence based Graph Neural Networks for Knowledge Graph Link Prediction","date":"2021-04-15","arxiv_id":"2104.07396","repositories_listed":1,"syntology":null},{"url":"/paper/multiple-run-ensemble-learning-withlow","slug":"multiple-run-ensemble-learning-withlow","title":"Multiple Run Ensemble Learning with Low-Dimensional Knowledge Graph Embeddings","date":"2021-04-11","arxiv_id":"2104.05003","repositories_listed":1,"syntology":null},{"url":"/paper/text-guided-legal-knowledge-graph-reasoning","slug":"text-guided-legal-knowledge-graph-reasoning","title":"Text-guided Legal Knowledge Graph Reasoning","date":"2021-04-06","arxiv_id":"2104.02284","repositories_listed":1,"syntology":null},{"url":"/paper/ontozsl-ontology-enhanced-zero-shot-learning","slug":"ontozsl-ontology-enhanced-zero-shot-learning","title":"OntoZSL: Ontology-enhanced Zero-shot Learning","date":"2021-02-15","arxiv_id":"2102.07339","repositories_listed":1,"syntology":null},{"url":"/paper/a-shallow-neural-model-for-relation","slug":"a-shallow-neural-model-for-relation","title":"A shallow neural model for relation prediction","date":"2021-01-22","arxiv_id":"2101.09090","repositories_listed":1,"syntology":null},{"url":"/paper/learning-from-history-modeling-temporal","slug":"learning-from-history-modeling-temporal","title":"Learning from History: Modeling Temporal Knowledge Graphs with Sequential Copy-Generation Networks","date":"2020-12-15","arxiv_id":"2012.08492","repositories_listed":1,"syntology":null}],"record_sha256":"c264e98d4e2b6b6516cff96e751dcbafc0e8bdfea724628b479f4a3dd248d48a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}