{"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/14","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":14,"pages_in_order":20,"rows_per_page":100,"rows":[1301,1400],"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/13","next":"/task/link-prediction/papers/15","papers":[{"url":null,"slug":"spiking-variational-graph-auto-encoders-for","title":"Spiking Variational Graph Auto-Encoders for Efficient Graph Representation Learning","date":"2022-10-24","arxiv_id":"2211.01952","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-magnetic-framelet-based-convolutional","title":"A Magnetic Framelet-Based Convolutional Neural Network for Directed Graphs","date":"2022-10-20","arxiv_id":"2210.10993","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalized-reciprocal-perspective","title":"Generalized Reciprocal Perspective","date":"2022-10-20","arxiv_id":"2210.11616","repositories_listed":0,"syntology":null},{"url":null,"slug":"linkless-link-prediction-via-relational","title":"Linkless Link Prediction via Relational Distillation","date":"2022-10-11","arxiv_id":"2210.05801","repositories_listed":0,"syntology":null},{"url":"/paper/gidn-a-lightweight-graph-inception-diffusion","slug":"gidn-a-lightweight-graph-inception-diffusion","title":"GIDN: A Lightweight Graph Inception Diffusion Network for High-efficient Link Prediction","date":"2022-10-04","arxiv_id":"2210.01301","repositories_listed":0,"syntology":null},{"url":null,"slug":"tpgnn-learning-high-order-information-in","title":"TPGNN: Learning High-order Information in Dynamic Graphs via Temporal Propagation","date":"2022-10-03","arxiv_id":"2210.01171","repositories_listed":0,"syntology":null},{"url":null,"slug":"optice-a-coherence-theory-based-model-for","title":"OpticE: A Coherence Theory-Based Model for Link Prediction","date":"2022-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"resource-of-wikipedias-in-31-languages","title":"Resource of Wikipedias in 31 Languages Categorized into Fine-Grained Named Entities","date":"2022-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"rotatect-knowledge-graph-embedding-by","title":"RotateCT: Knowledge Graph Embedding by Rotation and Coordinate Transformation in Complex Space","date":"2022-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"temporal-knowledge-graph-completion-with","title":"Temporal Knowledge Graph Completion with Approximated Gaussian Process Embedding","date":"2022-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"direct-embedding-of-temporal-network-edges","title":"Direct Embedding of Temporal Network Edges via Time-Decayed Line Graphs","date":"2022-09-30","arxiv_id":"2210.00032","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-anomaly-detection-with-graph-neural","title":"Graph Anomaly Detection with Graph Neural Networks: Current Status and Challenges","date":"2022-09-29","arxiv_id":"2209.14930","repositories_listed":0,"syntology":null},{"url":null,"slug":"finding-global-liquefied-natural-gas","title":"Finding Global Liquefied Natural Gas Potential Trade Relations Based on Improved Link Prediction","date":"2022-09-22","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-symbolic-entangled-framework-for","title":"Neural-Symbolic Entangled Framework for Complex Query Answering","date":"2022-09-19","arxiv_id":"2209.08779","repositories_listed":0,"syntology":null},{"url":null,"slug":"flashlight-scalable-link-prediction-with","title":"Flashlight: Scalable Link Prediction with Effective Decoders","date":"2022-09-17","arxiv_id":"2209.10100","repositories_listed":0,"syntology":null},{"url":null,"slug":"spgp-structure-prototype-guided-graph-pooling","title":"SPGP: Structure Prototype Guided Graph Pooling","date":"2022-09-16","arxiv_id":"2209.07817","repositories_listed":0,"syntology":null},{"url":null,"slug":"hub-aware-random-walk-graph-embedding-methods","title":"Hub-aware Random Walk Graph Embedding Methods for Classification","date":"2022-09-15","arxiv_id":"2209.07603","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-graph-completion-with-pre-trained","title":"Knowledge Graph Completion with Pre-trained Multimodal Transformer and Twins Negative Sampling","date":"2022-09-15","arxiv_id":"2209.07084","repositories_listed":0,"syntology":null},{"url":null,"slug":"manifold-rewiring-for-unlabeled-imaging","title":"Manifold Rewiring for Unlabeled Imaging","date":"2022-09-12","arxiv_id":"2209.05168","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-complex-network-based-graph-embedding","title":"A Complex Network based Graph Embedding Method for Link Prediction","date":"2022-09-11","arxiv_id":"2209.04884","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-supervised-learning-for-heterogeneous","title":"Self-supervised Learning for Heterogeneous Graph via Structure Information based on Metapath","date":"2022-09-09","arxiv_id":"2209.04218","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-supervised-training-for-knowledge-base","title":"Semi-supervised Training for Knowledge Base Graph Self-attention Networks on Link Prediction","date":"2022-09-03","arxiv_id":"2209.01350","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploiting-hybrid-semantics-of-relation-paths","title":"Exploiting Hybrid Semantics of Relation Paths for Multi-hop Question Answering Over Knowledge Graphs","date":"2022-09-02","arxiv_id":"2209.00870","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-distance-neural-networks-for-predicting","title":"Graph Distance Neural Networks for Predicting Multiple Drug Interactions","date":"2022-08-30","arxiv_id":"2208.14810","repositories_listed":0,"syntology":null},{"url":null,"slug":"influence-maximization-im-in-complex-networks","title":"Influence Maximization (IM) in Complex Networks with Limited Visibility Using Statistical Methods","date":"2022-08-28","arxiv_id":"2208.13166","repositories_listed":0,"syntology":null},{"url":null,"slug":"kgxboard-explainable-and-interactive","title":"KGxBoard: Explainable and Interactive Leaderboard for Evaluation of Knowledge Graph Completion Models","date":"2022-08-23","arxiv_id":"2208.11024","repositories_listed":0,"syntology":null},{"url":null,"slug":"link-prediction-with-continuous-time","title":"Link prediction with continuous-time classical and quantum walks","date":"2022-08-23","arxiv_id":"2208.11030","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-influence-of-network-structural","title":"TPM: Transition Probability Matrix -- Graph Structural Feature based Embedding","date":"2022-08-07","arxiv_id":"2208.03712","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-regularized-nonnegative-latent-factor","title":"Graph Regularized Nonnegative Latent Factor Analysis Model for Temporal Link Prediction in Cryptocurrency Transaction Networks","date":"2022-08-03","arxiv_id":"2208.01923","repositories_listed":0,"syntology":null},{"url":null,"slug":"link-prediction-on-heterophilic-graphs-via","title":"Link Prediction on Heterophilic Graphs via Disentangled Representation Learning","date":"2022-08-03","arxiv_id":"2208.01820","repositories_listed":0,"syntology":null},{"url":null,"slug":"kg-nsf-knowledge-graph-completion-with-a","title":"KG-NSF: Knowledge Graph Completion with a Negative-Sample-Free Approach","date":"2022-07-29","arxiv_id":"2207.14617","repositories_listed":0,"syntology":null},{"url":null,"slug":"label-only-membership-inference-attack","title":"Label-Only Membership Inference Attack against Node-Level Graph Neural Networks","date":"2022-07-27","arxiv_id":"2207.13766","repositories_listed":0,"syntology":null},{"url":null,"slug":"benchmarking-gnn-based-recommender-systems-on","title":"Analysis and Optimization of GNN-Based Recommender Systems on Persistent Memory","date":"2022-07-25","arxiv_id":"2207.11918","repositories_listed":0,"syntology":null},{"url":"/paper/autoweird-weird-translational-scoring","slug":"autoweird-weird-translational-scoring","title":"AutoWeird: Weird Translational Scoring Function Identified by Random Search","date":"2022-07-24","arxiv_id":"2207.11673","repositories_listed":0,"syntology":null},{"url":null,"slug":"explaining-dynamic-graph-neural-networks-via","title":"Explaining Dynamic Graph Neural Networks via Relevance Back-propagation","date":"2022-07-22","arxiv_id":"2207.11175","repositories_listed":0,"syntology":null},{"url":null,"slug":"v-coder-adaptive-autoencoder-for-semantic","title":"V-Coder: Adaptive AutoEncoder for Semantic Disclosure in Knowledge Graphs","date":"2022-07-22","arxiv_id":"2208.01735","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-approach-for-link-prediction-in-directed","title":"An Approach for Link Prediction in Directed Complex Networks based on Asymmetric Similarity-Popularity","date":"2022-07-15","arxiv_id":"2207.07399","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-hyperlink-prediction","title":"A Survey on Hyperlink Prediction","date":"2022-07-06","arxiv_id":"2207.02911","repositories_listed":0,"syntology":null},{"url":null,"slug":"text-enriched-sparse-hyperbolic-graph","title":"Text Enriched Sparse Hyperbolic Graph Convolutional Networks","date":"2022-07-06","arxiv_id":"2207.02368","repositories_listed":0,"syntology":null},{"url":null,"slug":"constraint-based-multi-hop-question-answering","title":"Constraint-based Multi-hop Question Answering with Knowledge Graph","date":"2022-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"rgl-a-simple-yet-effective-relation-graph-1","title":"RGL: A Simple yet Effective Relation Graph Augmented Prompt-based Tuning Approach for Few-Shot Learning","date":"2022-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-amortized-relational-model-with-group","title":"Deep Amortized Relational Model with Group-Wise Hierarchical Generative Process","date":"2022-06-28","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multisage-a-multiplex-embedding-algorithm-for","title":"MultiSAGE: a multiplex embedding algorithm for inter-layer link prediction","date":"2022-06-24","arxiv_id":"2206.13223","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-and-effective-training-of-language","title":"Efficient and effective training of language and graph neural network models","date":"2022-06-22","arxiv_id":"2206.10781","repositories_listed":0,"syntology":null},{"url":null,"slug":"temporal-link-prediction-via-adjusted-sigmoid","title":"Temporal Link Prediction via Adjusted Sigmoid Function and 2-Simplex Sructure","date":"2022-06-20","arxiv_id":"2206.09529","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-knowledge-graph-embedding-via","title":"Confidence-aware Self-Semantic Distillation on Knowledge Graph Embedding","date":"2022-06-07","arxiv_id":"2206.02963","repositories_listed":0,"syntology":null},{"url":null,"slug":"schema-guided-event-graph-completion","title":"Schema-Guided Event Graph Completion","date":"2022-06-06","arxiv_id":"2206.02921","repositories_listed":0,"syntology":null},{"url":null,"slug":"introducing-rezojdm16k-a-french","title":"Introducing RezoJDM16k: a French KnowledgeGraph DataSet for Link Prediction","date":"2022-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"anchor-prediction-a-topic-modeling-approach","title":"Anchor Prediction: A Topic Modeling Approach","date":"2022-05-29","arxiv_id":"2205.14631","repositories_listed":0,"syntology":null},{"url":null,"slug":"contributions-to-representation-learning-with","title":"Contributions to Representation Learning with Graph Autoencoders and Applications to Music Recommendation","date":"2022-05-29","arxiv_id":"2205.14651","repositories_listed":0,"syntology":null},{"url":null,"slug":"cep3-community-event-prediction-with-neural","title":"CEP3: Community Event Prediction with Neural Point Process on Graph","date":"2022-05-21","arxiv_id":"2205.10624","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-meta-representations-of-one-shot","title":"Learning Meta Representations of One-shot Relations for Temporal Knowledge Graph Link Prediction","date":"2022-05-21","arxiv_id":"2205.10621","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-graph-structure-from-convolutional-1","title":"Learning Graph Structure from Convolutional Mixtures","date":"2022-05-19","arxiv_id":"2205.09575","repositories_listed":0,"syntology":null},{"url":null,"slug":"parallel-and-distributed-graph-neural","title":"Parallel and Distributed Graph Neural Networks: An In-Depth Concurrency Analysis","date":"2022-05-19","arxiv_id":"2205.09702","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-birds-eye-view-on-knowledge-graph","title":"A Birds Eye View on Knowledge Graph Embeddings, Software Libraries, Applications and Challenges","date":"2022-05-18","arxiv_id":"2205.09088","repositories_listed":0,"syntology":null},{"url":null,"slug":"kgnn-distributed-framework-for-graph-neural","title":"KGNN: Distributed Framework for Graph Neural Knowledge Representation","date":"2022-05-17","arxiv_id":"2205.08285","repositories_listed":0,"syntology":null},{"url":null,"slug":"ndggnet-a-node-independent-gate-based-graph","title":"NDGGNET-A Node Independent Gate based Graph Neural Networks","date":"2022-05-11","arxiv_id":"2205.05348","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-graph-embedding-by-adaptive-limit","title":"Knowledge Graph Embedding by Adaptive Limit Scoring Loss Using Dynamic Weighting Strategy","date":"2022-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-masked-language-models-for-contextual-link","title":"On Masked Language Models for Contextual Link Prediction","date":"2022-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"hyperbolic-hierarchical-knowledge-graph","title":"Hyperbolic Hierarchical Knowledge Graph Embeddings for Link Prediction in Low Dimensions","date":"2022-04-28","arxiv_id":"2204.13704","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-pseudo-siamese-policy-network-for","title":"Adaptive Pseudo-Siamese Policy Network for Temporal Knowledge Prediction","date":"2022-04-26","arxiv_id":"2204.12036","repositories_listed":0,"syntology":null},{"url":null,"slug":"meker-memory-efficient-knowledge-embedding","title":"MEKER: Memory Efficient Knowledge Embedding Representation for Link Prediction and Question Answering","date":"2022-04-22","arxiv_id":"2204.10629","repositories_listed":0,"syntology":null},{"url":null,"slug":"automating-neural-architecture-design-without","title":"Automating Neural Architecture Design without Search","date":"2022-04-21","arxiv_id":"2204.11838","repositories_listed":0,"syntology":null},{"url":null,"slug":"spacee-knowledge-graph-embedding-by","title":"SpaceE: Knowledge Graph Embedding by Relational Linear Transformation in the Entity Space","date":"2022-04-21","arxiv_id":"2204.10245","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-camera-multiple-3d-object-tracking-on","title":"Multi-Camera Multiple 3D Object Tracking on the Move for Autonomous Vehicles","date":"2022-04-19","arxiv_id":"2204.09151","repositories_listed":0,"syntology":null},{"url":null,"slug":"rnnctps-a-neural-symbolic-reasoning-method","title":"RNNCTPs: A Neural Symbolic Reasoning Method Using Dynamic Knowledge Partitioning Technology","date":"2022-04-19","arxiv_id":"2204.08810","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledgebra-an-algebraic-learning-framework","title":"Knowledgebra: An Algebraic Learning Framework for Knowledge Graph","date":"2022-04-15","arxiv_id":"2204.07328","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-view-graph-structure-learning-using","title":"Multi-view graph structure learning using subspace merging on Grassmann manifold","date":"2022-04-11","arxiv_id":"2204.05258","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-graph-representation-learning","title":"A Survey on Graph Representation Learning Methods","date":"2022-04-04","arxiv_id":"2204.01855","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-unsupervised-cluster-level-based-method","title":"An unsupervised cluster-level based method for learning node representations of heterogeneous graphs in scientific papers","date":"2022-03-31","arxiv_id":"2203.16751","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-neighborhood-based-link-prediction","title":"Revisiting Neighborhood-based Link Prediction for Collaborative Filtering","date":"2022-03-29","arxiv_id":"2203.15789","repositories_listed":0,"syntology":null},{"url":null,"slug":"context-dependent-anomaly-detection-with","title":"Context-Dependent Anomaly Detection with Knowledge Graph Embedding Models","date":"2022-03-17","arxiv_id":"2203.09354","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhanced-temporal-knowledge-embeddings-with","title":"ECOLA: Enhanced Temporal Knowledge Embeddings with Contextualized Language Representations","date":"2022-03-17","arxiv_id":"2203.09590","repositories_listed":0,"syntology":null},{"url":"/paper/rotateqvs-representing-temporal-information","slug":"rotateqvs-representing-temporal-information","title":"RotateQVS: Representing Temporal Information as Rotations in Quaternion Vector Space for Temporal Knowledge Graph Completion","date":"2022-03-15","arxiv_id":"2203.07993","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-theorem-provers-delineating-search","title":"Neural Theorem Provers Delineating Search Area Using RNN","date":"2022-03-14","arxiv_id":"2203.06985","repositories_listed":0,"syntology":null},{"url":null,"slug":"language-model-driven-negative-sampling","title":"LEMON: LanguagE ModeL for Negative Sampling of Knowledge Graph Embeddings","date":"2022-03-09","arxiv_id":"2203.04703","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-partial-multiplex-network-embedding","title":"Deep Partial Multiplex Network Embedding","date":"2022-03-05","arxiv_id":"2203.02656","repositories_listed":0,"syntology":null},{"url":null,"slug":"pay-attention-to-relations-multi-embeddings","title":"Pay Attention to Relations: Multi-embeddings for Attributed Multiplex Networks","date":"2022-03-03","arxiv_id":"2203.01903","repositories_listed":0,"syntology":null},{"url":null,"slug":"htgn-btw-heterogeneous-temporal-graph-network","title":"HTGN-BTW: Heterogeneous Temporal Graph Network with Bi-Time-Window Training Strategy for Temporal Link Prediction","date":"2022-02-25","arxiv_id":"2202.12713","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-the-level-of-autism-discrimination","title":"Improving the Level of Autism Discrimination through GraphRNN Link Prediction","date":"2022-02-19","arxiv_id":"2202.09538","repositories_listed":0,"syntology":null},{"url":null,"slug":"geometric-algebra-based-embeddings-for","title":"Geometric Algebra based Embeddings for Static and Temporal Knowledge Graph Completion","date":"2022-02-18","arxiv_id":"2202.09464","repositories_listed":0,"syntology":null},{"url":null,"slug":"cengcn-centralized-convolutional-networks","title":"CenGCN: Centralized Convolutional Networks with Vertex Imbalance for Scale-Free Graphs","date":"2022-02-16","arxiv_id":"2202.07826","repositories_listed":0,"syntology":null},{"url":null,"slug":"star-knowledge-graph-embedding-by-scaling-1","title":"STaR: Knowledge Graph Embedding by Scaling, Translation and Rotation","date":"2022-02-15","arxiv_id":"2202.07130","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-asymmetric-embedding-for-attributed","title":"Learning Asymmetric Embedding for Attributed Networks via Convolutional Neural Network","date":"2022-02-13","arxiv_id":"2202.06307","repositories_listed":0,"syntology":null},{"url":"/paper/interht-knowledge-graph-embeddings-by","slug":"interht-knowledge-graph-embeddings-by","title":"InterHT: Knowledge Graph Embeddings by Interaction between Head and Tail Entities","date":"2022-02-10","arxiv_id":"2202.04897","repositories_listed":0,"syntology":null},{"url":null,"slug":"bandit-sampling-for-multiplex-networks","title":"Bandit Sampling for Multiplex Networks","date":"2022-02-08","arxiv_id":"2202.03621","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-loosely-coupling-knowledge-graph","title":"Towards Loosely-Coupling Knowledge Graph Embeddings and Ontology-based Reasoning","date":"2022-02-07","arxiv_id":"2202.03173","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-dynamic-effective-connectivity","title":"Deep Dynamic Effective Connectivity Estimation from Multivariate Time Series","date":"2022-02-04","arxiv_id":"2202.02393","repositories_listed":0,"syntology":null},{"url":null,"slug":"collaborative-filtering-via-heterogeneous","title":"Collaborative filtering via heterogeneous neural networks","date":"2022-02-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/pppne-personalized-proximity-preserved","slug":"pppne-personalized-proximity-preserved","title":"PPPNE: Personalized proximity preserved network embedding","date":"2022-02-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-representations-of-entities-and","title":"Learning Representations of Entities and Relations","date":"2022-01-31","arxiv_id":"2201.13073","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairmod-fair-link-prediction-and","title":"FairEGM: Fair Link Prediction and Recommendation via Emulated Graph Modification","date":"2022-01-27","arxiv_id":"2201.11596","repositories_listed":0,"syntology":null},{"url":null,"slug":"link-prediction-with-contextualized-self","title":"Link Prediction with Contextualized Self-Supervision","date":"2022-01-25","arxiv_id":"2201.10069","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-learning-of-hierarchical-community","title":"Joint Learning of Hierarchical Community Structure and Node Representations: An Unsupervised Approach","date":"2022-01-22","arxiv_id":"2201.09086","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-node-representation-learning-via-1","title":"Fair Node Representation Learning via Adaptive Data Augmentation","date":"2022-01-21","arxiv_id":"2201.08549","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-dyadic-fairness-exploring-and-mitigating-1","title":"On Dyadic Fairness: Exploring and Mitigating Bias in Graph Connections","date":"2022-01-17","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"siggan-adversarial-model-for-learning-signed","title":"SigGAN : Adversarial Model for Learning Signed Relationships in Networks","date":"2022-01-17","arxiv_id":"2201.06437","repositories_listed":0,"syntology":null},{"url":null,"slug":"combinatorial-scientific-discovery-finding","title":"Combinatorial Scientific Discovery: Finding New Concept Combinations Beyond Link Prediction","date":"2022-01-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-layout-aware-pretraining-for","title":"Efficient layout-aware pretraining for multimodal form understanding","date":"2022-01-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"kgrefiner-knowledge-graph-refinement-for-1","title":"KGRefiner: Knowledge Graph Refinement for Improving Accuracy of Translational Link Prediction Methods","date":"2022-01-16","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"306767046a0ceea425e95a08f4e9cd191b1bc97af5cd17581c86b62f85c4e6fc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}