{"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/graph-embedding/papers/6","list_of":"/task/graph-embedding","task":"Graph Embedding","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":6,"pages_in_order":12,"rows_per_page":100,"rows":[501,600],"of":1192,"counts":{"archive_papers_tagged":1192,"with_a_code_link":533,"where_syntology_ran_a_sample":92,"not_listed_spam_title":0,"listed":1192,"listed_where_code_ran":92,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":83,"every_run_a_failure_of_syntologys_instrument":9,"listed_with_a_run_with_no_instrument_failure":83,"listed_every_run_a_failure_of_syntologys_instrument":9,"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/graph-embedding","prev":"/task/graph-embedding/papers/5","next":"/task/graph-embedding/papers/7","papers":[{"url":"/paper/learning-combinatorial-embedding-networks-for","slug":"learning-combinatorial-embedding-networks-for","title":"Learning Combinatorial Embedding Networks for Deep Graph Matching","date":"2019-04-01","arxiv_id":"1904.00597","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-inductive-whole-graph-embedding","slug":"unsupervised-inductive-whole-graph-embedding","title":"Unsupervised Inductive Graph-Level Representation Learning via Graph-Graph Proximity","date":"2019-04-01","arxiv_id":"1904.01098","repositories_listed":1,"syntology":null},{"url":"/paper/pytorch-biggraph-a-large-scale-graph","slug":"pytorch-biggraph-a-large-scale-graph","title":"PyTorch-BigGraph: A Large-scale Graph Embedding System","date":"2019-03-28","arxiv_id":"1903.12287","repositories_listed":1,"syntology":null},{"url":"/paper/analyzing-knowledge-graph-embedding-methods","slug":"analyzing-knowledge-graph-embedding-methods","title":"Analyzing Knowledge Graph Embedding Methods from a Multi-Embedding Interaction Perspective","date":"2019-03-27","arxiv_id":"1903.11406","repositories_listed":1,"syntology":null},{"url":"/paper/splitter-learning-node-representations-that","slug":"splitter-learning-node-representations-that","title":"Splitter: Learning Node Representations that Capture Multiple Social Contexts","date":"2019-03-18","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/multi-stage-self-supervised-learning-for","slug":"multi-stage-self-supervised-learning-for","title":"Multi-Stage Self-Supervised Learning for Graph Convolutional Networks on Graphs with Few Labels","date":"2019-02-28","arxiv_id":"1902.11038","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multi-stage-self-supervised-learning-for#ran","syntology_url":"https://syntology.ai/paper/1902.11038","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.11038"}},"official":null}},{"url":"/paper/el-embeddings-geometric-construction-of","slug":"el-embeddings-geometric-construction-of","title":"EL Embeddings: Geometric construction of models for the Description Logic EL ++","date":"2019-02-27","arxiv_id":"1902.10499","repositories_listed":1,"syntology":null},{"url":"/paper/representation-learning-with-weighted-inner","slug":"representation-learning-with-weighted-inner","title":"Representation Learning with Weighted Inner Product for Universal Approximation of General Similarities","date":"2019-02-27","arxiv_id":"1902.10409","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-fact-prediction-via-knowledge","slug":"knowledge-graph-fact-prediction-via-knowledge","title":"Knowledge Graph Fact Prediction via Knowledge-Enriched Tensor Factorization","date":"2019-02-08","arxiv_id":"1902.03077","repositories_listed":1,"syntology":null},{"url":"/paper/all-graphs-lead-to-rome-learning-geometric","slug":"all-graphs-lead-to-rome-learning-geometric","title":"All Graphs Lead to Rome: Learning Geometric and Cycle-Consistent Representations with Graph Convolutional Networks","date":"2019-01-07","arxiv_id":"1901.02078","repositories_listed":1,"syntology":null},{"url":"/paper/classifying-collisions-with-spatio-temporal","slug":"classifying-collisions-with-spatio-temporal","title":"Spatio-Temporal Action Graph Networks","date":"2018-12-04","arxiv_id":"1812.01233","repositories_listed":1,"syntology":null},{"url":"/paper/dynamicgem-a-library-for-dynamic-graph","slug":"dynamicgem-a-library-for-dynamic-graph","title":"DynamicGEM: A Library for Dynamic Graph Embedding Methods","date":"2018-11-26","arxiv_id":"1811.10734","repositories_listed":1,"syntology":null},{"url":"/paper/multi-layered-graph-embedding-with-graph","slug":"multi-layered-graph-embedding-with-graph","title":"MGCN: Semi-supervised Classification in Multi-layer Graphs with Graph Convolutional Networks","date":"2018-11-21","arxiv_id":"1811.08800","repositories_listed":1,"syntology":null},{"url":"/paper/differentiating-concepts-and-instances-for","slug":"differentiating-concepts-and-instances-for","title":"Differentiating Concepts and Instances for Knowledge Graph Embedding","date":"2018-11-12","arxiv_id":"1811.04588","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/differentiating-concepts-and-instances-for#ran","syntology_url":"https://syntology.ai/paper/1811.04588","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.04588"}},"official":{"repos":["davidlvxin/TransC"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/end-to-end-structure-aware-convolutional","slug":"end-to-end-structure-aware-convolutional","title":"End-to-end Structure-Aware Convolutional Networks for Knowledge Base Completion","date":"2018-11-11","arxiv_id":"1811.04441","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 3 unverified","sample_list":"/paper/end-to-end-structure-aware-convolutional#ran","syntology_url":"https://syntology.ai/paper/1811.04441","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.04441"}},"official":{"repos":["JD-AI-Research-Silicon-Valley/SACN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/multi-task-graph-autoencoders","slug":"multi-task-graph-autoencoders","title":"Multi-Task Graph Autoencoders","date":"2018-11-07","arxiv_id":"1811.02798","repositories_listed":1,"syntology":{"n":9,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":6,"n_honours":1,"n_violates":1,"n_no_contract":1,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 1 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/multi-task-graph-autoencoders#ran","syntology_url":"https://syntology.ai/paper/1811.02798","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.02798"}},"official":{"repos":["vuptran/graph-representation-learning"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/logic-attention-based-neighborhood","slug":"logic-attention-based-neighborhood","title":"Logic Attention Based Neighborhood Aggregation for Inductive Knowledge Graph Embedding","date":"2018-11-04","arxiv_id":"1811.01399","repositories_listed":1,"syntology":null},{"url":"/paper/atp-directed-graph-embedding-with-asymmetric","slug":"atp-directed-graph-embedding-with-asymmetric","title":"ATP: Directed Graph Embedding with Asymmetric Transitivity Preservation","date":"2018-11-02","arxiv_id":"1811.00839","repositories_listed":1,"syntology":null},{"url":"/paper/hyte-hyperplane-based-temporally-aware","slug":"hyte-hyperplane-based-temporally-aware","title":"HyTE: Hyperplane-based Temporally aware Knowledge Graph Embedding","date":"2018-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-stochastic-graphlet-embedding","slug":"hierarchical-stochastic-graphlet-embedding","title":"Hierarchical stochastic graphlet embedding for graph-based pattern recognition","date":"2018-07-08","arxiv_id":"1807.02839","repositories_listed":1,"syntology":null},{"url":"/paper/improving-knowledge-graph-embedding-using","slug":"improving-knowledge-graph-embedding-using","title":"Improving Knowledge Graph Embedding Using Simple Constraints","date":"2018-05-07","arxiv_id":"1805.02408","repositories_listed":1,"syntology":null},{"url":"/paper/expeditious-generation-of-knowledge-graph","slug":"expeditious-generation-of-knowledge-graph","title":"Expeditious Generation of Knowledge Graph Embeddings","date":"2018-03-21","arxiv_id":"1803.07828","repositories_listed":1,"syntology":null},{"url":"/paper/mile-a-multi-level-framework-for-scalable","slug":"mile-a-multi-level-framework-for-scalable","title":"MILE: A Multi-Level Framework for Scalable Graph Embedding","date":"2018-02-26","arxiv_id":"1802.09612","repositories_listed":1,"syntology":null},{"url":"/paper/graphvae-towards-generation-of-small-graphs","slug":"graphvae-towards-generation-of-small-graphs","title":"GraphVAE: Towards Generation of Small Graphs Using Variational Autoencoders","date":"2018-02-09","arxiv_id":"1802.03480","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-embedding-with-iterative","slug":"knowledge-graph-embedding-with-iterative","title":"Knowledge Graph Embedding with Iterative Guidance from Soft Rules","date":"2017-11-30","arxiv_id":"1711.11231","repositories_listed":1,"syntology":null},{"url":"/paper/premise-selection-for-theorem-proving-by-deep","slug":"premise-selection-for-theorem-proving-by-deep","title":"Premise Selection for Theorem Proving by Deep Graph Embedding","date":"2017-09-28","arxiv_id":"1709.09994","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/premise-selection-for-theorem-proving-by-deep#ran","syntology_url":"https://syntology.ai/paper/1709.09994","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1709.09994"}},"official":{"repos":["princeton-vl/FormulaNet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-network-based-graph-embedding-for","slug":"neural-network-based-graph-embedding-for","title":"Neural Network-based Graph Embedding for Cross-Platform Binary Code Similarity Detection","date":"2017-08-22","arxiv_id":"1708.06525","repositories_listed":1,"syntology":null},{"url":"/paper/active-learning-for-graph-embedding","slug":"active-learning-for-graph-embedding","title":"Active Learning for Graph Embedding","date":"2017-05-15","arxiv_id":"1705.05085","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-parallel-translating-embedding-for","slug":"efficient-parallel-translating-embedding-for","title":"Efficient Parallel Translating Embedding For Knowledge Graphs","date":"2017-03-30","arxiv_id":"1703.10316","repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-multi-label-feature-selection","slug":"semi-supervised-multi-label-feature-selection","title":"Semi-supervised multi-label feature selection via label correlation analysis with l1-norm graph embedding","date":"2017-03-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-embedding-via-dynamic-mapping","slug":"knowledge-graph-embedding-via-dynamic-mapping","title":"Knowledge Graph Embedding via Dynamic Mapping Matrix","date":"2015-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-embedding-by-translating-on","slug":"knowledge-graph-embedding-by-translating-on","title":"Knowledge Graph Embedding by Translating on Hyperplanes","date":"2014-07-27","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/spectral-clustering-for-divide-and-conquer","slug":"spectral-clustering-for-divide-and-conquer","title":"Spectral Clustering for Divide-and-Conquer Graph Matching","date":"2013-10-04","arxiv_id":"1310.1297","repositories_listed":1,"syntology":null},{"url":null,"slug":"smart-relation-aware-learning-of-geometric","title":"SMART: Relation-Aware Learning of Geometric Representations for Knowledge Graphs","date":"2025-07-17","arxiv_id":"2507.13001","repositories_listed":0,"syntology":null},{"url":null,"slug":"metapath-based-hyperbolic-contrastive","title":"Metapath-based Hyperbolic Contrastive Learning for Heterogeneous Graph Embedding","date":"2025-06-20","arxiv_id":"2506.16754","repositories_listed":0,"syntology":null},{"url":null,"slug":"predicate-conditional-conformalized-answer","title":"Predicate-Conditional Conformalized Answer Sets for Knowledge Graph Embeddings","date":"2025-05-22","arxiv_id":"2505.16877","repositories_listed":0,"syntology":null},{"url":null,"slug":"lightweight-spatio-temporal-attention-network","title":"Lightweight Spatio-Temporal Attention Network with Graph Embedding and Rotational Position Encoding for Traffic Forecasting","date":"2025-05-17","arxiv_id":"2505.12136","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-knowledge-graph-embedding-via","title":"Robust Knowledge Graph Embedding via Denoising","date":"2025-05-14","arxiv_id":"2505.18171","repositories_listed":0,"syntology":null},{"url":null,"slug":"injecting-knowledge-graphs-into-large","title":"Injecting Knowledge Graphs into Large Language Models","date":"2025-05-12","arxiv_id":"2505.07554","repositories_listed":0,"syntology":null},{"url":null,"slug":"electricity-cost-minimization-for-multi","title":"Electricity Cost Minimization for Multi-Workflow Allocation in Geo-Distributed Data Centers","date":"2025-04-27","arxiv_id":"2504.20105","repositories_listed":0,"syntology":null},{"url":null,"slug":"quate-d-a-distance-based-quaternion-model-for","title":"QuatE-D: A Distance-Based Quaternion Model for Knowledge Graph Embedding","date":"2025-04-18","arxiv_id":"2504.13983","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-large-scale-evaluation-of-embedding-models","title":"On Large-scale Evaluation of Embedding Models for Knowledge Graph Completion","date":"2025-04-11","arxiv_id":"2504.08970","repositories_listed":0,"syntology":null},{"url":null,"slug":"scmppi-supervised-contrastive-multimodal","title":"SCMPPI: Supervised Contrastive Multimodal Framework for Predicting Protein-Protein Interactions","date":"2025-04-03","arxiv_id":"2504.02698","repositories_listed":0,"syntology":null},{"url":null,"slug":"embedding-method-for-knowledge-graph-with","title":"Embedding Method for Knowledge Graph with Densely Defined Ontology","date":"2025-04-02","arxiv_id":"2504.02889","repositories_listed":0,"syntology":null},{"url":null,"slug":"diffmove-group-mobility-tendency-enhanced","title":"DiffMove: Group Mobility Tendency Enhanced Trajectory Recovery via Diffusion Model","date":"2025-03-24","arxiv_id":"2503.18302","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-feasible-is-augmenting-fake-nodes-with","title":"How Feasible is Augmenting Fake Nodes with Learnable Features as a Counter-strategy against Link Stealing Attacks?","date":"2025-03-12","arxiv_id":"2503.09726","repositories_listed":0,"syntology":null},{"url":null,"slug":"sotckge-continual-knowledge-graph-embedding","title":"SoTCKGE:Continual Knowledge Graph Embedding Based on Spatial Offset Transformation","date":"2025-03-11","arxiv_id":"2503.08189","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-zero-shot-learning-method-based-on-large","title":"A Zero-shot Learning Method Based on Large Language Models for Multi-modal Knowledge Graph Embedding","date":"2025-03-10","arxiv_id":"2503.07202","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-cut-informed-graph-embedding-and","title":"Deep Cut-informed Graph Embedding and Clustering","date":"2025-03-09","arxiv_id":"2503.06635","repositories_listed":0,"syntology":null},{"url":null,"slug":"fhge-a-fast-heterogeneous-graph-embedding","title":"FHGE: A Fast Heterogeneous Graph Embedding with Ad-hoc Meta-paths","date":"2025-02-22","arxiv_id":"2502.16281","repositories_listed":0,"syntology":null},{"url":null,"slug":"recent-advances-in-malware-detection-graph","title":"Recent Advances in Malware Detection: Graph Learning and Explainability","date":"2025-02-14","arxiv_id":"2502.10556","repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-journey-how-transformers-predict-the","title":"Spectral Journey: How Transformers Predict the Shortest Path","date":"2025-02-12","arxiv_id":"2502.08794","repositories_listed":0,"syntology":null},{"url":null,"slug":"transformer-based-multimodal-knowledge-graph","title":"Transformer-Based Multimodal Knowledge Graph Completion with Link-Aware Contexts","date":"2025-01-26","arxiv_id":"2501.15688","repositories_listed":0,"syntology":null},{"url":null,"slug":"integrate-temporal-graph-learning-into-llm","title":"Integrate Temporal Graph Learning into LLM-based Temporal Knowledge Graph Model","date":"2025-01-21","arxiv_id":"2501.11911","repositories_listed":0,"syntology":null},{"url":null,"slug":"reducing-the-sensitivity-of-neural-physics","title":"Reducing the Sensitivity of Neural Physics Simulators to Mesh Topology via Pretraining","date":"2025-01-16","arxiv_id":"2501.09597","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-language-models-for-knowledge-graph","title":"Large Language Models for Knowledge Graph Embedding Techniques, Methods, and Challenges: A Survey","date":"2025-01-14","arxiv_id":"2501.07766","repositories_listed":0,"syntology":null},{"url":null,"slug":"safepowergraph-llm-novel-power-grid-graph","title":"SafePowerGraph-LLM: Novel Power Grid Graph Embedding and Optimization with Large Language Models","date":"2025-01-13","arxiv_id":"2501.07639","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-homophily-clustering-a-structure","title":"Adaptive Homophily Clustering: Structure Homophily Graph Learning with Adaptive Filter for Hyperspectral Image","date":"2025-01-03","arxiv_id":"2501.01595","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-relational-context-perception-for","title":"Efficient Relational Context Perception for Knowledge Graph Completion","date":"2024-12-31","arxiv_id":"2501.00397","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-graph-mamba-a-comprehensive-survey","title":"Exploring Graph Mamba: A Comprehensive Survey on State-Space Models for Graph Learning","date":"2024-12-24","arxiv_id":"2412.18322","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-comparative-study-on-dynamic-graph","title":"A Comparative Study on Dynamic Graph Embedding based on Mamba and Transformers","date":"2024-12-15","arxiv_id":"2412.11293","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-knowledge-graph-structure-and","title":"A Survey on Knowledge Graph Structure and Knowledge Graph Embeddings","date":"2024-12-13","arxiv_id":"2412.10092","repositories_listed":0,"syntology":null},{"url":null,"slug":"predictive-query-based-pipeline-for-graph","title":"Predictive Query-based Pipeline for Graph Data","date":"2024-12-13","arxiv_id":"2412.09940","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-communities-to-interpretable-network-and","title":"From communities to interpretable network and word embedding: an unified approach","date":"2024-12-11","arxiv_id":"2412.08187","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-progressive-influence-maximization-in","title":"Non-Progressive Influence Maximization in Dynamic Social Networks","date":"2024-12-10","arxiv_id":"2412.07402","repositories_listed":0,"syntology":null},{"url":null,"slug":"prediction-of-occluded-pedestrians-in-road","title":"Prediction of Occluded Pedestrians in Road Scenes using Human-like Reasoning: Insights from the OccluRoads Dataset","date":"2024-12-09","arxiv_id":"2412.06549","repositories_listed":0,"syntology":null},{"url":null,"slug":"learn-to-unlearn-meta-learning-based","title":"Learn to Unlearn: Meta-Learning-Based Knowledge Graph Embedding Unlearning","date":"2024-12-01","arxiv_id":"2412.00881","repositories_listed":0,"syntology":null},{"url":null,"slug":"local-intrinsic-dimensionality-for-dynamic","title":"Local Intrinsic Dimensionality for Dynamic Graph Embeddings","date":"2024-11-25","arxiv_id":"2411.16145","repositories_listed":0,"syntology":null},{"url":null,"slug":"domain-and-range-aware-synthetic-negatives","title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","date":"2024-11-22","arxiv_id":"2411.14858","repositories_listed":0,"syntology":null},{"url":null,"slug":"visualization-of-knowledge-graphs-with","title":"Visualization of Knowledge Graphs with Embeddings: an Essay on Recent Trends and Methods","date":"2024-11-21","arxiv_id":"2412.05289","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-deep-metric-learning-on-attributed","title":"Scalable Deep Metric Learning on Attributed Graphs","date":"2024-11-20","arxiv_id":"2411.13014","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-hyperbolic-space-based-heterogeneous","title":"Multi-Hyperbolic Space-based Heterogeneous Graph Attention Network","date":"2024-11-18","arxiv_id":"2411.11283","repositories_listed":0,"syntology":null},{"url":null,"slug":"class-granularity-how-richly-does-your","title":"Class Granularity: How richly does your knowledge graph represent the real world?","date":"2024-11-10","arxiv_id":"2411.06385","repositories_listed":0,"syntology":null},{"url":null,"slug":"fully-hyperbolic-rotation-for-knowledge-graph","title":"Fully Hyperbolic Rotation for Knowledge Graph Embedding","date":"2024-11-06","arxiv_id":"2411.03622","repositories_listed":0,"syntology":null},{"url":null,"slug":"jpec-a-novel-graph-neural-network-for","title":"JPEC: A Novel Graph Neural Network for Competitor Retrieval in Financial Knowledge Graphs","date":"2024-11-05","arxiv_id":"2411.02692","repositories_listed":0,"syntology":null},{"url":null,"slug":"detecting-text-level-intellectual-influence","title":"Detecting text level intellectual influence with knowledge graph embeddings","date":"2024-10-31","arxiv_id":"2410.24021","repositories_listed":0,"syntology":null},{"url":null,"slug":"logshield-a-graph-based-real-time-anomaly","title":"LogSHIELD: A Graph-based Real-time Anomaly Detection Framework using Frequency Analysis","date":"2024-10-29","arxiv_id":"2410.21936","repositories_listed":0,"syntology":null},{"url":null,"slug":"pushing-the-limits-of-all-atom-geometric","title":"Pushing the Limits of All-Atom Geometric Graph Neural Networks: Pre-Training, Scaling and Zero-Shot Transfer","date":"2024-10-29","arxiv_id":"2410.21683","repositories_listed":0,"syntology":null},{"url":null,"slug":"resilience-in-knowledge-graph-embeddings","title":"Resilience in Knowledge Graph Embeddings","date":"2024-10-28","arxiv_id":"2410.21163","repositories_listed":0,"syntology":null},{"url":null,"slug":"geometric-feature-enhanced-knowledge-graph","title":"Geometric Feature Enhanced Knowledge Graph Embedding and Spatial Reasoning","date":"2024-10-24","arxiv_id":"2410.18345","repositories_listed":0,"syntology":null},{"url":null,"slug":"multidimensional-knowledge-graph-embeddings","title":"Multidimensional Knowledge Graph Embeddings for International Trade Flow Analysis","date":"2024-10-19","arxiv_id":"2410.19835","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-graph-embeddings-a-comprehensive","title":"Knowledge Graph Embeddings: A Comprehensive Survey on Capturing Relation Properties","date":"2024-10-16","arxiv_id":"2410.14733","repositories_listed":0,"syntology":null},{"url":null,"slug":"trajectory-prediction-for-autonomous-driving-2","title":"Trajectory Prediction for Autonomous Driving using Agent-Interaction Graph Embedding","date":"2024-10-15","arxiv_id":"2410.23298","repositories_listed":0,"syntology":null},{"url":null,"slug":"spegcl-self-supervised-graph-spectrum","title":"SpeGCL: Self-supervised Graph Spectrum Contrastive Learning without Positive Samples","date":"2024-10-14","arxiv_id":"2410.10365","repositories_listed":0,"syntology":null},{"url":null,"slug":"diversified-and-adaptive-negative-sampling-on","title":"Diversified and Adaptive Negative Sampling on Knowledge Graphs","date":"2024-10-10","arxiv_id":"2410.07592","repositories_listed":0,"syntology":null},{"url":null,"slug":"inference-over-unseen-entities-relations-and","title":"Inference over Unseen Entities, Relations and Literals on Knowledge Graphs","date":"2024-10-09","arxiv_id":"2410.06742","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-pluggable-common-sense-enhanced-framework","title":"A Pluggable Common Sense-Enhanced Framework for Knowledge Graph Completion","date":"2024-10-06","arxiv_id":"2410.04488","repositories_listed":0,"syntology":null},{"url":null,"slug":"risksea-a-scalable-graph-embedding-for","title":"RiskSEA : A Scalable Graph Embedding for Detecting On-chain Fraudulent Activities on the Ethereum Blockchain","date":"2024-10-03","arxiv_id":"2410.02160","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimizing-the-induced-correlation-in-omnibus","title":"Optimizing the Induced Correlation in Omnibus Joint Graph Embeddings","date":"2024-09-26","arxiv_id":"2409.17544","repositories_listed":0,"syntology":null},{"url":null,"slug":"gb-rvfl-fusion-of-randomized-neural-network","title":"GB-RVFL: Fusion of Randomized Neural Network and Granular Ball Computing","date":"2024-09-25","arxiv_id":"2409.16735","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-supervised-graph-embedding-clustering","title":"Self-Supervised Graph Embedding Clustering","date":"2024-09-24","arxiv_id":"2409.15887","repositories_listed":0,"syntology":null},{"url":null,"slug":"embedding-knowledge-graph-in-function-spaces","title":"Embedding Knowledge Graph in Function Spaces","date":"2024-09-23","arxiv_id":"2409.14857","repositories_listed":0,"syntology":null},{"url":null,"slug":"grvfl-2v-graph-random-vector-functional-link","title":"GRVFL-MV: Graph Random Vector Functional Link Based on Multi-View Learning","date":"2024-09-07","arxiv_id":"2409.04743","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-signed-graph-embedding-methods","title":"A Survey on Signed Graph Embedding: Methods and Applications","date":"2024-09-05","arxiv_id":"2409.03916","repositories_listed":0,"syntology":null},{"url":null,"slug":"cl4kge-a-curriculum-learning-method-for","title":"CL4KGE: A Curriculum Learning Method for Knowledge Graph Embedding","date":"2024-08-27","arxiv_id":"2408.14840","repositories_listed":0,"syntology":null},{"url":null,"slug":"conformalized-answer-set-prediction-for","title":"Conformalized Answer Set Prediction for Knowledge Graph Embedding","date":"2024-08-15","arxiv_id":"2408.08248","repositories_listed":0,"syntology":null},{"url":null,"slug":"predictive-multiplicity-of-knowledge-graph","title":"Predictive Multiplicity of Knowledge Graph Embeddings in Link Prediction","date":"2024-08-15","arxiv_id":"2408.08226","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-dimensional-federated-knowledge-graph","title":"Low-Dimensional Federated Knowledge Graph Embedding via Knowledge Distillation","date":"2024-08-11","arxiv_id":"2408.05748","repositories_listed":0,"syntology":null},{"url":null,"slug":"2407-21609","title":"Ironing the Graphs: Toward a Correct Geometric Analysis of Large-Scale Graphs","date":"2024-07-31","arxiv_id":"2407.21609","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-expressive-power-of-knowledge-graph","title":"On The Expressive Power of Knowledge Graph Embedding Methods","date":"2024-07-23","arxiv_id":"2407.16326","repositories_listed":0,"syntology":null}],"record_sha256":"76dc98f2cf5d6e3b5e8edf4fee6e5759d491094e52dccdd30b3ec3d18ccd60e7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}