{"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/17","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":17,"pages_in_order":20,"rows_per_page":100,"rows":[1601,1700],"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/16","next":"/task/link-prediction/papers/18","papers":[{"url":null,"slug":"uncertainty-matching-graph-neural-networks-to","title":"Uncertainty-Matching Graph Neural Networks to Defend Against Poisoning Attacks","date":"2020-09-30","arxiv_id":"2009.14455","repositories_listed":0,"syntology":null},{"url":null,"slug":"panrep-universal-node-embeddings-for-1","title":"PanRep: Universal node embeddings for heterogeneous graphs","date":"2020-09-28","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-graph-neural-networks-for-link","title":"Revisiting Graph Neural Networks for Link Prediction","date":"2020-09-28","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-graph-embeddings-through-locality","title":"Inductive Graph Embeddings through Locality Encodings","date":"2020-09-26","arxiv_id":"2009.12585","repositories_listed":0,"syntology":null},{"url":null,"slug":"autoeter-automated-entity-type-representation","title":"AutoETER: Automated Entity Type Representation for Knowledge Graph Embedding","date":"2020-09-25","arxiv_id":"2009.12030","repositories_listed":0,"syntology":null},{"url":null,"slug":"modeling-the-evolution-of-networks-as","title":"Modeling the Evolution of Networks as Shrinking Structural Diversity","date":"2020-09-21","arxiv_id":"2009.09764","repositories_listed":0,"syntology":null},{"url":null,"slug":"job2vec-job-title-benchmarking-with","title":"Job2Vec: Job Title Benchmarking with Collective Multi-View Representation Learning","date":"2020-09-16","arxiv_id":"2009.07429","repositories_listed":0,"syntology":null},{"url":null,"slug":"does-link-prediction-help-detect-feature","title":"Does Link Prediction Help Detect Feature Interactions in Software Product Lines (SPLs)?","date":"2020-09-15","arxiv_id":"2009.07392","repositories_listed":0,"syntology":null},{"url":"/paper/mlmlm-link-prediction-with-mean-likelihood","slug":"mlmlm-link-prediction-with-mean-likelihood","title":"MLMLM: Link Prediction with Mean Likelihood Masked Language Model","date":"2020-09-15","arxiv_id":"2009.07058","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-use-of-local-structural-properties-for","title":"On the use of local structural properties for improving the efficiency of hierarchical community detection methods","date":"2020-09-15","arxiv_id":"2009.06798","repositories_listed":0,"syntology":null},{"url":null,"slug":"distile-distiling-knowledge-graph-embeddings","title":"DualDE: Dually Distilling Knowledge Graph Embedding for Faster and Cheaper Reasoning","date":"2020-09-13","arxiv_id":"2009.05912","repositories_listed":0,"syntology":null},{"url":null,"slug":"community-detection-in-networks-using-graph-1","title":"Community detection in networks using graph embeddings","date":"2020-09-11","arxiv_id":"2009.05265","repositories_listed":0,"syntology":null},{"url":null,"slug":"nondiagonal-mixture-of-dirichlet-network","title":"Nondiagonal Mixture of Dirichlet Network Distributions for Analyzing a Stock Ownership Network","date":"2020-09-08","arxiv_id":"2009.04446","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-personalized-community-detection","title":"Efficient Personalized Community Detection via Genetic Evolution","date":"2020-09-06","arxiv_id":"2009.02657","repositories_listed":0,"syntology":null},{"url":null,"slug":"reinforcement-learning-based-black-box","title":"Reinforcement Learning-based Black-Box Evasion Attacks to Link Prediction in Dynamic Graphs","date":"2020-09-01","arxiv_id":"2009.00163","repositories_listed":0,"syntology":null},{"url":null,"slug":"dve-dynamic-variational-embeddings-with","title":"DVE: Dynamic Variational Embeddings with Applications in Recommender Systems","date":"2020-08-27","arxiv_id":"2009.08962","repositories_listed":0,"syntology":null},{"url":null,"slug":"offer-a-motif-dimensional-framework-for","title":"OFFER: A Motif Dimensional Framework for Network Representation Learning","date":"2020-08-27","arxiv_id":"2008.12010","repositories_listed":0,"syntology":null},{"url":null,"slug":"tsam-temporal-link-prediction-in-directed","title":"TSAM: Temporal Link Prediction in Directed Networks based on Self-Attention Mechanism","date":"2020-08-23","arxiv_id":"2008.10021","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-comparative-study-of-similarity-based-and","title":"A comparative study of similarity-based and GNN-based link prediction approaches","date":"2020-08-20","arxiv_id":"2008.08879","repositories_listed":0,"syntology":null},{"url":null,"slug":"big-networks-a-survey","title":"Big Networks: A Survey","date":"2020-08-09","arxiv_id":"2008.03638","repositories_listed":0,"syntology":null},{"url":null,"slug":"dine-a-framework-for-deep-incomplete-network","title":"DINE: A Framework for Deep Incomplete Network Embedding","date":"2020-08-09","arxiv_id":"2008.06311","repositories_listed":0,"syntology":null},{"url":null,"slug":"model-motif-based-deep-feature-learning-for","title":"MODEL: Motif-based Deep Feature Learning for Link Prediction","date":"2020-08-09","arxiv_id":"2008.03637","repositories_listed":0,"syntology":null},{"url":null,"slug":"random-walks-a-review-of-algorithms-and","title":"Random Walks: A Review of Algorithms and Applications","date":"2020-08-09","arxiv_id":"2008.03639","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-based-link-prediction-analysis-for","title":"Learning-based link prediction analysis for Facebook100 network","date":"2020-08-01","arxiv_id":"2008.00308","repositories_listed":0,"syntology":null},{"url":null,"slug":"representation-learning-of-graphs-using-graph","title":"Representation Learning of Graphs Using Graph Convolutional Multilayer Networks Based on Motifs","date":"2020-07-31","arxiv_id":"2007.15838","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-a-bernoulli-autoregression-framework-for","title":"On a Bernoulli Autoregression Framework for Link Discovery and Prediction","date":"2020-07-23","arxiv_id":"2007.11811","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-multi-semantic-metapath-model-for-large","title":"A Multi-Semantic Metapath Model for Large Scale Heterogeneous Network Representation Learning","date":"2020-07-19","arxiv_id":"2007.11380","repositories_listed":0,"syntology":null},{"url":null,"slug":"dual-graph-embedding-for-object-tag","title":"Dual Graph Embedding for Object-Tag LinkPrediction on the Knowledge Graph","date":"2020-07-16","arxiv_id":"2007.08304","repositories_listed":0,"syntology":null},{"url":null,"slug":"grade-graph-dynamic-embedding","title":"GRADE: Graph Dynamic Embedding","date":"2020-07-16","arxiv_id":"2007.08060","repositories_listed":0,"syntology":null},{"url":null,"slug":"are-hyperbolic-representations-in-graphs","title":"Are Hyperbolic Representations in Graphs Created Equal?","date":"2020-07-15","arxiv_id":"2007.07698","repositories_listed":0,"syntology":null},{"url":null,"slug":"integrating-logical-rules-into-neural-multi","title":"Integrating Logical Rules Into Neural Multi-Hop Reasoning for Drug Repurposing","date":"2020-07-10","arxiv_id":"2007.05292","repositories_listed":0,"syntology":null},{"url":null,"slug":"next-waves-in-veridical-network-embedding","title":"Next Waves in Veridical Network Embedding","date":"2020-07-10","arxiv_id":"2007.05385","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-heterogeneous-information-networks","title":"Pre-Trained Models for Heterogeneous Information Networks","date":"2020-07-07","arxiv_id":"2007.03184","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphopt-learning-optimization-models-of","title":"GraphOpt: Learning Optimization Models of Graph Formation","date":"2020-07-07","arxiv_id":"2007.03619","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-topology-inference-from-streaming","title":"Online Topology Inference from Streaming Stationary Graph Signals with Partial Connectivity Information","date":"2020-07-07","arxiv_id":"2007.03653","repositories_listed":0,"syntology":null},{"url":null,"slug":"software-engineering-event-modeling-using","title":"Software Engineering Event Modeling using Relative Time in Temporal Knowledge Graphs","date":"2020-07-02","arxiv_id":"2007.01231","repositories_listed":0,"syntology":null},{"url":null,"slug":"premise-selection-in-natural-language","title":"Premise Selection in Natural Language Mathematical Texts","date":"2020-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-clustering-with-graph-neural-networks","title":"Graph Clustering with Graph Neural Networks","date":"2020-06-30","arxiv_id":"2006.16904","repositories_listed":0,"syntology":null},{"url":null,"slug":"mobile-link-prediction-automated-creation-and","title":"Mobile Link Prediction: Automated Creation and Crowd-sourced Validation of Knowledge Graphs","date":"2020-06-30","arxiv_id":"2006.16858","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-learning-for-debiasing-knowledge","title":"Adversarial Learning for Debiasing Knowledge Graph Embeddings","date":"2020-06-29","arxiv_id":"2006.16309","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-parametric-graph-learning-for-bayesian","title":"Non-Parametric Graph Learning for Bayesian Graph Neural Networks","date":"2020-06-23","arxiv_id":"2006.13335","repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-evolution-with-approximated","title":"Spectral Evolution with Approximated Eigenvalue Trajectories for Link Prediction","date":"2020-06-22","arxiv_id":"2006.12657","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantifying-challenges-in-the-application-of","title":"Quantifying Challenges in the Application of Graph Representation Learning","date":"2020-06-18","arxiv_id":"2006.10252","repositories_listed":0,"syntology":null},{"url":null,"slug":"weisfeiler-lehman-embedding-for-molecular","title":"Weisfeiler-Lehman Embedding for Molecular Graph Neural Networks","date":"2020-06-12","arxiv_id":"2006.06909","repositories_listed":0,"syntology":null},{"url":null,"slug":"bi-level-graph-neural-networks-for-drug-drug","title":"Bi-Level Graph Neural Networks for Drug-Drug Interaction Prediction","date":"2020-06-11","arxiv_id":"2006.14002","repositories_listed":0,"syntology":null},{"url":null,"slug":"5-knowledge-graph-embeddings-with-projective","title":"5* Knowledge Graph Embeddings with Projective Transformations","date":"2020-06-08","arxiv_id":"2006.04986","repositories_listed":0,"syntology":null},{"url":null,"slug":"eigen-gnn-a-graph-structure-preserving-plug","title":"Eigen-GNN: A Graph Structure Preserving Plug-in for GNNs","date":"2020-06-08","arxiv_id":"2006.04330","repositories_listed":0,"syntology":null},{"url":null,"slug":"kolmogorov-regularization-for-link-prediction","title":"Investigating Estimated Kolmogorov Complexity as a Means of Regularization for Link Prediction","date":"2020-06-07","arxiv_id":"2006.04258","repositories_listed":0,"syntology":null},{"url":null,"slug":"link-prediction-for-temporally-consistent","title":"Link Prediction for Temporally Consistent Networks","date":"2020-06-06","arxiv_id":"2006.03804","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-level-graph-convolutional-networks-for","title":"Multi-level Graph Convolutional Networks for Cross-platform Anchor Link Prediction","date":"2020-06-02","arxiv_id":"2006.01963","repositories_listed":0,"syntology":null},{"url":null,"slug":"relational-learning-analysis-of-social","title":"Relational Learning Analysis of Social Politics using Knowledge Graph Embedding","date":"2020-06-02","arxiv_id":"2006.01626","repositories_listed":0,"syntology":null},{"url":null,"slug":"nenet-an-edge-learnable-network-for-link","title":"NENET: An Edge Learnable Network for Link Prediction in Scene Text","date":"2020-05-25","arxiv_id":"2005.12147","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-stochastic-block-model-scalable","title":"Neural Stochastic Block Model & Scalable Community-Based Graph Learning","date":"2020-05-16","arxiv_id":"2005.07855","repositories_listed":0,"syntology":null},{"url":null,"slug":"foundations-and-modelling-of-dynamic-networks","title":"Foundations and modelling of dynamic networks using Dynamic Graph Neural Networks: A survey","date":"2020-05-13","arxiv_id":"2005.07496","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-symbolic-relational-reasoning-on-graph","title":"Neural-Symbolic Relational Reasoning on Graph Models: Effective Link Inference and Computation from Knowledge Bases","date":"2020-05-05","arxiv_id":"2005.02525","repositories_listed":0,"syntology":null},{"url":null,"slug":"finding-structural-hole-spanners-based-on","title":"Finding structural hole spanners based on community forest model and diminishing marginal utility in large scale social networks","date":"2020-04-24","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"semantic-entity-enrichment-by-leveraging","title":"Semantic Entity Enrichment by Leveraging Multilingual Descriptions for Link Prediction","date":"2020-04-22","arxiv_id":"2004.10640","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-structured-embeddings-of-knowledge","title":"Learning Structured Embeddings of Knowledge Graphs with Adversarial Learning Framework","date":"2020-04-15","arxiv_id":"2004.07265","repositories_listed":0,"syntology":null},{"url":null,"slug":"wasserstein-adversarial-autoencoders-for","title":"Drug-Drug Interaction Prediction with Wasserstein Adversarial Autoencoder-based Knowledge Graph Embeddings","date":"2020-04-15","arxiv_id":"2004.07341","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-effects-of-random-walk-based","title":"Exploring Effects of Random Walk Based Minibatch Selection Policy on Knowledge Graph Completion","date":"2020-04-12","arxiv_id":"2004.05553","repositories_listed":0,"syntology":null},{"url":null,"slug":"heuristics-for-link-prediction-in-multiplex","title":"Heuristics for Link Prediction in Multiplex Networks","date":"2020-04-09","arxiv_id":"2004.04704","repositories_listed":0,"syntology":null},{"url":null,"slug":"privacy-shadow-measuring-node-predictability","title":"Privacy Shadow: Measuring Node Predictability and Privacy Over Time","date":"2020-04-04","arxiv_id":"2004.02047","repositories_listed":0,"syntology":null},{"url":null,"slug":"attribute2vec-deep-network-embedding-through","title":"Attribute2vec: Deep Network Embedding Through Multi-Filtering GCN","date":"2020-04-03","arxiv_id":"2004.01375","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-the-utility-of-knowledge-graph","title":"Evaluating the Calibration of Knowledge Graph Embeddings for Trustworthy Link Prediction","date":"2020-04-02","arxiv_id":"2004.01168","repositories_listed":0,"syntology":null},{"url":null,"slug":"continual-graph-learning","title":"Overcoming Catastrophic Forgetting in Graph Neural Networks with Experience Replay","date":"2020-03-22","arxiv_id":"2003.09908","repositories_listed":0,"syntology":null},{"url":null,"slug":"bipartite-link-prediction-based-on","title":"Bipartite Link Prediction based on Topological Features via 2-hop Path","date":"2020-03-19","arxiv_id":"2003.08572","repositories_listed":0,"syntology":null},{"url":null,"slug":"relatext-exploiting-visual-relationships-for","title":"ReLaText: Exploiting Visual Relationships for Arbitrary-Shaped Scene Text Detection with Graph Convolutional Networks","date":"2020-03-16","arxiv_id":"2003.06999","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-graphs-and-knowledge-networks-the","title":"Knowledge Graphs and Knowledge Networks: The Story in Brief","date":"2020-03-07","arxiv_id":"2003.03623","repositories_listed":0,"syntology":null},{"url":null,"slug":"link-prediction-using-graph-neural-networks","title":"Link Prediction using Graph Neural Networks for Master Data Management","date":"2020-03-07","arxiv_id":"2003.04732","repositories_listed":0,"syntology":null},{"url":null,"slug":"epine-enhanced-proximity-information-network","title":"EPINE: Enhanced Proximity Information Network Embedding","date":"2020-03-04","arxiv_id":"2003.02689","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-supervised-graph-representation-learning","title":"Self-Supervised Graph Representation Learning via Global Context Prediction","date":"2020-03-03","arxiv_id":"2003.01604","repositories_listed":0,"syntology":null},{"url":null,"slug":"dsslp-a-distributed-framework-for-semi","title":"DSSLP: A Distributed Framework for Semi-supervised Link Prediction","date":"2020-02-27","arxiv_id":"2002.12056","repositories_listed":0,"syntology":null},{"url":null,"slug":"smoothing-graphons-for-modelling-exchangeable","title":"Smoothing Graphons for Modelling Exchangeable Relational Data","date":"2020-02-25","arxiv_id":"2002.11159","repositories_listed":0,"syntology":null},{"url":null,"slug":"recurrent-dirichlet-belief-networks-for","title":"Recurrent Dirichlet Belief Networks for Interpretable Dynamic Relational Data Modelling","date":"2020-02-24","arxiv_id":"2002.10235","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-augmentation-for-personal-knowledge","title":"Data Augmentation for Personal Knowledge Base Population","date":"2020-02-23","arxiv_id":"2002.10943","repositories_listed":0,"syntology":null},{"url":null,"slug":"investigating-extensions-to-random-walk-based","title":"Investigating Extensions to Random Walk Based Graph Embedding","date":"2020-02-17","arxiv_id":"2002.07252","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-convolutional-gaussian-processes-for","title":"Graph Convolutional Gaussian Processes For Link Prediction","date":"2020-02-11","arxiv_id":"2002.04337","repositories_listed":0,"syntology":null},{"url":null,"slug":"pre-training-tasks-for-embedding-based-large","title":"Pre-training Tasks for Embedding-based Large-scale Retrieval","date":"2020-02-10","arxiv_id":"2002.03932","repositories_listed":0,"syntology":null},{"url":null,"slug":"alpine-active-link-prediction-using-network","title":"ALPINE: Active Link Prediction using Network Embedding","date":"2020-02-04","arxiv_id":"2002.01227","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-much-and-when-do-we-need-higher-order","title":"How Much and When Do We Need Higher-order Information in Hypergraphs? A Case Study on Hyperedge Prediction","date":"2020-01-30","arxiv_id":"2001.11181","repositories_listed":0,"syntology":null},{"url":null,"slug":"linking-bank-clients-using-graph-neural","title":"Linking Bank Clients using Graph Neural Networks Powered by Rich Transactional Data","date":"2020-01-23","arxiv_id":"2001.08427","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-ordering-towards-the-optimal-by","title":"Graph Ordering: Towards the Optimal by Learning","date":"2020-01-18","arxiv_id":"2001.06631","repositories_listed":0,"syntology":null},{"url":null,"slug":"document-network-projection-in-pretrained","title":"Document Network Projection in Pretrained Word Embedding Space","date":"2020-01-16","arxiv_id":"2001.05727","repositories_listed":0,"syntology":null},{"url":null,"slug":"social-science-guided-feature-engineering-a","title":"Social Science Guided Feature Engineering: A Novel Approach to Signed Link Analysis","date":"2020-01-04","arxiv_id":"2001.01015","repositories_listed":0,"syntology":null},{"url":"/paper/knowledge-graph-embedding-via-graph","slug":"knowledge-graph-embedding-via-graph","title":"Knowledge Graph Embedding via Graph Attenuated Attention Networks","date":"2019-12-31","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-as-an-evaluation-protocol-for","title":"Clustering as an Evaluation Protocol for Knowledge Embedding Representation of Categorised Multi-relational Data in the Clinical Domain","date":"2019-12-29","arxiv_id":"2002.09473","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-computation-of-katz-index-for-efficient","title":"Fast Computation of Katz Index for Efficient Processing of Link Prediction Queries","date":"2019-12-13","arxiv_id":"1912.06525","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-node-embedding-a-direct-unsupervised","title":"Beyond Node Embedding: A Direct Unsupervised Edge Representation Framework for Homogeneous Networks","date":"2019-12-11","arxiv_id":"1912.05140","repositories_listed":0,"syntology":null},{"url":null,"slug":"cross-domain-recommendation-via-preference","title":"Cross-Domain Recommendation via Preference Propagation GraphNet","date":"2019-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"pretrain-kges-learning-knowledge","title":"Pretrain-KGEs: Learning Knowledge Representation from Pretrained Models for Knowledge Graph Embeddings","date":"2019-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"link-prediction-in-the-stochastic-block-model","title":"Outliers Detection in Networks with Missing Links","date":"2019-11-29","arxiv_id":"1911.13122","repositories_listed":0,"syntology":null},{"url":null,"slug":"retro-relation-retrofitting-for-in-database","title":"RETRO: Relation Retrofitting For In-Database Machine Learning on Textual Data","date":"2019-11-28","arxiv_id":"1911.12674","repositories_listed":0,"syntology":null},{"url":null,"slug":"effective-decoding-in-graph-auto-encoder","title":"Effective Decoding in Graph Auto-Encoder using Triadic Closure","date":"2019-11-26","arxiv_id":"1911.11322","repositories_listed":0,"syntology":null},{"url":null,"slug":"generative-temporal-link-prediction-via-self","title":"Generative Temporal Link Prediction via Self-tokenized Sequence Modeling","date":"2019-11-26","arxiv_id":"1911.11486","repositories_listed":0,"syntology":null},{"url":null,"slug":"network-embedding-an-overview","title":"Network Embedding: An Overview","date":"2019-11-26","arxiv_id":"1911.11726","repositories_listed":0,"syntology":null},{"url":null,"slug":"time-aware-gradient-attack-on-dynamic-network","title":"Time-aware Gradient Attack on Dynamic Network Link Prediction","date":"2019-11-24","arxiv_id":"1911.10561","repositories_listed":0,"syntology":null},{"url":null,"slug":"exponential-family-graph-embeddings","title":"Exponential Family Graph Embeddings","date":"2019-11-20","arxiv_id":"1911.09007","repositories_listed":0,"syntology":null},{"url":null,"slug":"restricted-boltzmann-stochastic-block-model-a","title":"Equipping SBMs with RBMs: An Explainable Approach for Analysis of Networks with Covariates","date":"2019-11-11","arxiv_id":"1911.04172","repositories_listed":0,"syntology":null},{"url":"/paper/orthogonal-relation-transforms-with-graph","slug":"orthogonal-relation-transforms-with-graph","title":"Orthogonal Relation Transforms with Graph Context Modeling for Knowledge Graph Embedding","date":"2019-11-09","arxiv_id":"1911.04910","repositories_listed":0,"syntology":null},{"url":"/paper/relation-adversarial-network-for-low-resource","slug":"relation-adversarial-network-for-low-resource","title":"Relation Adversarial Network for Low Resource Knowledge Graph Completion","date":"2019-11-08","arxiv_id":"1911.03091","repositories_listed":0,"syntology":null}],"record_sha256":"aa14b5ae4f492a0db0f58ecd469670f281df53cbb8c69d80ba5f369841463471","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}