{"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/18","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":18,"pages_in_order":20,"rows_per_page":100,"rows":[1701,1800],"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/17","next":"/task/link-prediction/papers/19","papers":[{"url":null,"slug":"sense-semantically-enhanced-node-sequence-1","title":"SENSE: Semantically Enhanced Node Sequence Embedding","date":"2019-11-07","arxiv_id":"1911.02970","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-graph-embedding-via-lstm-history","title":"Dynamic Graph Embedding via LSTM History Tracking","date":"2019-11-05","arxiv_id":"1911.01551","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-deep-generative-relational-models","title":"Scalable Deep Generative Relational Models with High-Order Node Dependence","date":"2019-11-04","arxiv_id":"1911.01535","repositories_listed":0,"syntology":null},{"url":null,"slug":"care-open-knowledge-graph-embeddings","title":"CaRe: Open Knowledge Graph Embeddings","date":"2019-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-knowledge-graph-embeddings-with","title":"A Survey on Knowledge Graph Embeddings with Literals: Which model links better Literal-ly?","date":"2019-10-28","arxiv_id":"1910.12507","repositories_listed":0,"syntology":null},{"url":"/paper/using-pairwise-occurrence-information-to","slug":"using-pairwise-occurrence-information-to","title":"Using Pairwise Occurrence Information to Improve Knowledge Graph Completion on Large-Scale Datasets","date":"2019-10-25","arxiv_id":"1910.11583","repositories_listed":0,"syntology":null},{"url":null,"slug":"network2vec-learning-node-representation","title":"Network2Vec Learning Node Representation Based on Space Mapping in Networks","date":"2019-10-23","arxiv_id":"1910.10379","repositories_listed":0,"syntology":null},{"url":null,"slug":"decoupling-feature-propagation-from-the","title":"Decoupling feature propagation from the design of graph auto-encoders","date":"2019-10-18","arxiv_id":"1910.08589","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-learning-cross-modal-perception-trace","title":"Towards Learning Cross-Modal Perception-Trace Models","date":"2019-10-18","arxiv_id":"1910.08549","repositories_listed":0,"syntology":null},{"url":null,"slug":"tutorial-on-nlp-inspired-network-embedding","title":"Tutorial on NLP-Inspired Network Embedding","date":"2019-10-16","arxiv_id":"1910.07212","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficiently-embedding-dynamic-knowledge","title":"Efficiently Embedding Dynamic Knowledge Graphs","date":"2019-10-15","arxiv_id":"1910.06708","repositories_listed":0,"syntology":null},{"url":null,"slug":"link-prediction-via-deep-learning","title":"Link Prediction via Graph Attention Network","date":"2019-10-10","arxiv_id":"1910.04807","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-joint-variational-graph-autoencoders","title":"Dynamic Joint Variational Graph Autoencoders","date":"2019-10-04","arxiv_id":"1910.01963","repositories_listed":0,"syntology":null},{"url":null,"slug":"genn-predicting-correlated-drug-drug-1","title":"GENN: Predicting Correlated Drug-drug Interactions with Graph Energy Neural Networks","date":"2019-10-04","arxiv_id":"1910.02107","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-robust-representations-with-graph","title":"Learning Robust Representations with Graph Denoising Policy Network","date":"2019-10-04","arxiv_id":"1910.01784","repositories_listed":0,"syntology":null},{"url":null,"slug":"transgcncoupling-transformation-assumptions","title":"TransGCN:Coupling Transformation Assumptions with Graph Convolutional Networks for Link Prediction","date":"2019-10-01","arxiv_id":"1910.00702","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-understanding-knowledge-graph","title":"On Understanding Knowledge Graph Representation","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-understanding-knowledge-graph-1","title":"Interpreting Knowledge Graph Relation Representation from Word Embeddings","date":"2019-09-25","arxiv_id":"1909.11611","repositories_listed":0,"syntology":null},{"url":null,"slug":"projected-canonical-decomposition-for","title":"Projected Canonical Decomposition for Knowledge Base Completion","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"recurrent-event-network-global-structure","title":"Recurrent Event Network : Global Structure Inference Over Temporal Knowledge Graph","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"combination-of-embedding-models-and","title":"Combination of Unified Embedding Model and Observed Features for Knowledge Graph Completion","date":"2019-09-09","arxiv_id":"1909.03821","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-generating-explanations-for-asp-based","title":"Towards Generating Explanations for ASP-Based Link Analysis using Declarative Program Transformations","date":"2019-09-08","arxiv_id":"1909.03404","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-robustness-of-similarity-based","title":"Adversarial Robustness of Similarity-Based Link Prediction","date":"2019-09-03","arxiv_id":"1909.01432","repositories_listed":0,"syntology":null},{"url":null,"slug":"prtransh-embedding-probabilistic-medical","title":"A Method to Learn Embedding of a Probabilistic Medical Knowledge Graph: Algorithm Development","date":"2019-09-02","arxiv_id":"1909.00672","repositories_listed":0,"syntology":null},{"url":null,"slug":"effective-and-efficient-network-embedding","title":"Initialization for Network Embedding: A Graph Partition Approach","date":"2019-08-28","arxiv_id":"1908.10697","repositories_listed":0,"syntology":null},{"url":null,"slug":"power-efficient-discontinuous-reception-in","title":"Power Efficient Discontinuous Reception in THz and mmWave Wireless Systems","date":"2019-08-23","arxiv_id":"1908.08966","repositories_listed":0,"syntology":null},{"url":null,"slug":"motif2vec-motif-aware-node-representation","title":"motif2vec: Motif Aware Node Representation Learning for Heterogeneous Networks","date":"2019-08-22","arxiv_id":"1908.08227","repositories_listed":0,"syntology":null},{"url":null,"slug":"ahine-adaptive-heterogeneous-information","title":"AHINE: Adaptive Heterogeneous Information Network Embedding","date":"2019-08-20","arxiv_id":"1909.01087","repositories_listed":0,"syntology":null},{"url":"/paper/logicenn-a-neural-based-knowledge-graphs","slug":"logicenn-a-neural-based-knowledge-graphs","title":"LogicENN: A Neural Based Knowledge Graphs Embedding Model with Logical Rules","date":"2019-08-20","arxiv_id":"1908.07141","repositories_listed":0,"syntology":null},{"url":null,"slug":"megan-a-generative-adversarial-network-for","title":"MEGAN: A Generative Adversarial Network for Multi-View Network Embedding","date":"2019-08-20","arxiv_id":"1909.01084","repositories_listed":0,"syntology":null},{"url":null,"slug":"honem-network-embedding-using-higher-order","title":"HONEM: Learning Embedding for Higher Order Networks","date":"2019-08-15","arxiv_id":"1908.05387","repositories_listed":0,"syntology":null},{"url":null,"slug":"hyperkg-hyperbolic-knowledge-graph-embeddings","title":"HyperKG: Hyperbolic Knowledge Graph Embeddings for Knowledge Base Completion","date":"2019-08-14","arxiv_id":"1908.04895","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-kernel-supervised-hashing-for-network","title":"Deep Hashing for Signed Social Network Embedding","date":"2019-08-12","arxiv_id":"1908.04007","repositories_listed":0,"syntology":null},{"url":null,"slug":"reconstructing-commuters-network-using","title":"Reconstructing commuters network using machine learning and urban indicators","date":"2019-08-09","arxiv_id":"1908.03512","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-relational-classification-via-bayesian","title":"Multi-Relational Classification via Bayesian Ranked Non-Linear Embeddings","date":"2019-08-06","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"hyperlink-regression-via-bregman-divergence","title":"Hyperlink Regression via Bregman Divergence","date":"2019-07-22","arxiv_id":"1908.02573","repositories_listed":0,"syntology":null},{"url":null,"slug":"privacy-preserving-link-prediction-with","title":"Differentially Private Link Prediction With Protected Connections","date":"2019-07-20","arxiv_id":"1908.04849","repositories_listed":0,"syntology":null},{"url":null,"slug":"deeptrax-embedding-graphs-of-financial","title":"DeepTrax: Embedding Graphs of Financial Transactions","date":"2019-07-16","arxiv_id":"1907.07225","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-probabilistic-generative-models","title":"Towards Probabilistic Generative Models Harnessing Graph Neural Networks for Disease-Gene Prediction","date":"2019-07-12","arxiv_id":"1907.05628","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-margin-ranking-loss-for-knowledge","title":"Adaptive Margin Ranking Loss for Knowledge Graph Embeddings via a Correntropy Objective Function","date":"2019-07-09","arxiv_id":"1907.05336","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-embeddings-at-scale","title":"Graph Embeddings at Scale","date":"2019-07-03","arxiv_id":"1907.01705","repositories_listed":0,"syntology":null},{"url":null,"slug":"a2n-attending-to-neighbors-for-knowledge","title":"A2N: Attending to Neighbors for Knowledge Graph Inference","date":"2019-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-adversarial-graph-alignment-with","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","date":"2019-07-01","arxiv_id":"1907.00544","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-network-embeddings-for-network","title":"Dynamic Network Embeddings for Network Evolution Analysis","date":"2019-06-24","arxiv_id":"1906.09860","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-graph-auto-encoder-for-attributed-network","title":"ANAE: Learning Node Context Representation for Attributed Network Embedding","date":"2019-06-20","arxiv_id":"1906.08745","repositories_listed":0,"syntology":null},{"url":null,"slug":"homogeneous-network-embedding-for-massive","title":"Homogeneous Network Embedding for Massive Graphs via Reweighted Personalized PageRank","date":"2019-06-17","arxiv_id":"1906.06826","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-correlated-latent-representations","title":"Learning Correlated Latent Representations with Adaptive Priors","date":"2019-06-14","arxiv_id":"1906.06419","repositories_listed":0,"syntology":null},{"url":null,"slug":"higher-order-ranking-and-link-prediction-from","title":"Higher-Order Ranking and Link Prediction: From Closing Triangles to Closing Higher-Order Motifs","date":"2019-06-12","arxiv_id":"1906.05059","repositories_listed":0,"syntology":null},{"url":"/paper/190600687","slug":"190600687","title":"Relation Embedding with Dihedral Group in Knowledge Graph","date":"2019-06-03","arxiv_id":"1906.00687","repositories_listed":0,"syntology":null},{"url":null,"slug":"abstract-graphs-and-abstract-paths-for","title":"Abstract Graphs and Abstract Paths for Knowledge Graph Completion","date":"2019-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/adaptive-convolution-for-multi-relational","slug":"adaptive-convolution-for-multi-relational","title":"Adaptive Convolution for Multi-Relational Learning","date":"2019-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fobe-and-hobe-first-and-high-order-bipartite","title":"FOBE and HOBE: First- and High-Order Bipartite Embeddings","date":"2019-05-27","arxiv_id":"1905.10953","repositories_listed":0,"syntology":null},{"url":null,"slug":"star-gcn-stacked-and-reconstructed-graph","title":"STAR-GCN: Stacked and Reconstructed Graph Convolutional Networks for Recommender Systems","date":"2019-05-27","arxiv_id":"1905.13129","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-graph-embedding-bi-vector-models","title":"Knowledge Graph Embedding Bi-Vector Models for Symmetric Relation","date":"2019-05-23","arxiv_id":"1905.09557","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-symbolic-argumentation-mining-an","title":"Neural-Symbolic Argumentation Mining: an Argument in Favor of Deep Learning and Reasoning","date":"2019-05-22","arxiv_id":"1905.09103","repositories_listed":0,"syntology":null},{"url":null,"slug":"logicenn-a-neural-based-knowledge-graphs-1","title":"LogicENN: A Neural Based Knowledge Graphs Embedding Model with Logical Rules","date":"2019-05-21","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"relation-structure-aware-heterogeneous","title":"Relation Structure-Aware Heterogeneous Information Network Embedding","date":"2019-05-15","arxiv_id":"1905.08027","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-blockmodels-meet-graph-neural","title":"Stochastic Blockmodels meet Graph Neural Networks","date":"2019-05-14","arxiv_id":"1905.05738","repositories_listed":0,"syntology":null},{"url":null,"slug":"link-prediction-in-hypergraphs-using-graph","title":"Link Prediction in Hypergraphs using Graph Convolutional Networks","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-neural-theorem-proving-on-knowledge","title":"Scalable Neural Theorem Proving on Knowledge Bases and Natural Language","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"soft-marginal-transe-for-scholarly-knowledge","title":"Soft Marginal TransE for Scholarly Knowledge Graph Completion","date":"2019-04-27","arxiv_id":"1904.12211","repositories_listed":0,"syntology":null},{"url":null,"slug":"link-prediction-in-multiplex-networks-based","title":"Link Prediction in Multiplex Networks based on Interlayer Similarity","date":"2019-04-23","arxiv_id":"1904.10169","repositories_listed":0,"syntology":null},{"url":null,"slug":"190412694","title":"ExplaiNE: An Approach for Explaining Network Embedding-based Link Predictions","date":"2019-04-22","arxiv_id":"1904.12694","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-representation-learning-for-social","title":"Deep Representation Learning for Social Network Analysis","date":"2019-04-18","arxiv_id":"1904.08547","repositories_listed":0,"syntology":null},{"url":null,"slug":"compositional-network-embedding","title":"Compositional Network Embedding","date":"2019-04-17","arxiv_id":"1904.08157","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-pattern-entity-ranking-model-for","title":"Graph Pattern Entity Ranking Model for Knowledge Graph Completion","date":"2019-04-05","arxiv_id":"1904.02856","repositories_listed":0,"syntology":null},{"url":null,"slug":"defeats-gan-a-simpler-model-outperforms-in","title":"Defeats GAN: A Simpler Model Outperforms in Knowledge Representation Learning","date":"2019-04-03","arxiv_id":"1904.01777","repositories_listed":0,"syntology":null},{"url":null,"slug":"domain-representation-for-knowledge-graph","title":"Domain Representation for Knowledge Graph Embedding","date":"2019-03-26","arxiv_id":"1903.10716","repositories_listed":0,"syntology":null},{"url":null,"slug":"iteratively-learning-embeddings-and-rules-for","title":"Iteratively Learning Embeddings and Rules for Knowledge Graph Reasoning","date":"2019-03-21","arxiv_id":"1903.08948","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-comprehensive-comparison-of-unsupervised","title":"A Comparative Study for Unsupervised Network Representation Learning","date":"2019-03-19","arxiv_id":"1903.07902","repositories_listed":0,"syntology":null},{"url":null,"slug":"interaction-embeddings-for-prediction-and","title":"Interaction Embeddings for Prediction and Explanation in Knowledge Graphs","date":"2019-03-12","arxiv_id":"1903.04750","repositories_listed":0,"syntology":null},{"url":null,"slug":"logic-rules-powered-knowledge-graph-embedding","title":"Logic Rules Powered Knowledge Graph Embedding","date":"2019-03-09","arxiv_id":"1903.03772","repositories_listed":0,"syntology":null},{"url":null,"slug":"evalne-a-framework-for-evaluating-network-1","title":"EvalNE: A Framework for Evaluating Network Embeddings on Link Prediction","date":"2019-03-06","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"signed-link-prediction-with-sparse-data-the","title":"Signed Link Prediction with Sparse Data: The Role of Personality Information","date":"2019-03-06","arxiv_id":"1903.02125","repositories_listed":0,"syntology":null},{"url":null,"slug":"empirical-effect-of-graph-embeddings-on-fraud","title":"Empirical effect of graph embeddings on fraud detection/ risk mitigation","date":"2019-03-05","arxiv_id":"1903.05976","repositories_listed":0,"syntology":null},{"url":null,"slug":"link-prediction-with-mutual-attention-for","title":"Link Prediction with Mutual Attention for Text-Attributed Networks","date":"2019-02-28","arxiv_id":"1902.11054","repositories_listed":0,"syntology":null},{"url":null,"slug":"heterogeneous-edge-embeddings-for-friend","title":"Heterogeneous Edge Embeddings for Friend Recommendation","date":"2019-02-07","arxiv_id":"1902.03124","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-relational-tucker-decomposition-for-multi","title":"A Relational Tucker Decomposition for Multi-Relational Link Prediction","date":"2019-02-03","arxiv_id":"1902.00898","repositories_listed":0,"syntology":null},{"url":null,"slug":"topological-and-semantic-graph-based-author","title":"Topological and Semantic Graph-based Author Disambiguation on DBLP Data in Neo4j","date":"2019-01-25","arxiv_id":"1901.08977","repositories_listed":0,"syntology":null},{"url":null,"slug":"poincare-wasserstein-autoencoder","title":"Poincaré Wasserstein Autoencoder","date":"2019-01-05","arxiv_id":"1901.01427","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-graph-embedding-with-adversarial","title":"Learning Graph Embedding with Adversarial Training Methods","date":"2019-01-04","arxiv_id":"1901.01250","repositories_listed":0,"syntology":null},{"url":null,"slug":"loss-aversion-in-recommender-systems","title":"Loss Aversion in Recommender Systems: Utilizing Negative User Preference to Improve Recommendation Quality","date":"2018-12-29","arxiv_id":"1812.11422","repositories_listed":0,"syntology":null},{"url":null,"slug":"cosine-compressive-network-embedding-on-large","title":"COSINE: Compressive Network Embedding on Large-scale Information Networks","date":"2018-12-21","arxiv_id":"1812.08972","repositories_listed":0,"syntology":null},{"url":null,"slug":"embedding-cardinality-constraints-in-neural","title":"Embedding Cardinality Constraints in Neural Link Predictors","date":"2018-12-16","arxiv_id":"1812.06455","repositories_listed":0,"syntology":null},{"url":null,"slug":"interpretable-graph-convolutional-neural","title":"Interpretable Graph Convolutional Neural Networks for Inference on Noisy Knowledge Graphs","date":"2018-12-01","arxiv_id":"1812.00279","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-classifier-for-imbalanced","title":"Adversarial Classifier for Imbalanced Problems","date":"2018-11-21","arxiv_id":"1811.08812","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-numerical-attributes-in-knowledge","title":"Learning Numerical Attributes in Knowledge Bases","date":"2018-11-17","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"link-prediction-in-dynamic-graphs-for","title":"Link Prediction in Dynamic Graphs for Recommendation","date":"2018-11-17","arxiv_id":"1811.07174","repositories_listed":0,"syntology":null},{"url":"/paper/augmenting-compositional-models-for-knowledge","slug":"augmenting-compositional-models-for-knowledge","title":"Augmenting Compositional Models for Knowledge Base Completion Using Gradient Representations","date":"2018-11-02","arxiv_id":"1811.01062","repositories_listed":0,"syntology":null},{"url":null,"slug":"mohone-modeling-higher-order-network-effects","title":"MOHONE: Modeling Higher Order Network Effects in KnowledgeGraphs via Network Infused Embeddings","date":"2018-11-01","arxiv_id":"1811.00198","repositories_listed":0,"syntology":null},{"url":null,"slug":"dolores-deep-contextualized-knowledge-graph","title":"DOLORES: Deep Contextualized Knowledge Graph Embeddings","date":"2018-10-31","arxiv_id":"1811.00147","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-poisoning-attack-against-unsupervised","title":"Data Poisoning Attack against Unsupervised Node Embedding Methods","date":"2018-10-30","arxiv_id":"1810.12881","repositories_listed":0,"syntology":null},{"url":null,"slug":"node-representation-learning-for-directed","title":"Node Representation Learning for Directed Graphs","date":"2018-10-22","arxiv_id":"1810.09176","repositories_listed":0,"syntology":null},{"url":null,"slug":"tne-a-latent-model-for-representation","title":"TNE: A Latent Model for Representation Learning on Networks","date":"2018-10-16","arxiv_id":"1810.06917","repositories_listed":0,"syntology":null},{"url":null,"slug":"systematic-biases-in-link-prediction","title":"Systematic Biases in Link Prediction: comparing heuristic and graph embedding based methods","date":"2018-10-11","arxiv_id":"1811.12159","repositories_listed":0,"syntology":null},{"url":null,"slug":"constructing-graph-node-embeddings-via","title":"Constructing Graph Node Embeddings via Discrimination of Similarity Distributions","date":"2018-10-06","arxiv_id":"1810.03032","repositories_listed":0,"syntology":null},{"url":null,"slug":"higher-order-spectral-clustering-for","title":"Higher-order Spectral Clustering for Heterogeneous Graphs","date":"2018-10-06","arxiv_id":"1810.02959","repositories_listed":0,"syntology":null},{"url":null,"slug":"dual-convolutional-neural-network-for-graph","title":"Dual Convolutional Neural Network for Graph of Graphs Link Prediction","date":"2018-10-04","arxiv_id":"1810.02080","repositories_listed":0,"syntology":null},{"url":null,"slug":"characterizing-malicious-edges-targeting-on","title":"Characterizing Malicious Edges targeting on Graph Neural Networks","date":"2018-09-27","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-generation-via-scattering","title":"Graph Generation via Scattering","date":"2018-09-27","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"729ae79463b0ffd6355c54cdc6dcaaaef17bc31b65b17823669b55d800c31d9e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}