{"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/link-prediction/papers/9","list_of":"/task/link-prediction","task":"Link Prediction","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":9,"pages_in_order":20,"rows_per_page":100,"rows":[801,900],"of":1949,"counts":{"archive_papers_tagged":1949,"with_a_code_link":974,"where_syntology_ran_a_sample":233,"not_listed_spam_title":0,"listed":1949,"listed_where_code_ran":233,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":206,"every_run_a_failure_of_syntologys_instrument":27,"listed_with_a_run_with_no_instrument_failure":206,"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/link-prediction","prev":"/task/link-prediction/papers/8","next":"/task/link-prediction/papers/10","papers":[{"url":"/paper/secure-network-release-with-link-privacy","slug":"secure-network-release-with-link-privacy","title":"Secure Deep Graph Generation with Link Differential Privacy","date":"2020-05-01","arxiv_id":"2005.00455","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/se-kge-a-location-aware-knowledge-graph","slug":"se-kge-a-location-aware-knowledge-graph","title":"SE-KGE: A Location-Aware Knowledge Graph Embedding Model for Geographic Question Answering and Spatial Semantic Lifting","date":"2020-04-25","arxiv_id":"2004.14171","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/se-kge-a-location-aware-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2004.14171","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.14171"}},"official":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/inference-in-the-stochastic-block-model-with","slug":"inference-in-the-stochastic-block-model-with","title":"Reliable Time Prediction in the Markov Stochastic Block Model","date":"2020-04-09","arxiv_id":"2004.04402","repositories_listed":1,"syntology":null},{"url":"/paper/the-general-theory-of-permutation-equivarant","slug":"the-general-theory-of-permutation-equivarant","title":"The general theory of permutation equivarant neural networks and higher order graph variational encoders","date":"2020-04-08","arxiv_id":"2004.03990","repositories_listed":1,"syntology":{"n":17,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/the-general-theory-of-permutation-equivarant#ran","syntology_url":"https://syntology.ai/paper/2004.03990","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.03990"}},"official":null}},{"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/contextual-parameter-generation-for-knowledge","slug":"contextual-parameter-generation-for-knowledge","title":"Contextual Parameter Generation for Knowledge Graph Link Prediction","date":"2020-04-03","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/epitomic-variational-graph-autoencoder","slug":"epitomic-variational-graph-autoencoder","title":"Epitomic Variational Graph Autoencoder","date":"2020-04-03","arxiv_id":"2004.01468","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":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) · 1 unverified","sample_list":"/paper/epitomic-variational-graph-autoencoder#ran","syntology_url":"https://syntology.ai/paper/2004.01468","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.01468"}},"official":{"repos":["RayyanRiaz/EVGAE"],"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/graph-representation-learning-via-ladder","slug":"graph-representation-learning-via-ladder","title":"Graph Representation Learning via Ladder Gamma Variational Autoencoders","date":"2020-04-03","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/modeling-dynamic-heterogeneous-network-for","slug":"modeling-dynamic-heterogeneous-network-for","title":"Modeling Dynamic Heterogeneous Network for Link Prediction using Hierarchical Attention with Temporal RNN","date":"2020-04-01","arxiv_id":"2004.01024","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":1,"n_no_contract":8,"n_pointer_only":3,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 1 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/modeling-dynamic-heterogeneous-network-for#ran","syntology_url":"https://syntology.ai/paper/2004.01024","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.01024"}},"official":{"repos":["skx300/DyHATR"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/gossip-and-attend-context-sensitive-graph","slug":"gossip-and-attend-context-sensitive-graph","title":"Gossip and Attend: Context-Sensitive Graph Representation Learning","date":"2020-03-30","arxiv_id":"2004.00413","repositories_listed":1,"syntology":null},{"url":"/paper/temporal-network-representation-learning-via","slug":"temporal-network-representation-learning-via","title":"Temporal Network Representation Learning via Historical Neighborhoods Aggregation","date":"2020-03-30","arxiv_id":"2003.13212","repositories_listed":1,"syntology":null},{"url":"/paper/k-core-based-temporal-graph-convolutional","slug":"k-core-based-temporal-graph-convolutional","title":"K-Core based Temporal Graph Convolutional Network for Dynamic Graphs","date":"2020-03-22","arxiv_id":"2003.09902","repositories_listed":1,"syntology":null},{"url":"/paper/realistic-re-evaluation-of-knowledge-graph","slug":"realistic-re-evaluation-of-knowledge-graph","title":"Realistic Re-evaluation of Knowledge Graph Completion Methods: An Experimental Study","date":"2020-03-18","arxiv_id":"2003.08001","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/debayes-a-bayesian-method-for-debiasing","slug":"debayes-a-bayesian-method-for-debiasing","title":"DeBayes: a Bayesian Method for Debiasing Network Embeddings","date":"2020-02-26","arxiv_id":"2002.11442","repositories_listed":1,"syntology":null},{"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/scalable-dyadic-independence-models-with","slug":"scalable-dyadic-independence-models-with","title":"Block-Approximated Exponential Random Graphs","date":"2020-02-14","arxiv_id":"2002.07076","repositories_listed":1,"syntology":null},{"url":"/paper/vertex-reinforced-random-walk-for-network","slug":"vertex-reinforced-random-walk-for-network","title":"Vertex-reinforced Random Walk for Network Embedding","date":"2020-02-11","arxiv_id":"2002.04497","repositories_listed":1,"syntology":null},{"url":"/paper/learning-graph-representations-of-biochemical","slug":"learning-graph-representations-of-biochemical","title":"Learning graph representations of biochemical networks and its application to enzymatic link prediction","date":"2020-02-09","arxiv_id":"2002.03410","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/graph-representation-learning-via-graphical","slug":"graph-representation-learning-via-graphical","title":"Graph Representation Learning via Graphical Mutual Information Maximization","date":"2020-02-04","arxiv_id":"2002.01169","repositories_listed":1,"syntology":null},{"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/which-way-direction-aware-attributed-graph","slug":"which-way-direction-aware-attributed-graph","title":"Which way? Direction-Aware Attributed Graph Embedding","date":"2020-01-30","arxiv_id":"2001.11297","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neighborhood-attentive-pooling-1","slug":"graph-neighborhood-attentive-pooling-1","title":"Graph Neighborhood Attentive Pooling","date":"2020-01-28","arxiv_id":"2001.10394","repositories_listed":1,"syntology":null},{"url":"/paper/tri-graph-information-propagation-for","slug":"tri-graph-information-propagation-for","title":"Tri-graph Information Propagation for Polypharmacy Side Effect Prediction","date":"2020-01-28","arxiv_id":"2001.10516","repositories_listed":1,"syntology":null},{"url":"/paper/simple-and-effective-graph-autoencoders-with","slug":"simple-and-effective-graph-autoencoders-with","title":"Simple and Effective Graph Autoencoders with One-Hop Linear Models","date":"2020-01-21","arxiv_id":"2001.07614","repositories_listed":1,"syntology":null},{"url":"/paper/basconv-aggregating-heterogeneous","slug":"basconv-aggregating-heterogeneous","title":"BasConv: Aggregating Heterogeneous Interactions for Basket Recommendation with Graph Convolutional Neural Network","date":"2020-01-14","arxiv_id":"2001.09900","repositories_listed":1,"syntology":null},{"url":"/paper/neural-subgraph-isomorphism-counting-1","slug":"neural-subgraph-isomorphism-counting-1","title":"Neural Subgraph Isomorphism Counting","date":"2019-12-25","arxiv_id":"1912.11589","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/neural-subgraph-isomorphism-counting-1#ran","syntology_url":"https://syntology.ai/paper/1912.11589","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.11589"}},"official":{"repos":["HKUST-KnowComp/NeuralSubgraphCounting"],"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/evaluating-the-effectiveness-of-margin","slug":"evaluating-the-effectiveness-of-margin","title":"Evaluating the Effectiveness of Margin Parameter when Learning Knowledge Embedding Representation for Domain-specific Multi-relational Categorized Data","date":"2019-12-21","arxiv_id":"1912.10264","repositories_listed":1,"syntology":null},{"url":"/paper/meta-graph-few-shot-link-prediction-via-meta-1","slug":"meta-graph-few-shot-link-prediction-via-meta-1","title":"Meta-Graph: Few Shot Link Prediction via Meta Learning","date":"2019-12-20","arxiv_id":"1912.09867","repositories_listed":1,"syntology":null},{"url":"/paper/bridging-the-gap-between-community-and-node","slug":"bridging-the-gap-between-community-and-node","title":"Bridging the Gap between Community and Node Representations: Graph Embedding via Community Detection","date":"2019-12-17","arxiv_id":"1912.08808","repositories_listed":1,"syntology":null},{"url":"/paper/openbiolink-a-resource-and-benchmarking","slug":"openbiolink-a-resource-and-benchmarking","title":"OpenBioLink: A benchmarking framework for large-scale biomedical link prediction","date":"2019-12-10","arxiv_id":"1912.04616","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/openbiolink-a-resource-and-benchmarking#ran","syntology_url":"https://syntology.ai/paper/1912.04616","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.04616"}},"official":{"repos":["OpenBioLink/OpenBioLink"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/gaussian-embedding-of-large-scale-attributed","slug":"gaussian-embedding-of-large-scale-attributed","title":"Gaussian Embedding of Large-scale Attributed Graphs","date":"2019-12-02","arxiv_id":"1912.00536","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-graph-attention-networks","slug":"sparse-graph-attention-networks","title":"Sparse Graph Attention Networks","date":"2019-12-02","arxiv_id":"1912.00552","repositories_listed":1,"syntology":null},{"url":"/paper/jnet-learning-user-representations-via-joint","slug":"jnet-learning-user-representations-via-joint","title":"JNET: Learning User Representations via Joint Network Embedding and Topic Embedding","date":"2019-12-01","arxiv_id":"1912.00465","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-deep-generative-relational-model","slug":"scalable-deep-generative-relational-model","title":"Scalable Deep Generative Relational Model with High-Order Node Dependence","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/asap-adaptive-structure-aware-pooling-for","slug":"asap-adaptive-structure-aware-pooling-for","title":"ASAP: Adaptive Structure Aware Pooling for Learning Hierarchical Graph Representations","date":"2019-11-18","arxiv_id":"1911.07979","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/graph-transformer-networks-1","slug":"graph-transformer-networks-1","title":"Graph Transformer Networks","date":"2019-11-06","arxiv_id":"1911.06455","repositories_listed":1,"syntology":null},{"url":"/paper/hyper-sagnn-a-self-attention-based-graph-1","slug":"hyper-sagnn-a-self-attention-based-graph-1","title":"Hyper-SAGNN: a self-attention based graph neural network for hypergraphs","date":"2019-11-06","arxiv_id":"1911.02613","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 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; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/hyper-sagnn-a-self-attention-based-graph-1#ran","syntology_url":"https://syntology.ai/paper/1911.02613","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.02613"}},"official":{"repos":["ma-compbio/Hyper-SAGNN"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/graphair-graph-representation-learning-with","slug":"graphair-graph-representation-learning-with","title":"GraphAIR: Graph Representation Learning with Neighborhood Aggregation and Interaction","date":"2019-11-05","arxiv_id":"1911.01731","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":4,"n_honours":3,"n_violates":2,"n_no_contract":1,"n_pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 3 honoured, 2 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/graphair-graph-representation-learning-with#ran","syntology_url":"https://syntology.ai/paper/1911.01731","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.01731"}},"official":{"repos":["CRIPAC-DIG/GraphAIR"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"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/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/deepfork-supervised-prediction-of-information","slug":"deepfork-supervised-prediction-of-information","title":"DeepFork: Supervised Prediction of Information Diffusion in GitHub","date":"2019-10-17","arxiv_id":"1910.07999","repositories_listed":1,"syntology":null},{"url":"/paper/tensor-graph-convolutional-networks-for","slug":"tensor-graph-convolutional-networks-for","title":"Dynamic Graph Convolutional Networks Using the Tensor M-Product","date":"2019-10-16","arxiv_id":"1910.07643","repositories_listed":1,"syntology":null},{"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/rethinking-kernel-methods-for-node","slug":"rethinking-kernel-methods-for-node","title":"Rethinking Kernel Methods for Node Representation Learning on Graphs","date":"2019-10-06","arxiv_id":"1910.02548","repositories_listed":1,"syntology":null},{"url":"/paper/gaussian-process-based-dynamic-embedding-for","slug":"gaussian-process-based-dynamic-embedding-for","title":"Dynamic Embedding on Textual Networks via a Gaussian Process","date":"2019-10-05","arxiv_id":"1910.02187","repositories_listed":1,"syntology":null},{"url":"/paper/keep-it-simple-graph-autoencoders-without","slug":"keep-it-simple-graph-autoencoders-without","title":"Keep It Simple: Graph Autoencoders Without Graph Convolutional Networks","date":"2019-10-02","arxiv_id":"1910.00942","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-equivalence-between-node-embeddings-1","slug":"on-the-equivalence-between-node-embeddings-1","title":"On the Equivalence between Positional Node Embeddings and Structural Graph Representations","date":"2019-10-01","arxiv_id":"1910.00452","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/190910367","slug":"190910367","title":"Learning Temporal Attention in Dynamic Graphs with Bilinear Interactions","date":"2019-09-23","arxiv_id":"1909.10367","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/kernel-node-embeddings","slug":"kernel-node-embeddings","title":"Kernel Node Embeddings","date":"2019-09-08","arxiv_id":"1909.03416","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/adapting-meta-knowledge-graph-information-for","slug":"adapting-meta-knowledge-graph-information-for","title":"Adapting Meta Knowledge Graph Information for Multi-Hop Reasoning over Few-Shot Relations","date":"2019-08-30","arxiv_id":"1908.11513","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-training-methods-for-network","slug":"adversarial-training-methods-for-network","title":"Adversarial Training Methods for Network Embedding","date":"2019-08-30","arxiv_id":"1908.11514","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/hyper-path-based-representation-learning-for","slug":"hyper-path-based-representation-learning-for","title":"Hyper-Path-Based Representation Learning for Hyper-Networks","date":"2019-08-24","arxiv_id":"1908.09152","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/hyper-path-based-representation-learning-for#ran","syntology_url":"https://syntology.ai/paper/1908.09152","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.09152"}},"official":{"repos":["HKUST-KnowComp/HPHG"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/benchmarks-for-graph-embedding-evaluation","slug":"benchmarks-for-graph-embedding-evaluation","title":"Benchmarks for Graph Embedding Evaluation","date":"2019-08-19","arxiv_id":"1908.06543","repositories_listed":1,"syntology":null},{"url":"/paper/rwr-gae-random-walk-regularization-for-graph","slug":"rwr-gae-random-walk-regularization-for-graph","title":"RWR-GAE: Random Walk Regularization for Graph Auto Encoders","date":"2019-08-12","arxiv_id":"1908.04003","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":5,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 1 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/rwr-gae-random-walk-regularization-for-graph#ran","syntology_url":"https://syntology.ai/paper/1908.04003","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.04003"}},"official":{"repos":["MysteryVaibhav/DW-GAE"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/symmetric-graph-convolutional-autoencoder-for","slug":"symmetric-graph-convolutional-autoencoder-for","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","date":"2019-08-07","arxiv_id":"1908.02441","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/symmetric-graph-convolutional-autoencoder-for#ran","syntology_url":"https://syntology.ai/paper/1908.02441","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.02441"}},"official":null}},{"url":"/paper/using-hyperbolic-large-margin-classifiers-for","slug":"using-hyperbolic-large-margin-classifiers-for","title":"Using hyperbolic large-margin classifiers for biological link prediction","date":"2019-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-models-of-relational","slug":"probabilistic-models-of-relational","title":"Probabilistic Models of Relational Implication","date":"2019-07-28","arxiv_id":"1907.12048","repositories_listed":1,"syntology":null},{"url":"/paper/towards-an-lstm-based-predictive-framework","slug":"towards-an-lstm-based-predictive-framework","title":"Mining Temporal Evolution of Knowledge Graph and Genealogical Features for Literature-based Discovery Prediction","date":"2019-07-22","arxiv_id":"1907.09395","repositories_listed":1,"syntology":null},{"url":"/paper/snomed2vec-random-walk-and-poincare","slug":"snomed2vec-random-walk-and-poincare","title":"Snomed2Vec: Random Walk and Poincaré Embeddings of a Clinical Knowledge Base for Healthcare Analytics","date":"2019-07-19","arxiv_id":"1907.08650","repositories_listed":1,"syntology":null},{"url":"/paper/deepnc-deep-generative-network-completion","slug":"deepnc-deep-generative-network-completion","title":"DeepNC: Deep Generative Network Completion","date":"2019-07-17","arxiv_id":"1907.07381","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/duality-of-link-prediction-and-entailment","slug":"duality-of-link-prediction-and-entailment","title":"Duality of Link Prediction and Entailment Graph Induction","date":"2019-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/signed-graph-attention-networks","slug":"signed-graph-attention-networks","title":"Signed Graph Attention Networks","date":"2019-06-26","arxiv_id":"1906.10958","repositories_listed":1,"syntology":null},{"url":"/paper/predicting-kills-in-game-of-thrones-using","slug":"predicting-kills-in-game-of-thrones-using","title":"Predicting kills in Game of Thrones using network properties","date":"2019-06-22","arxiv_id":"1906.09468","repositories_listed":1,"syntology":null},{"url":"/paper/graph-star-net-for-generalized-multi-task-1","slug":"graph-star-net-for-generalized-multi-task-1","title":"Graph Star Net for Generalized Multi-Task Learning","date":"2019-06-21","arxiv_id":"1906.12330","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 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; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/graph-star-net-for-generalized-multi-task-1#ran","syntology_url":"https://syntology.ai/paper/1906.12330","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.12330"}},"official":null}},{"url":"/paper/an-open-world-extension-to-knowledge-graph","slug":"an-open-world-extension-to-knowledge-graph","title":"An Open-World Extension to Knowledge Graph Completion Models","date":"2019-06-19","arxiv_id":"1906.08382","repositories_listed":1,"syntology":null},{"url":"/paper/embedding-biomedical-ontologies-by-jointly","slug":"embedding-biomedical-ontologies-by-jointly","title":"Embedding Biomedical Ontologies by Jointly Encoding Network Structure and Textual Node Descriptors","date":"2019-06-13","arxiv_id":"1906.05939","repositories_listed":1,"syntology":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/dynamic-network-embedding-via-incremental","slug":"dynamic-network-embedding-via-incremental","title":"Dynamic Network Embedding via Incremental Skip-gram with Negative Sampling","date":"2019-06-09","arxiv_id":"1906.03586","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/end-to-end-learning-and-optimization-on","slug":"end-to-end-learning-and-optimization-on","title":"End to end learning and optimization on graphs","date":"2019-05-31","arxiv_id":"1905.13732","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/end-to-end-learning-and-optimization-on#ran","syntology_url":"https://syntology.ai/paper/1905.13732","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.13732"}},"official":{"repos":["bwilder0/clusternet"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/graph-learning-network-a-structure-learning-1","slug":"graph-learning-network-a-structure-learning-1","title":"Graph Learning Network: A Structure Learning Algorithm","date":"2019-05-29","arxiv_id":"1905.12665","repositories_listed":1,"syntology":null},{"url":"/paper/is-a-single-vector-enough-exploring-node","slug":"is-a-single-vector-enough-exploring-node","title":"Is a Single Vector Enough? Exploring Node Polysemy for Network Embedding","date":"2019-05-25","arxiv_id":"1905.10668","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/is-a-single-vector-enough-exploring-node#ran","syntology_url":"https://syntology.ai/paper/1905.10668","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10668"}},"official":null}},{"url":"/paper/spring-electrical-models-for-link-prediction","slug":"spring-electrical-models-for-link-prediction","title":"Spring-Electrical Models For Link Prediction","date":"2019-05-24","arxiv_id":"1906.04548","repositories_listed":1,"syntology":null},{"url":"/paper/multi-relational-poincare-graph-embeddings","slug":"multi-relational-poincare-graph-embeddings","title":"Multi-relational Poincaré Graph Embeddings","date":"2019-05-23","arxiv_id":"1905.09791","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/multi-relational-poincare-graph-embeddings#ran","syntology_url":"https://syntology.ai/paper/1905.09791","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.09791"}},"official":{"repos":["ibalazevic/multirelational-poincare"],"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/tucker-tensor-factorization-for-knowledge-1","slug":"tucker-tensor-factorization-for-knowledge-1","title":"TuckER: Tensor Factorization for Knowledge Graph Completion","date":"2019-05-16","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/can-netgan-be-improved-by-short-random-walks","slug":"can-netgan-be-improved-by-short-random-walks","title":"Can NetGAN be improved on short random walks?","date":"2019-05-13","arxiv_id":"1905.05298","repositories_listed":1,"syntology":null},{"url":"/paper/investigating-robustness-and-interpretability","slug":"investigating-robustness-and-interpretability","title":"Investigating Robustness and Interpretability of Link Prediction via Adversarial Modifications","date":"2019-05-02","arxiv_id":"1905.00563","repositories_listed":1,"syntology":null},{"url":"/paper/network-representation-learning-consolidation","slug":"network-representation-learning-consolidation","title":"Network Representation Learning: Consolidation and Renewed Bearing","date":"2019-05-02","arxiv_id":"1905.00987","repositories_listed":1,"syntology":null},{"url":"/paper/graph-convolutional-networks-with","slug":"graph-convolutional-networks-with","title":"Graph Convolutional Networks with EigenPooling","date":"2019-04-30","arxiv_id":"1904.13107","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-use-of-arxiv-as-a-dataset","slug":"on-the-use-of-arxiv-as-a-dataset","title":"On the Use of ArXiv as a Dataset","date":"2019-04-30","arxiv_id":"1905.00075","repositories_listed":1,"syntology":{"n":19,"n_ran":15,"n_constructed":0,"n_ran_checked":15,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":0,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/on-the-use-of-arxiv-as-a-dataset#ran","syntology_url":"https://syntology.ai/paper/1905.00075","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.00075"}},"official":{"repos":["mattbierbaum/arxiv-public-datasets"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/quaternion-knowledge-graph-embedding","slug":"quaternion-knowledge-graph-embedding","title":"Quaternion Knowledge Graph Embeddings","date":"2019-04-23","arxiv_id":"1904.10281","repositories_listed":1,"syntology":null},{"url":"/paper/incremental-embedding-for-temporal-networks","slug":"incremental-embedding-for-temporal-networks","title":"FILDNE: A Framework for Incremental Learning of Dynamic Networks Embeddings","date":"2019-04-06","arxiv_id":"1904.03423","repositories_listed":1,"syntology":null},{"url":"/paper/gne-a-deep-learning-framework-for-gene","slug":"gne-a-deep-learning-framework-for-gene","title":"GNE: a deep learning framework for gene network inference by aggregating biological information","date":"2019-04-05","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/pytorch-biggraph-a-large-scale-graph","slug":"pytorch-biggraph-a-large-scale-graph","title":"PyTorch-BigGraph: A Large-scale Graph Embedding System","date":"2019-03-28","arxiv_id":"1903.12287","repositories_listed":1,"syntology":null},{"url":"/paper/analyzing-knowledge-graph-embedding-methods","slug":"analyzing-knowledge-graph-embedding-methods","title":"Analyzing Knowledge Graph Embedding Methods from a Multi-Embedding Interaction Perspective","date":"2019-03-27","arxiv_id":"1903.11406","repositories_listed":1,"syntology":null},{"url":"/paper/connecting-language-and-knowledge-with","slug":"connecting-language-and-knowledge-with","title":"Connecting Language and Knowledge with Heterogeneous Representations for Neural Relation Extraction","date":"2019-03-25","arxiv_id":"1903.10126","repositories_listed":1,"syntology":null},{"url":"/paper/node-embedding-over-temporal-graphs","slug":"node-embedding-over-temporal-graphs","title":"Node Embedding over Temporal Graphs","date":"2019-03-21","arxiv_id":"1903.08889","repositories_listed":1,"syntology":null}],"record_sha256":"1bfad30a2922a49bcbaba2ab5f2c478bbf82bffe2bc6c8e2a1c0a0950fe71d51","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}