{"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/13","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":13,"pages_in_order":20,"rows_per_page":100,"rows":[1201,1300],"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/12","next":"/task/link-prediction/papers/14","papers":[{"url":null,"slug":"exploring-graph-neural-networks-for-indian","title":"Exploring Graph Neural Networks for Indian Legal Judgment Prediction","date":"2023-10-19","arxiv_id":"2310.12800","repositories_listed":0,"syntology":null},{"url":null,"slug":"accurate-prediction-of-international-trade","title":"Accurate prediction of international trade flows: Leveraging knowledge graphs and their embeddings","date":"2023-10-17","arxiv_id":"2310.11161","repositories_listed":0,"syntology":null},{"url":null,"slug":"network-analysis-of-the-inaturalist-citizen","title":"Network Analysis of the iNaturalist Citizen Science Community","date":"2023-10-16","arxiv_id":"2310.10693","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-link-prediction-for-new-nodes-in","title":"Dynamic Link Prediction for New Nodes in Temporal Graph Networks","date":"2023-10-15","arxiv_id":"2310.09787","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-edge-aware-graph-autoencoder-trained-on","title":"An Edge-Aware Graph Autoencoder Trained on Scale-Imbalanced Data for Traveling Salesman Problems","date":"2023-10-10","arxiv_id":"2310.06543","repositories_listed":0,"syntology":null},{"url":null,"slug":"foreseer-product-aspect-forecasting-using","title":"ForeSeer: Product Aspect Forecasting Using Temporal Graph Embedding","date":"2023-10-07","arxiv_id":"2310.04865","repositories_listed":0,"syntology":null},{"url":null,"slug":"hybrid-recommendation-system-using-graph","title":"Hybrid Recommendation System using Graph Neural Network and BERT Embeddings","date":"2023-10-07","arxiv_id":"2310.04878","repositories_listed":0,"syntology":null},{"url":null,"slug":"kgex-explaining-knowledge-graph-embeddings","title":"KGEx: Explaining Knowledge Graph Embeddings via Subgraph Sampling and Knowledge Distillation","date":"2023-10-02","arxiv_id":"2310.01065","repositories_listed":0,"syntology":null},{"url":null,"slug":"np-2-l-negative-pseudo-partial-labels","title":"NP$^2$L: Negative Pseudo Partial Labels Extraction for Graph Neural Networks","date":"2023-10-02","arxiv_id":"2310.01098","repositories_listed":0,"syntology":null},{"url":null,"slug":"durendal-graph-deep-learning-framework-for","title":"DURENDAL: Graph deep learning framework for temporal heterogeneous networks","date":"2023-09-30","arxiv_id":"2310.00336","repositories_listed":0,"syntology":null},{"url":null,"slug":"sangea-scalable-and-attributed-network","title":"SANGEA: Scalable and Attributed Network Generation","date":"2023-09-27","arxiv_id":"2309.15648","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-graph-embedding-an-overview","title":"Knowledge Graph Embedding: An Overview","date":"2023-09-21","arxiv_id":"2309.12501","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-complete-topology-aware-correlations","title":"Learning Complete Topology-Aware Correlations Between Relations for Inductive Link Prediction","date":"2023-09-20","arxiv_id":"2309.11528","repositories_listed":0,"syntology":null},{"url":null,"slug":"crypto-graph-leveraging-privacy-preserving","title":"Crypto'Graph: Leveraging Privacy-Preserving Distributed Link Prediction for Robust Graph Learning","date":"2023-09-19","arxiv_id":"2309.10890","repositories_listed":0,"syntology":null},{"url":null,"slug":"temporal-smoothness-regularisers-for-neural","title":"Temporal Smoothness Regularisers for Neural Link Predictors","date":"2023-09-16","arxiv_id":"2309.09045","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-parameterised-model-for-link-prediction","title":"A parameterised model for link prediction using node centrality and similarity measure based on graph embedding","date":"2023-09-11","arxiv_id":"2309.05434","repositories_listed":0,"syntology":null},{"url":null,"slug":"over-squashing-in-graph-neural-networks-a","title":"Over-Squashing in Graph Neural Networks: A Comprehensive survey","date":"2023-08-29","arxiv_id":"2308.15568","repositories_listed":0,"syntology":null},{"url":null,"slug":"using-adamic-adar-index-algorithm-to-predict","title":"Using Adamic-Adar Index Algorithm to Predict Volunteer Collaboration: Less is More","date":"2023-08-25","arxiv_id":"2308.13176","repositories_listed":0,"syntology":null},{"url":"/paper/mocosa-momentum-contrast-for-knowledge-graph","slug":"mocosa-momentum-contrast-for-knowledge-graph","title":"MoCoSA: Momentum Contrast for Knowledge Graph Completion with Structure-Augmented Pre-trained Language Models","date":"2023-08-16","arxiv_id":"2308.08204","repositories_listed":0,"syntology":null},{"url":null,"slug":"local-structure-aware-graph-contrastive","title":"Local Structure-aware Graph Contrastive Representation Learning","date":"2023-08-07","arxiv_id":"2308.03271","repositories_listed":0,"syntology":null},{"url":null,"slug":"literal-aware-knowledge-graph-embedding-for","title":"Literal-Aware Knowledge Graph Embedding for Welding Quality Monitoring: A Bosch Case","date":"2023-08-02","arxiv_id":"2308.01105","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-semantically-enriched-embeddings-for","title":"Towards Semantically Enriched Embeddings for Knowledge Graph Completion","date":"2023-07-31","arxiv_id":"2308.00081","repositories_listed":0,"syntology":null},{"url":null,"slug":"select-and-augment-enhanced-dense-retrieval","title":"Select and Augment: Enhanced Dense Retrieval Knowledge Graph Augmentation","date":"2023-07-28","arxiv_id":"2307.15776","repositories_listed":0,"syntology":null},{"url":null,"slug":"huge-huge-unsupervised-graph-embeddings-with","title":"HUGE: Huge Unsupervised Graph Embeddings with TPUs","date":"2023-07-26","arxiv_id":"2307.14490","repositories_listed":0,"syntology":null},{"url":null,"slug":"curriculum-learning-for-graph-neural-networks","title":"Curriculum Learning for Graph Neural Networks: A Multiview Competence-based Approach","date":"2023-07-17","arxiv_id":"2307.08859","repositories_listed":0,"syntology":null},{"url":null,"slug":"disentangling-node-attributes-from-graph","title":"Disentangling Node Attributes from Graph Topology for Improved Generalizability in Link Prediction","date":"2023-07-17","arxiv_id":"2307.08877","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-ood-multi-task-perspective-for-link","title":"A Multi-Task Perspective for Link Prediction with New Relation Types and Nodes","date":"2023-07-12","arxiv_id":"2307.06046","repositories_listed":0,"syntology":null},{"url":null,"slug":"hagnn-hybrid-aggregation-for-heterogeneous","title":"HAGNN: Hybrid Aggregation for Heterogeneous Graph Neural Networks","date":"2023-07-04","arxiv_id":"2307.01636","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-graph-classification-and-link","title":"A Survey on Graph Classification and Link Prediction based on GNN","date":"2023-07-03","arxiv_id":"2307.00865","repositories_listed":0,"syntology":null},{"url":null,"slug":"variational-disentangled-graph-auto-encoders","title":"Variational Disentangled Graph Auto-Encoders for Link Prediction","date":"2023-06-20","arxiv_id":"2306.11315","repositories_listed":0,"syntology":null},{"url":null,"slug":"dual-node-and-edge-fairness-aware-graph","title":"Dual Node and Edge Fairness-Aware Graph Partition","date":"2023-06-16","arxiv_id":"2306.10123","repositories_listed":0,"syntology":null},{"url":null,"slug":"spottarget-rethinking-the-effect-of-target","title":"Pitfalls in Link Prediction with Graph Neural Networks: Understanding the Impact of Target-link Inclusion & Better Practices","date":"2023-06-01","arxiv_id":"2306.00899","repositories_listed":0,"syntology":null},{"url":null,"slug":"research-and-implementation-of-drug-target","title":"Causal Intervention for Measuring Confidence in Drug-Target Interaction Prediction","date":"2023-05-31","arxiv_id":"2306.00041","repositories_listed":0,"syntology":null},{"url":null,"slug":"modeling-dynamic-environments-with-scene","title":"Modeling Dynamic Environments with Scene Graph Memory","date":"2023-05-27","arxiv_id":"2305.17537","repositories_listed":0,"syntology":null},{"url":null,"slug":"gfairhint-improving-individual-fairness-for","title":"GFairHint: Improving Individual Fairness for Graph Neural Networks via Fairness Hint","date":"2023-05-25","arxiv_id":"2305.15622","repositories_listed":0,"syntology":null},{"url":null,"slug":"noddle-node2vec-based-deep-learning-model-for","title":"NODDLE: Node2vec based deep learning model for link prediction","date":"2023-05-25","arxiv_id":"2305.16421","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-meets-llm-a-novel-approach-to","title":"Graph Meets LLM: A Novel Approach to Collaborative Filtering for Robust Conversational Understanding","date":"2023-05-23","arxiv_id":"2305.14449","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-explainable-graph-neural-networks-for","title":"Self-Explainable Graph Neural Networks for Link Prediction","date":"2023-05-21","arxiv_id":"2305.12578","repositories_listed":0,"syntology":null},{"url":null,"slug":"domain-generalization-deep-graph","title":"Domain Generalization Deep Graph Transformation","date":"2023-05-19","arxiv_id":"2305.11389","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-link-prediction-in-social-networks","title":"Improving Link Prediction in Social Networks Using Local and Global Features: A Clustering-based Approach","date":"2023-05-17","arxiv_id":"2305.10257","repositories_listed":0,"syntology":null},{"url":null,"slug":"neustip-a-novel-neuro-symbolic-model-for-link","title":"NeuSTIP: A Novel Neuro-Symbolic Model for Link and Time Prediction in Temporal Knowledge Graphs","date":"2023-05-15","arxiv_id":"2305.11301","repositories_listed":0,"syntology":null},{"url":null,"slug":"few-shot-link-prediction-on-n-ary-facts","title":"Few-shot Link Prediction on N-ary Facts","date":"2023-05-10","arxiv_id":"2305.06104","repositories_listed":0,"syntology":null},{"url":null,"slug":"zoo-guide-to-network-embedding","title":"Zoo Guide to Network Embedding","date":"2023-05-05","arxiv_id":"2305.03474","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhance-enhanced-entity-and-relation","title":"EnhancE：Enhanced Entity and Relation Embedding for Knowledge Hypergraph Link Prediction","date":"2023-04-30","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"generating-post-hoc-explanations-for-skip","title":"Generating Post-hoc Explanations for Skip-gram-based Node Embeddings by Identifying Important Nodes with Bridgeness","date":"2023-04-24","arxiv_id":"2304.12036","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-graph-neural-networks-on-multi-node","title":"Improving Graph Neural Networks on Multi-node Tasks with Labeling Tricks","date":"2023-04-20","arxiv_id":"2304.10074","repositories_listed":0,"syntology":null},{"url":null,"slug":"recurrent-transformer-for-dynamic-graph","title":"Dynamic Graph Representation Learning via Edge Temporal States Modeling and Structure-reinforced Transformer","date":"2023-04-20","arxiv_id":"2304.10079","repositories_listed":0,"syntology":null},{"url":null,"slug":"bridging-the-language-gap-knowledge-injected","title":"Bridging the Language Gap: Knowledge Injected Multilingual Question Answering","date":"2023-04-06","arxiv_id":"2304.03159","repositories_listed":0,"syntology":null},{"url":null,"slug":"fmgnn-fused-manifold-graph-neural-network","title":"FMGNN: Fused Manifold Graph Neural Network","date":"2023-04-03","arxiv_id":"2304.01081","repositories_listed":0,"syntology":null},{"url":null,"slug":"hyconve-a-novel-embedding-model-for-knowledge","title":"HyConvE: A Novel Embedding Model for Knowledge Hypergraph Link Prediction with Convolutional Neural Networks","date":"2023-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-embedding-in-hierarchical-distance-and","title":"Joint embedding in Hierarchical distance and semantic representation learning for link prediction","date":"2023-03-28","arxiv_id":"2303.15655","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-enhanced-graph-neural-networks","title":"Knowledge Enhanced Graph Neural Networks for Graph Completion","date":"2023-03-27","arxiv_id":"2303.15487","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairgat-fairness-aware-graph-attention","title":"FairGAT: Fairness-aware Graph Attention Networks","date":"2023-03-26","arxiv_id":"2303.14591","repositories_listed":0,"syntology":null},{"url":null,"slug":"farspredict-a-benchmark-dataset-for-link","title":"Farspredict: A benchmark dataset for link prediction","date":"2023-03-26","arxiv_id":"2303.14647","repositories_listed":0,"syntology":null},{"url":null,"slug":"structural-imbalance-aware-graph-augmentation","title":"Structural Imbalance Aware Graph Augmentation Learning","date":"2023-03-24","arxiv_id":"2303.13757","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-wide-to-deep-dimension-lifting-network","title":"From Wide to Deep: Dimension Lifting Network for Parameter-efficient Knowledge Graph Embedding","date":"2023-03-22","arxiv_id":"2303.12816","repositories_listed":0,"syntology":null},{"url":null,"slug":"fitting-low-rank-models-on-egocentrically","title":"Fitting Low-rank Models on Egocentrically Sampled Partial Networks","date":"2023-03-09","arxiv_id":"2303.11230","repositories_listed":0,"syntology":null},{"url":null,"slug":"node-specific-space-selection-via-localized","title":"Node-Specific Space Selection via Localized Geometric Hyperbolicity in Graph Neural Networks","date":"2023-03-03","arxiv_id":"2303.01724","repositories_listed":0,"syntology":null},{"url":null,"slug":"asymmetric-learning-for-graph-neural-network","title":"Asymmetric Learning for Graph Neural Network based Link Prediction","date":"2023-03-01","arxiv_id":"2303.00170","repositories_listed":0,"syntology":null},{"url":"/paper/diffusing-graph-attention","slug":"diffusing-graph-attention","title":"Diffusing Graph Attention","date":"2023-03-01","arxiv_id":"2303.00613","repositories_listed":0,"syntology":null},{"url":null,"slug":"argument-mining-using-bert-and-self-attention","title":"Argument Mining using BERT and Self-Attention based Embeddings","date":"2023-02-27","arxiv_id":"2302.13906","repositories_listed":0,"syntology":null},{"url":null,"slug":"do-we-really-need-complicated-model","title":"Do We Really Need Complicated Model Architectures For Temporal Networks?","date":"2023-02-22","arxiv_id":"2302.11636","repositories_listed":0,"syntology":null},{"url":null,"slug":"drop-edges-and-adapt-a-fairness-enforcing","title":"Drop Edges and Adapt: a Fairness Enforcing Fine-tuning for Graph Neural Networks","date":"2023-02-22","arxiv_id":"2302.11479","repositories_listed":0,"syntology":null},{"url":null,"slug":"effects-of-locality-and-rule-language-on","title":"Effects of Locality and Rule Language on Explanations for Knowledge Graph Embeddings","date":"2023-02-14","arxiv_id":"2302.06967","repositories_listed":0,"syntology":null},{"url":null,"slug":"link-prediction-with-attention-applied-on","title":"Link Prediction with Attention Applied on Multiple Knowledge Graph Embedding Models","date":"2023-02-13","arxiv_id":"2302.06229","repositories_listed":0,"syntology":null},{"url":null,"slug":"investigating-the-effect-of-relative","title":"Investigating the Effect of Relative Positional Embeddings on AMR-to-Text Generation with Structural Adapters","date":"2023-02-12","arxiv_id":"2302.05900","repositories_listed":0,"syntology":null},{"url":null,"slug":"meta-learning-based-knowledge-extrapolation-1","title":"Meta-Learning Based Knowledge Extrapolation for Temporal Knowledge Graph","date":"2023-02-11","arxiv_id":"2302.05640","repositories_listed":0,"syntology":null},{"url":null,"slug":"bi-level-multi-objective-evolutionary","title":"Bi-level Multi-objective Evolutionary Learning: A Case Study on Multi-task Graph Neural Topology Search","date":"2023-02-06","arxiv_id":"2302.02565","repositories_listed":0,"syntology":null},{"url":null,"slug":"heterogeneous-federated-knowledge-graph","title":"Heterogeneous Federated Knowledge Graph Embedding Learning and Unlearning","date":"2023-02-04","arxiv_id":"2302.02069","repositories_listed":0,"syntology":null},{"url":null,"slug":"interaction-order-prediction-for-temporal","title":"Interaction Order Prediction for Temporal Graphs","date":"2023-02-04","arxiv_id":"2302.02128","repositories_listed":0,"syntology":null},{"url":null,"slug":"pubgraph-a-large-scale-scientific-temporal","title":"PubGraph: A Large-Scale Scientific Knowledge Graph","date":"2023-02-04","arxiv_id":"2302.02231","repositories_listed":0,"syntology":null},{"url":null,"slug":"structural-explanations-for-graph-neural","title":"Structural Explanations for Graph Neural Networks using HSIC","date":"2023-02-04","arxiv_id":"2302.02139","repositories_listed":0,"syntology":null},{"url":null,"slug":"causal-lifting-and-link-prediction","title":"Causal Lifting and Link Prediction","date":"2023-02-02","arxiv_id":"2302.01198","repositories_listed":0,"syntology":null},{"url":null,"slug":"kg-hub-building-and-exchanging-biological","title":"KG-Hub -- Building and Exchanging Biological Knowledge Graphs","date":"2023-01-31","arxiv_id":"2302.10800","repositories_listed":0,"syntology":null},{"url":"/paper/adapting-neural-link-predictors-for-complex","slug":"adapting-neural-link-predictors-for-complex","title":"Adapting Neural Link Predictors for Data-Efficient Complex Query Answering","date":"2023-01-29","arxiv_id":"2301.12313","repositories_listed":0,"syntology":null},{"url":null,"slug":"dbgdgm-dynamic-brain-graph-deep-generative","title":"DBGDGM: Dynamic Brain Graph Deep Generative Model","date":"2023-01-26","arxiv_id":"2301.11408","repositories_listed":0,"syntology":null},{"url":null,"slug":"is-ggt-iterative-scene-graph-generation-with","title":"IS-GGT: Iterative Scene Graph Generation With Generative Transformers","date":"2023-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"pipad-pipelined-and-parallel-dynamic-gnn","title":"PiPAD: Pipelined and Parallel Dynamic GNN Training on GPUs","date":"2023-01-01","arxiv_id":"2301.00391","repositories_listed":0,"syntology":null},{"url":null,"slug":"ganexplainer-gan-based-graph-neural-networks","title":"GANExplainer: GAN-based Graph Neural Networks Explainer","date":"2022-12-30","arxiv_id":"2301.00012","repositories_listed":0,"syntology":null},{"url":null,"slug":"customizing-knowledge-graph-embedding-to","title":"Customizing Knowledge Graph Embedding to Improve Clinical Study Recommendation","date":"2022-12-28","arxiv_id":"2212.14102","repositories_listed":0,"syntology":null},{"url":null,"slug":"personasage-a-multi-persona-graph-neural","title":"PersonaSAGE: A Multi-Persona Graph Neural Network","date":"2022-12-28","arxiv_id":"2212.13709","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-sequence-networked-submodular","title":"Robust Sequence Networked Submodular Maximization","date":"2022-12-28","arxiv_id":"2212.13725","repositories_listed":0,"syntology":null},{"url":null,"slug":"edog-adversarial-edge-detection-for-graph","title":"EDoG: Adversarial Edge Detection For Graph Neural Networks","date":"2022-12-27","arxiv_id":"2212.13607","repositories_listed":0,"syntology":null},{"url":null,"slug":"refined-edge-usage-of-graph-neural-networks","title":"Refined Edge Usage of Graph Neural Networks for Edge Prediction","date":"2022-12-25","arxiv_id":"2212.12970","repositories_listed":0,"syntology":null},{"url":null,"slug":"piecewise-velocity-model-for-learning","title":"Piecewise-Velocity Model for Learning Continuous-time Dynamic Node Representations","date":"2022-12-23","arxiv_id":"2212.12345","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-learning-with-localized-neighborhood","title":"Graph Learning with Localized Neighborhood Fairness","date":"2022-12-22","arxiv_id":"2212.12040","repositories_listed":0,"syntology":null},{"url":null,"slug":"integrating-heterogeneous-domain-information","title":"Integrating Heterogeneous Domain Information into Relation Extraction: A Case Study on Drug-Drug Interaction Extraction","date":"2022-12-21","arxiv_id":"2212.10714","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-learning-for-anomaly-analytics","title":"Graph Learning for Anomaly Analytics: Algorithms, Applications, and Challenges","date":"2022-12-11","arxiv_id":"2212.05532","repositories_listed":0,"syntology":null},{"url":null,"slug":"scientific-paper-extractive-summarization","title":"Scientific Paper Extractive Summarization Enhanced by Citation Graphs","date":"2022-12-08","arxiv_id":"2212.04214","repositories_listed":0,"syntology":null},{"url":null,"slug":"analysis-of-drug-repurposing-knowledge-graphs","title":"Analysis of Drug repurposing Knowledge graphs for Covid-19","date":"2022-12-07","arxiv_id":"2212.03911","repositories_listed":0,"syntology":null},{"url":null,"slug":"pseudo-riemannian-embedding-models-for-multi","title":"Pseudo-Riemannian Embedding Models for Multi-Relational Graph Representations","date":"2022-12-02","arxiv_id":"2212.03720","repositories_listed":0,"syntology":null},{"url":null,"slug":"iterative-scene-graph-generation-with","title":"Iterative Scene Graph Generation with Generative Transformers","date":"2022-11-30","arxiv_id":"2211.16636","repositories_listed":0,"syntology":null},{"url":null,"slug":"text-representation-enrichment-utilizing","title":"Text Representation Enrichment Utilizing Graph based Approaches: Stock Market Technical Analysis Case Study","date":"2022-11-29","arxiv_id":"2211.16103","repositories_listed":0,"syntology":null},{"url":null,"slug":"relational-symmetry-based-knowledge-graph","title":"Knowledge Graph Contrastive Learning Based on Relation-Symmetrical Structure","date":"2022-11-19","arxiv_id":"2211.10738","repositories_listed":0,"syntology":null},{"url":null,"slug":"few-shot-inductive-learning-on-temporal","title":"Few-Shot Inductive Learning on Temporal Knowledge Graphs using Concept-Aware Information","date":"2022-11-15","arxiv_id":"2211.08169","repositories_listed":0,"syntology":null},{"url":null,"slug":"holder-recommendations-using-graph","title":"Holder Recommendations using Graph Representation Learning & Link Prediction","date":"2022-11-10","arxiv_id":"2212.09624","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-graph-embedding-a-survey-from-the","title":"Knowledge Graph Embedding: A Survey from the Perspective of Representation Spaces","date":"2022-11-07","arxiv_id":"2211.03536","repositories_listed":0,"syntology":null},{"url":null,"slug":"linkformer-automatic-contextualised-link","title":"An Empirical Study on Data Leakage and Generalizability of Link Prediction Models for Issues and Commits","date":"2022-11-01","arxiv_id":"2211.00381","repositories_listed":0,"syntology":null},{"url":null,"slug":"bi-link-bridging-inductive-link-predictions","title":"Bi-Link: Bridging Inductive Link Predictions from Text via Contrastive Learning of Transformers and Prompts","date":"2022-10-26","arxiv_id":"2210.14463","repositories_listed":0,"syntology":null},{"url":null,"slug":"laundrograph-self-supervised-graph","title":"LaundroGraph: Self-Supervised Graph Representation Learning for Anti-Money Laundering","date":"2022-10-25","arxiv_id":"2210.14360","repositories_listed":0,"syntology":null}],"record_sha256":"3884f57a37bbbf6f060243f6df45103550598eeca0b229e5c537e7688da30995","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}