{"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-graphs/papers/12","list_of":"/task/knowledge-graphs","task":"Knowledge Graphs","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":12,"pages_in_order":30,"rows_per_page":100,"rows":[1101,1200],"of":2974,"counts":{"archive_papers_tagged":2974,"with_a_code_link":1273,"where_syntology_ran_a_sample":234,"not_listed_spam_title":0,"listed":2974,"listed_where_code_ran":234,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":207,"every_run_a_failure_of_syntologys_instrument":27,"listed_with_a_run_with_no_instrument_failure":207,"listed_every_run_a_failure_of_syntologys_instrument":27,"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-graphs","prev":"/task/knowledge-graphs/papers/11","next":"/task/knowledge-graphs/papers/13","papers":[{"url":"/paper/unveiling-relations-in-the-industry-4-0","slug":"unveiling-relations-in-the-industry-4-0","title":"Unveiling Relations in the Industry 4.0 Standards Landscape based on Knowledge Graph Embeddings","date":"2020-06-03","arxiv_id":"2006.04556","repositories_listed":1,"syntology":null},{"url":"/paper/kgtk-a-toolkit-for-large-knowledge-graph","slug":"kgtk-a-toolkit-for-large-knowledge-graph","title":"KGTK: A Toolkit for Large Knowledge Graph Manipulation and Analysis","date":"2020-05-29","arxiv_id":"2006.00088","repositories_listed":1,"syntology":null},{"url":"/paper/mvin-learning-multiview-items-for","slug":"mvin-learning-multiview-items-for","title":"MVIN: Learning Multiview Items for Recommendation","date":"2020-05-26","arxiv_id":"2005.12516","repositories_listed":1,"syntology":null},{"url":"/paper/degree-aware-alignment-for-entities-in-tail","slug":"degree-aware-alignment-for-entities-in-tail","title":"Degree-Aware Alignment for Entities in Tail","date":"2020-05-25","arxiv_id":"2005.12132","repositories_listed":1,"syntology":null},{"url":"/paper/benchmarking-neural-embeddings-for-link","slug":"benchmarking-neural-embeddings-for-link","title":"Benchmarking neural embeddings for link prediction in knowledge graphs under semantic and structural changes","date":"2020-05-15","arxiv_id":"2005.07654","repositories_listed":1,"syntology":null},{"url":"/paper/neighborhood-matching-network-for-entity","slug":"neighborhood-matching-network-for-entity","title":"Neighborhood Matching Network for Entity Alignment","date":"2020-05-12","arxiv_id":"2005.05607","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-validation","slug":"knowledge-graph-validation","title":"Knowledge Graph Validation","date":"2020-05-04","arxiv_id":"2005.01389","repositories_listed":1,"syntology":null},{"url":"/paper/connecting-the-dots-a-knowledgeable-path","slug":"connecting-the-dots-a-knowledgeable-path","title":"Connecting the Dots: A Knowledgeable Path Generator for Commonsense Question Answering","date":"2020-05-02","arxiv_id":"2005.00691","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/connecting-the-dots-a-knowledgeable-path#ran","syntology_url":"https://syntology.ai/paper/2005.00691","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00691"}},"official":{"repos":["wangpf3/Commonsense-Path-Generator"],"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/knowledge-base-completion-baseline-strikes","slug":"knowledge-base-completion-baseline-strikes","title":"Knowledge Base Completion: Baseline strikes back (Again)","date":"2020-05-02","arxiv_id":"2005.00804","repositories_listed":1,"syntology":null},{"url":"/paper/seek-segmented-embedding-of-knowledge-graphs","slug":"seek-segmented-embedding-of-knowledge-graphs","title":"SEEK: Segmented Embedding of Knowledge Graphs","date":"2020-05-02","arxiv_id":"2005.00856","repositories_listed":1,"syntology":null},{"url":"/paper/temporal-knowledge-base-completion-new","slug":"temporal-knowledge-base-completion-new","title":"Temporal Knowledge Base Completion: New Algorithms and Evaluation Protocols","date":"2020-05-02","arxiv_id":"2005.05035","repositories_listed":1,"syntology":{"n":12,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":12,"phrase":"3 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; 2 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/temporal-knowledge-base-completion-new#ran","syntology_url":"https://syntology.ai/paper/2005.05035","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.05035"}},"official":{"repos":["dair-iitd/tkbi"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/a-joint-framework-for-inductive","slug":"a-joint-framework-for-inductive","title":"Explainable Link Prediction for Emerging Entities in Knowledge Graphs","date":"2020-05-01","arxiv_id":"2005.00637","repositories_listed":1,"syntology":null},{"url":"/paper/cross-lingual-entity-alignment-for-knowledge","slug":"cross-lingual-entity-alignment-for-knowledge","title":"Cross-lingual Entity Alignment with Incidental Supervision","date":"2020-05-01","arxiv_id":"2005.00171","repositories_listed":1,"syntology":null},{"url":"/paper/enriching-documents-with-compact","slug":"enriching-documents-with-compact","title":"Enriching Documents with Compact, Representative, Relevant Knowledge Graphs","date":"2020-05-01","arxiv_id":"2005.00153","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-empowered-entity-description","slug":"knowledge-graph-empowered-entity-description","title":"ENT-DESC: Entity Description Generation by Exploring Knowledge Graph","date":"2020-04-30","arxiv_id":"2004.14813","repositories_listed":1,"syntology":null},{"url":"/paper/semantic-triple-encoder-for-fast-open-set","slug":"semantic-triple-encoder-for-fast-open-set","title":"Structure-Augmented Text Representation Learning for Efficient Knowledge Graph Completion","date":"2020-04-30","arxiv_id":"2004.14781","repositories_listed":1,"syntology":null},{"url":"/paper/kacc-a-multi-task-benchmark-for-knowledge","slug":"kacc-a-multi-task-benchmark-for-knowledge","title":"KACC: A Multi-task Benchmark for Knowledge Abstraction, Concretization and Completion","date":"2020-04-28","arxiv_id":"2004.13631","repositories_listed":1,"syntology":null},{"url":"/paper/out-of-sample-representation-learning-for","slug":"out-of-sample-representation-learning-for","title":"Out-of-Sample Representation Learning for Multi-Relational Graphs","date":"2020-04-28","arxiv_id":"2004.13230","repositories_listed":1,"syntology":null},{"url":"/paper/transedge-translating-relation-contextualized","slug":"transedge-translating-relation-contextualized","title":"TransEdge: Translating Relation-contextualized Embeddings for Knowledge Graphs","date":"2020-04-22","arxiv_id":"2004.13579","repositories_listed":1,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/transedge-translating-relation-contextualized#ran","syntology_url":"https://syntology.ai/paper/2004.13579","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.13579"}},"official":{"repos":["nju-websoft/TransEdge"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/knowledge-graph-embedding-with-linear","slug":"knowledge-graph-embedding-with-linear","title":"LineaRE: Simple but Powerful Knowledge Graph Embedding for Link Prediction","date":"2020-04-21","arxiv_id":"2004.10037","repositories_listed":1,"syntology":null},{"url":"/paper/duplication-detection-in-knowledge-graphs","slug":"duplication-detection-in-knowledge-graphs","title":"Duplication Detection in Knowledge Graphs: Literature and Tools","date":"2020-04-17","arxiv_id":"2004.08257","repositories_listed":1,"syntology":null},{"url":"/paper/kdconv-a-chinese-multi-domain-dialogue","slug":"kdconv-a-chinese-multi-domain-dialogue","title":"KdConv: A Chinese Multi-domain Dialogue Dataset Towards Multi-turn Knowledge-driven Conversation","date":"2020-04-08","arxiv_id":"2004.04100","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/kdconv-a-chinese-multi-domain-dialogue#ran","syntology_url":"https://syntology.ai/paper/2004.04100","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.04100"}},"official":{"repos":["thu-coai/KdConv"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/answering-complex-queries-in-knowledge-graphs","slug":"answering-complex-queries-in-knowledge-graphs","title":"Answering Complex Queries in Knowledge Graphs with Bidirectional Sequence Encoders","date":"2020-04-06","arxiv_id":"2004.02596","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/answering-complex-queries-in-knowledge-graphs#ran","syntology_url":"https://syntology.ai/paper/2004.02596","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.02596"}},"official":null}},{"url":"/paper/the-graph-hawkes-network-for-reasoning-on","slug":"the-graph-hawkes-network-for-reasoning-on","title":"Graph Hawkes Neural Network for Forecasting on Temporal Knowledge Graphs","date":"2020-03-30","arxiv_id":"2003.13432","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"2 ran (of which 0 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","sample_list":"/paper/the-graph-hawkes-network-for-reasoning-on#ran","syntology_url":"https://syntology.ai/paper/2003.13432","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.13432"}},"official":{"repos":["Jeff20100601/GHNN_clean"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/end-to-end-entity-classification-on","slug":"end-to-end-entity-classification-on","title":"End-to-End Entity Classification on Multimodal Knowledge Graphs","date":"2020-03-25","arxiv_id":"2003.12383","repositories_listed":1,"syntology":null},{"url":"/paper/what-is-normal-what-is-strange-and-what-is","slug":"what-is-normal-what-is-strange-and-what-is","title":"What is Normal, What is Strange, and What is Missing in a Knowledge Graph: Unified Characterization via Inductive Summarization","date":"2020-03-23","arxiv_id":"2003.10412","repositories_listed":1,"syntology":null},{"url":"/paper/self-constructing-graph-convolutional","slug":"self-constructing-graph-convolutional","title":"Self-Constructing Graph Convolutional Networks for Semantic Labeling","date":"2020-03-15","arxiv_id":"2003.06932","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-logical-generalization-in-graph","slug":"evaluating-logical-generalization-in-graph","title":"Evaluating Logical Generalization in Graph Neural Networks","date":"2020-03-14","arxiv_id":"2003.06560","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-rule-learning-with-template","slug":"efficient-rule-learning-with-template","title":"Towards Learning Instantiated Logical Rules from Knowledge Graphs","date":"2020-03-13","arxiv_id":"2003.06071","repositories_listed":1,"syntology":null},{"url":"/paper/a-benchmarking-study-of-embedding-based","slug":"a-benchmarking-study-of-embedding-based","title":"A Benchmarking Study of Embedding-based Entity Alignment for Knowledge Graphs","date":"2020-03-10","arxiv_id":"2003.07743","repositories_listed":1,"syntology":null},{"url":"/paper/temporal-attribute-prediction-via-joint","slug":"temporal-attribute-prediction-via-joint","title":"Temporal Attribute Prediction via Joint Modeling of Multi-Relational Structure Evolution","date":"2020-03-09","arxiv_id":"2003.03919","repositories_listed":1,"syntology":null},{"url":"/paper/deeplens-deep-learning-for-entity","slug":"deeplens-deep-learning-for-entity","title":"DeepLENS: Deep Learning for Entity Summarization","date":"2020-03-08","arxiv_id":"2003.03736","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-role-of-conceptualization-in","slug":"on-the-role-of-conceptualization-in","title":"On the Role of Conceptualization in Commonsense Knowledge Graph Construction","date":"2020-03-06","arxiv_id":"2003.03239","repositories_listed":1,"syntology":null},{"url":"/paper/graph4code-a-machine-interpretable-knowledge","slug":"graph4code-a-machine-interpretable-knowledge","title":"A Toolkit for Generating Code Knowledge Graphs","date":"2020-02-21","arxiv_id":"2002.09440","repositories_listed":1,"syntology":null},{"url":"/paper/learning-dynamic-knowledge-graphs-to","slug":"learning-dynamic-knowledge-graphs-to","title":"Learning Dynamic Belief Graphs to Generalize on Text-Based Games","date":"2020-02-21","arxiv_id":"2002.09127","repositories_listed":1,"syntology":null},{"url":"/paper/how-to-avoid-being-eaten-by-a-grue","slug":"how-to-avoid-being-eaten-by-a-grue","title":"How To Avoid Being Eaten By a Grue: Exploration Strategies for Text-Adventure Agents","date":"2020-02-19","arxiv_id":"2002.08795","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/how-to-avoid-being-eaten-by-a-grue#ran","syntology_url":"https://syntology.ai/paper/2002.08795","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.08795"}},"official":{"repos":["rajammanabrolu/Q-BERT"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/interpretable-and-fair-comparison-of-link","slug":"interpretable-and-fair-comparison-of-link","title":"On the Ambiguity of Rank-Based Evaluation of Entity Alignment or Link Prediction Methods","date":"2020-02-17","arxiv_id":"2002.06914","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/interpretable-and-fair-comparison-of-link#ran","syntology_url":"https://syntology.ai/paper/2002.06914","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.06914"}},"official":{"repos":["mberr/rank-based-evaluation"],"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/rdfframes-knowledge-graph-access-for-machine","slug":"rdfframes-knowledge-graph-access-for-machine","title":"RDFFrames: Knowledge Graph Access for Machine Learning Tools","date":"2020-02-10","arxiv_id":"2002.03614","repositories_listed":1,"syntology":null},{"url":"/paper/message-passing-for-query-answering-over","slug":"message-passing-for-query-answering-over","title":"Message Passing Query Embedding","date":"2020-02-06","arxiv_id":"2002.02406","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/message-passing-for-query-answering-over#ran","syntology_url":"https://syntology.ai/paper/2002.02406","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.02406"}},"official":{"repos":["dfdazac/mpqe"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/knowledge-graph-embedding-for-link-prediction","slug":"knowledge-graph-embedding-for-link-prediction","title":"Knowledge Graph Embedding for Link Prediction: A Comparative Analysis","date":"2020-02-03","arxiv_id":"2002.00819","repositories_listed":1,"syntology":null},{"url":"/paper/mraea-an-efficient-and-robust-entity","slug":"mraea-an-efficient-and-robust-entity","title":"MRAEA: An Efficient and Robust Entity Alignment Approach for Cross-lingual Knowledge Graph","date":"2020-02-03","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-knowledge-graphs-representation","slug":"a-survey-on-knowledge-graphs-representation","title":"A Survey on Knowledge Graphs: Representation, Acquisition and Applications","date":"2020-02-02","arxiv_id":"2002.00388","repositories_listed":1,"syntology":null},{"url":"/paper/pretrained-transformers-for-simple-question","slug":"pretrained-transformers-for-simple-question","title":"Pretrained Transformers for Simple Question Answering over Knowledge Graphs","date":"2020-01-31","arxiv_id":"2001.11985","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-global-and-local-node-contexts-for","slug":"modeling-global-and-local-node-contexts-for","title":"Modeling Global and Local Node Contexts for Text Generation from Knowledge Graphs","date":"2020-01-29","arxiv_id":"2001.11003","repositories_listed":1,"syntology":null},{"url":"/paper/the-keen-universe-an-ecosystem-for-knowledge","slug":"the-keen-universe-an-ecosystem-for-knowledge","title":"The KEEN Universe: An Ecosystem for Knowledge Graph Embeddings with a Focus on Reproducibility and Transferability","date":"2020-01-28","arxiv_id":"2001.10560","repositories_listed":1,"syntology":null},{"url":"/paper/a-physical-embedding-model-for-knowledge","slug":"a-physical-embedding-model-for-knowledge","title":"A Physical Embedding Model for Knowledge Graphs","date":"2020-01-21","arxiv_id":"2001.07418","repositories_listed":1,"syntology":null},{"url":"/paper/bridging-knowledge-graphs-to-generate-scene","slug":"bridging-knowledge-graphs-to-generate-scene","title":"Bridging Knowledge Graphs to Generate Scene Graphs","date":"2020-01-07","arxiv_id":"2001.02314","repositories_listed":1,"syntology":null},{"url":"/paper/falcon-20-an-entity-and-relation-linking","slug":"falcon-20-an-entity-and-relation-linking","title":"Falcon 2.0: An Entity and Relation Linking Tool over Wikidata","date":"2019-12-24","arxiv_id":"1912.11270","repositories_listed":1,"syntology":null},{"url":"/paper/collective-embedding-based-entity-alignment","slug":"collective-embedding-based-entity-alignment","title":"Collective Entity Alignment via Adaptive Features","date":"2019-12-18","arxiv_id":"1912.08404","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-enriched-visual-storytelling","slug":"knowledge-enriched-visual-storytelling","title":"Knowledge-Enriched Visual Storytelling","date":"2019-12-03","arxiv_id":"1912.01496","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-knowledge-graph-completion","slug":"few-shot-knowledge-graph-completion","title":"Few-Shot Knowledge Graph Completion","date":"2019-11-26","arxiv_id":"1911.11298","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-alignment-network-with-gated","slug":"knowledge-graph-alignment-network-with-gated","title":"Knowledge Graph Alignment Network with Gated Multi-hop Neighborhood Aggregation","date":"2019-11-20","arxiv_id":"1911.08936","repositories_listed":1,"syntology":{"n":16,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/knowledge-graph-alignment-network-with-gated#ran","syntology_url":"https://syntology.ai/paper/1911.08936","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.08936"}},"official":{"repos":["nju-websoft/AliNet"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/rule-guided-compositional-representation","slug":"rule-guided-compositional-representation","title":"Rule-Guided Compositional Representation Learning on Knowledge Graphs","date":"2019-11-20","arxiv_id":"1911.08935","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-entity-alignment-with-graph","slug":"knowledge-graph-entity-alignment-with-graph","title":"Knowledge Graph Entity Alignment with Graph Convolutional Networks: Lessons Learned","date":"2019-11-19","arxiv_id":"1911.08342","repositories_listed":1,"syntology":null},{"url":"/paper/kepler-a-unified-model-for-knowledge","slug":"kepler-a-unified-model-for-knowledge","title":"KEPLER: A Unified Model for Knowledge Embedding and Pre-trained Language Representation","date":"2019-11-13","arxiv_id":"1911.06136","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/kepler-a-unified-model-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/1911.06136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.06136"}},"official":{"repos":["THU-KEG/KEPLER"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/predicting-microrna-disease-associations-from","slug":"predicting-microrna-disease-associations-from","title":"Tensor Decomposition with Relational Constraints for Predicting Multiple Types of MicroRNA-disease Associations","date":"2019-11-13","arxiv_id":"1911.05584","repositories_listed":1,"syntology":null},{"url":"/paper/decompressing-knowledge-graph-representations","slug":"decompressing-knowledge-graph-representations","title":"Decompressing Knowledge Graph Representations for Link Prediction","date":"2019-11-11","arxiv_id":"1911.04053","repositories_listed":1,"syntology":null},{"url":"/paper/interacte-improving-convolution-based","slug":"interacte-improving-convolution-based","title":"InteractE: Improving Convolution-based Knowledge Graph Embeddings by Increasing Feature Interactions","date":"2019-11-01","arxiv_id":"1911.00219","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"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 0 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","sample_list":"/paper/interacte-improving-convolution-based#ran","syntology_url":"https://syntology.ai/paper/1911.00219","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.00219"}},"official":{"repos":["malllabiisc/InteractE"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/semi-supervised-entity-alignment-via-joint","slug":"semi-supervised-entity-alignment-via-joint","title":"Semi-supervised Entity Alignment via Joint Knowledge Embedding Model and Cross-graph Model","date":"2019-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/drum-end-to-end-differentiable-rule-mining-on","slug":"drum-end-to-end-differentiable-rule-mining-on","title":"DRUM: End-To-End Differentiable Rule Mining On Knowledge Graphs","date":"2019-10-31","arxiv_id":"1911.00055","repositories_listed":1,"syntology":null},{"url":"/paper/building-dynamic-knowledge-graphs-from-text-2","slug":"building-dynamic-knowledge-graphs-from-text-2","title":"Building Dynamic Knowledge Graphs from Text-based Games","date":"2019-10-21","arxiv_id":"1910.09532","repositories_listed":1,"syntology":null},{"url":"/paper/using-a-kg-copy-network-for-non-goal-oriented","slug":"using-a-kg-copy-network-for-non-goal-oriented","title":"Using a KG-Copy Network for Non-Goal Oriented Dialogues","date":"2019-10-17","arxiv_id":"1910.07834","repositories_listed":1,"syntology":null},{"url":"/paper/aligning-cross-lingual-entities-with-multi","slug":"aligning-cross-lingual-entities-with-multi","title":"Aligning Cross-Lingual Entities with Multi-Aspect Information","date":"2019-10-15","arxiv_id":"1910.06575","repositories_listed":1,"syntology":null},{"url":"/paper/look-before-you-hop-conversational-question","slug":"look-before-you-hop-conversational-question","title":"Look before you Hop: Conversational Question Answering over Knowledge Graphs Using Judicious Context Expansion","date":"2019-10-08","arxiv_id":"1910.03262","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/look-before-you-hop-conversational-question#ran","syntology_url":"https://syntology.ai/paper/1910.03262","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.03262"}},"official":{"repos":["PhilippChr/CONVEX"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/exploiting-structural-and-semantic-context","slug":"exploiting-structural-and-semantic-context","title":"Commonsense Knowledge Base Completion with Structural and Semantic Context","date":"2019-10-07","arxiv_id":"1910.02915","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/exploiting-structural-and-semantic-context#ran","syntology_url":"https://syntology.ai/paper/1910.02915","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.02915"}},"official":null}},{"url":"/paper/dykgchat-benchmarking-dialogue-generation","slug":"dykgchat-benchmarking-dialogue-generation","title":"DyKgChat: Benchmarking Dialogue Generation Grounding on Dynamic Knowledge Graphs","date":"2019-10-01","arxiv_id":"1910.00610","repositories_listed":1,"syntology":null},{"url":"/paper/mdp-based-shallow-parsing-in-distantly","slug":"mdp-based-shallow-parsing-in-distantly","title":"Distantly Supervised Question Parsing","date":"2019-09-27","arxiv_id":"1909.12566","repositories_listed":1,"syntology":null},{"url":"/paper/representation-learning-with-ordered-relation","slug":"representation-learning-with-ordered-relation","title":"Representation Learning with Ordered Relation Paths for Knowledge Graph Completion","date":"2019-09-26","arxiv_id":"1909.11864","repositories_listed":1,"syntology":null},{"url":"/paper/tackling-long-tailed-relations-and-uncommon","slug":"tackling-long-tailed-relations-and-uncommon","title":"Tackling Long-Tailed Relations and Uncommon Entities in Knowledge Graph Completion","date":"2019-09-25","arxiv_id":"1909.11359","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/tackling-long-tailed-relations-and-uncommon#ran","syntology_url":"https://syntology.ai/paper/1909.11359","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.11359"}},"official":{"repos":["ZihaoWang/Few-shot-KGC"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/jointly-learning-entity-and-relation","slug":"jointly-learning-entity-and-relation","title":"Jointly Learning Entity and Relation Representations for Entity Alignment","date":"2019-09-20","arxiv_id":"1909.09317","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-scholarly-data-by-semantic-query-on","slug":"exploring-scholarly-data-by-semantic-query-on","title":"Exploring Scholarly Data by Semantic Query on Knowledge Graph Embedding Space","date":"2019-09-17","arxiv_id":"1909.08191","repositories_listed":1,"syntology":null},{"url":"/paper/rudas-synthetic-datasets-for-rule-learning","slug":"rudas-synthetic-datasets-for-rule-learning","title":"RuDaS: Synthetic Datasets for Rule Learning and Evaluation Tools","date":"2019-09-16","arxiv_id":"1909.07095","repositories_listed":1,"syntology":null},{"url":"/paper/how-to-make-latent-factors-interpretable-by","slug":"how-to-make-latent-factors-interpretable-by","title":"How to make latent factors interpretable by feeding Factorization machines with knowledge graphs","date":"2019-09-11","arxiv_id":"1909.05038","repositories_listed":1,"syntology":null},{"url":"/paper/identifying-and-explaining-discriminative","slug":"identifying-and-explaining-discriminative","title":"Identifying and Explaining Discriminative Attributes","date":"2019-09-05","arxiv_id":"1909.05363","repositories_listed":1,"syntology":null},{"url":"/paper/discovering-hypernymy-in-text-rich","slug":"discovering-hypernymy-in-text-rich","title":"Discovering Hypernymy in Text-Rich Heterogeneous Information Network by Exploiting Context Granularity","date":"2019-09-04","arxiv_id":"1909.01584","repositories_listed":1,"syntology":null},{"url":"/paper/meta-relational-learning-for-few-shot-link","slug":"meta-relational-learning-for-few-shot-link","title":"Meta Relational Learning for Few-Shot Link Prediction in Knowledge Graphs","date":"2019-09-04","arxiv_id":"1909.01515","repositories_listed":1,"syntology":null},{"url":"/paper/incorporating-domain-knowledge-into-medical","slug":"incorporating-domain-knowledge-into-medical","title":"Incorporating Domain Knowledge into Medical NLI using Knowledge Graphs","date":"2019-08-31","arxiv_id":"1909.00160","repositories_listed":1,"syntology":null},{"url":"/paper/neural-snowball-for-few-shot-relation","slug":"neural-snowball-for-few-shot-relation","title":"Neural Snowball for Few-Shot Relation Learning","date":"2019-08-29","arxiv_id":"1908.11007","repositories_listed":1,"syntology":null},{"url":"/paper/bayes-embedding-bem-refining-representation","slug":"bayes-embedding-bem-refining-representation","title":"Bayes EMbedding (BEM): Refining Representation by Integrating Knowledge Graphs and Behavior-specific Networks","date":"2019-08-28","arxiv_id":"1908.10611","repositories_listed":1,"syntology":null},{"url":"/paper/inducing-a-decision-tree-with-discriminative","slug":"inducing-a-decision-tree-with-discriminative","title":"Inducing a Decision Tree with Discriminative Paths to Classify Entities in a Knowledge Graph","date":"2019-08-22","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/relation-aware-entity-alignment-for","slug":"relation-aware-entity-alignment-for","title":"Relation-Aware Entity Alignment for Heterogeneous Knowledge Graphs","date":"2019-08-22","arxiv_id":"1908.08210","repositories_listed":1,"syntology":null},{"url":"/paper/message-passing-for-complex-question","slug":"message-passing-for-complex-question","title":"Message Passing for Complex Question Answering over Knowledge Graphs","date":"2019-08-19","arxiv_id":"1908.06917","repositories_listed":1,"syntology":null},{"url":"/paper/an-end-to-end-neighborhood-based-interaction","slug":"an-end-to-end-neighborhood-based-interaction","title":"An End-to-End Neighborhood-based Interaction Model for Knowledge-enhanced Recommendation","date":"2019-08-12","arxiv_id":"1908.04032","repositories_listed":1,"syntology":null},{"url":"/paper/drug-drug-interaction-prediction-based-on","slug":"drug-drug-interaction-prediction-based-on","title":"Drug-Drug Interaction Prediction Based on Knowledge Graph Embeddings and Convolutional-LSTM Network","date":"2019-08-04","arxiv_id":"1908.01288","repositories_listed":1,"syntology":null},{"url":"/paper/orometric-methods-in-bounded-metric-data","slug":"orometric-methods-in-bounded-metric-data","title":"Orometric Methods in Bounded Metric Data","date":"2019-07-22","arxiv_id":"1907.09239","repositories_listed":1,"syntology":null},{"url":"/paper/i-know-the-relationships-zero-shot-action","slug":"i-know-the-relationships-zero-shot-action","title":"I Know the Relationships: Zero-Shot Action Recognition via Two-Stream Graph Convolutional Networks and Knowledge Graphs","date":"2019-07-17","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/tackling-graphical-nlp-problems-with-graph","slug":"tackling-graphical-nlp-problems-with-graph","title":"Tackling Graphical NLP problems with Graph Recurrent Networks","date":"2019-07-13","arxiv_id":"1907.06142","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-aware-pronoun-coreference","slug":"knowledge-aware-pronoun-coreference","title":"Knowledge-aware Pronoun Coreference Resolution","date":"2019-07-08","arxiv_id":"1907.03663","repositories_listed":1,"syntology":null},{"url":"/paper/augmenting-and-tuning-knowledge-graph","slug":"augmenting-and-tuning-knowledge-graph","title":"Augmenting and Tuning Knowledge Graph Embeddings","date":"2019-07-01","arxiv_id":"1907.01068","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":0,"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/augmenting-and-tuning-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/1907.01068","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.01068"}},"official":{"repos":["mandt-lab/knowledge-graph-tuning"],"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/baracks-wife-hillary-using-knowledge-graphs-1","slug":"baracks-wife-hillary-using-knowledge-graphs-1","title":"Barack's Wife Hillary: Using Knowledge Graphs for Fact-Aware Language Modeling","date":"2019-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/uncovering-the-semantics-of-wikipedia","slug":"uncovering-the-semantics-of-wikipedia","title":"Uncovering the Semantics of Wikipedia Categories","date":"2019-06-28","arxiv_id":"1906.12089","repositories_listed":1,"syntology":null},{"url":"/paper/baracks-wife-hillary-using-knowledge-graphs","slug":"baracks-wife-hillary-using-knowledge-graphs","title":"Barack's Wife Hillary: Using Knowledge-Graphs for Fact-Aware Language Modeling","date":"2019-06-17","arxiv_id":"1906.07241","repositories_listed":1,"syntology":null},{"url":"/paper/cognitive-knowledge-graph-reasoning-for-one","slug":"cognitive-knowledge-graph-reasoning-for-one","title":"Cognitive Knowledge Graph Reasoning for One-shot Relational Learning","date":"2019-06-13","arxiv_id":"1906.05489","repositories_listed":1,"syntology":null},{"url":"/paper/comet-commonsense-transformers-for-automatic","slug":"comet-commonsense-transformers-for-automatic","title":"COMET: Commonsense Transformers for Automatic Knowledge Graph Construction","date":"2019-06-12","arxiv_id":"1906.05317","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/comet-commonsense-transformers-for-automatic#ran","syntology_url":"https://syntology.ai/paper/1906.05317","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.05317"}},"official":null}},{"url":"/paper/neural-variational-inference-for-estimating","slug":"neural-variational-inference-for-estimating","title":"Neural Variational Inference For Estimating Uncertainty in Knowledge Graph Embeddings","date":"2019-06-12","arxiv_id":"1906.04985","repositories_listed":1,"syntology":null},{"url":"/paper/reinforcement-knowledge-graph-reasoning-for","slug":"reinforcement-knowledge-graph-reasoning-for","title":"Reinforcement Knowledge Graph Reasoning for Explainable Recommendation","date":"2019-06-12","arxiv_id":"1906.05237","repositories_listed":1,"syntology":null},{"url":"/paper/multi-view-knowledge-graph-embedding-for","slug":"multi-view-knowledge-graph-embedding-for","title":"Multi-view Knowledge Graph Embedding for Entity Alignment","date":"2019-06-06","arxiv_id":"1906.02390","repositories_listed":1,"syntology":{"n":21,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":11,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/multi-view-knowledge-graph-embedding-for#ran","syntology_url":"https://syntology.ai/paper/1906.02390","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02390"}},"official":{"repos":["nju-websoft/MultiKE"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":11,"ran_from_kinds":["official"]}}},{"url":"/paper/190600411","slug":"190600411","title":"TechNet: Technology Semantic Network Based on Patent Data","date":"2019-06-02","arxiv_id":"1906.00411","repositories_listed":1,"syntology":null},{"url":"/paper/190600137","slug":"190600137","title":"Knowledge Hypergraphs: Prediction Beyond Binary Relations","date":"2019-06-01","arxiv_id":"1906.00137","repositories_listed":1,"syntology":null},{"url":"/paper/path-ranking-with-attention-to-type","slug":"path-ranking-with-attention-to-type","title":"Path Ranking with Attention to Type Hierarchies","date":"2019-05-26","arxiv_id":"1905.10799","repositories_listed":1,"syntology":null}],"record_sha256":"061b821f41887f66edc8007a0791478c9774252412959506c554865bbc555fc6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}