{"url":"/task/graph-embedding","name":"Graph Embedding","slug":"graph-embedding","description_markdown":"Graph embeddings learn a mapping from a network to a vector space, while preserving relevant network properties.\r\n\r\n<span style=\"color:grey; opacity: 0.6\">( Image credit: [GAT](https://github.com/PetarV-/GAT) )</span>","categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":1192,"papers_with_code":533,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":12,"subtasks":5,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/graph-embedding-on-barabasi-albert","slug":"graph-embedding-on-barabasi-albert","dataset":"Barabasi-Albert","dataset_url":null,"rows_in_archive":1,"metrics":["Entropy Difference"],"first_row_in_archive_order":{"model":"DeepGG","paper_title":"DeepGG: a Deep Graph Generator","paper_url":"/paper/deep-graph-generators","paper_date":"2020-06-07","arxiv_id":"2006.04159","code_links":[{"title":"innvariant/deepgg","url":"https://github.com/innvariant/deepgg"}],"syntology":null}}],"datasets":[{"url":"/dataset/biogrid","name":"BioGRID","full_name":"Biological General Repository for Interaction Datasets","num_papers_in_archive":34},{"url":"/dataset/lastfm-asia","name":"LastFM Asia","full_name":"","num_papers_in_archive":21},{"url":"/dataset/card-660","name":"CARD-660","full_name":"","num_papers_in_archive":10},{"url":"/dataset/era","name":"ERA","full_name":"Event Recognition in Aerial videos","num_papers_in_archive":8},{"url":"/dataset/kg20c","name":"KG20C","full_name":"A scholarly knowledge graph benchmark dataset","num_papers_in_archive":5},{"url":"/dataset/is-a","name":"IS-A","full_name":null,"num_papers_in_archive":4},{"url":"/dataset/olpbench","name":"OLPBENCH","full_name":"OLPBENCH","num_papers_in_archive":4},{"url":"/dataset/chembl-v-27","name":"ChEMBL","full_name":"","num_papers_in_archive":2},{"url":"/dataset/herigraph","name":"HeriGraph","full_name":"Multimodal Machine Learning Datasets on Graphs of Heritage Values and Attributes","num_papers_in_archive":2},{"url":"/dataset/aids-antiviral-screen","name":"AIDS Antiviral Screen","full_name":"AIDS Antiviral Screen","num_papers_in_archive":1},{"url":"/dataset/financial-dynamic-knowledge-graph","name":"Financial Dynamic Knowledge Graph","full_name":"","num_papers_in_archive":1},{"url":"/dataset/synthetic-dynamic-networks","name":"Synthetic Dynamic Networks","full_name":"from Aging, Fitness Preferential Attachment mechanisms","num_papers_in_archive":1}],"subtasks":[{"url":"/task/dynamic-graph-embedding","name":"Dynamic graph embedding"},{"url":"/task/knowledge-graph-embedding","name":"Knowledge Graph Embedding"},{"url":"/task/knowledge-graph-embeddings","name":"Knowledge Graph Embeddings"},{"url":"/task/role-embedding","name":"Role Embedding"},{"url":"/task/structural-node-embedding","name":"Structural Node Embedding"}],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":30,"of":533,"tagged_in_all":1192,"items":[{"url":"/paper/graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","arxiv_id":"1710.10903","repositories_listed":93,"syntology":{"n":106,"n_ran":50,"n_unverified":56,"n_pointer_only":43}},{"url":"/paper/inductive-relation-prediction-on-knowledge","title":"Inductive Relation Prediction by Subgraph Reasoning","date":"2019-11-16","arxiv_id":"1911.06962","repositories_listed":10,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}},{"url":"/paper/rotate-knowledge-graph-embedding-by","title":"RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space","date":"2019-02-26","arxiv_id":"1902.10197","repositories_listed":10,"syntology":{"n":5,"n_ran":0,"n_unverified":5,"n_pointer_only":0}},{"url":"/paper/learning-hierarchy-aware-knowledge-graph","title":"Learning Hierarchy-Aware Knowledge Graph Embeddings for Link Prediction","date":"2019-11-21","arxiv_id":"1911.09419","repositories_listed":9,"syntology":{"n":8,"n_ran":2,"n_unverified":6,"n_pointer_only":1}},{"url":"/paper/poincare-embeddings-for-learning-hierarchical","title":"Poincaré Embeddings for Learning Hierarchical Representations","date":"2017-05-22","arxiv_id":"1705.08039","repositories_listed":9,"syntology":{"n":14,"n_ran":6,"n_unverified":8,"n_pointer_only":6}},{"url":"/paper/line-large-scale-information-network","title":"LINE: Large-scale Information Network Embedding","date":"2015-03-12","arxiv_id":"1503.03578","repositories_listed":9,"syntology":{"n":3,"n_ran":0,"n_unverified":3,"n_pointer_only":0}},{"url":"/paper/graphsaint-graph-sampling-based-inductive","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","date":"2019-07-10","arxiv_id":"1907.04931","repositories_listed":8,"syntology":null},{"url":"/paper/learning-combinatorial-optimization","title":"Learning Combinatorial Optimization Algorithms over Graphs","date":"2017-04-05","arxiv_id":"1704.01665","repositories_listed":8,"syntology":{"n":2,"n_ran":2,"n_unverified":0,"n_pointer_only":2}},{"url":"/paper/nscaching-simple-and-efficient-negative","title":"NSCaching: Simple and Efficient Negative Sampling for Knowledge Graph Embedding","date":"2018-12-16","arxiv_id":"1812.06410","repositories_listed":6,"syntology":null},{"url":"/paper/graph2vec-learning-distributed","title":"graph2vec: Learning Distributed Representations of Graphs","date":"2017-07-17","arxiv_id":"1707.05005","repositories_listed":6,"syntology":{"n":2,"n_ran":2,"n_unverified":0,"n_pointer_only":2}},{"url":"/paper/spherical-and-hyperbolic-toric-topology-based","title":"Spherical and Hyperbolic Toric Topology-Based Codes On Graph Embedding for Ising MRF Models: Classical and Quantum Topology Machine Learning","date":"2023-07-28","arxiv_id":"2307.15778","repositories_listed":5,"syntology":null},{"url":"/paper/inductive-representation-learning-on-temporal-1","title":"Inductive Representation Learning on Temporal Graphs","date":"2020-02-19","arxiv_id":"2002.07962","repositories_listed":5,"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":1}},{"url":"/paper/struc2vec-learning-node-representations-from","title":"struc2vec: Learning Node Representations from Structural Identity","date":"2017-04-11","arxiv_id":"1704.03165","repositories_listed":5,"syntology":{"n":3,"n_ran":3,"n_unverified":0,"n_pointer_only":0}},{"url":"/paper/multi-paradigm-analysis-of-thai-capital","title":"Multi-Paradigm Analysis of Thai Capital Market Linkages: Bivariate/Vine Copulas, Granger Causality, Network Centrality, and Graph Neural Network/Graph Embedding Approaches","date":"2023-02-23","arxiv_id":null,"repositories_listed":4,"syntology":null},{"url":"/paper/meim-multi-partition-embedding-interaction","title":"MEIM: Multi-partition Embedding Interaction Beyond Block Term Format for Efficient and Expressive Link Prediction","date":"2022-09-30","arxiv_id":"2209.15597","repositories_listed":4,"syntology":{"n":7,"n_ran":6,"n_unverified":1,"n_pointer_only":7}},{"url":"/paper/multi-relational-embedding-for-knowledge","title":"Multi-Relational Embedding for Knowledge Graph Representation and Analysis","date":"2020-09-28","arxiv_id":null,"repositories_listed":4,"syntology":null},{"url":"/paper/fast-sequence-based-embedding-with-diffusion-1","title":"Fast Sequence-Based Embedding with Diffusion Graphs","date":"2020-01-21","arxiv_id":"2001.07463","repositories_listed":4,"syntology":null},{"url":"/paper/neural-recurrent-structure-search-for","title":"Interstellar: Searching Recurrent Architecture for Knowledge Graph Embedding","date":"2019-11-17","arxiv_id":"1911.07132","repositories_listed":4,"syntology":null},{"url":"/paper/composition-based-multi-relational-graph","title":"Composition-based Multi-Relational Graph Convolutional Networks","date":"2019-11-08","arxiv_id":"1911.03082","repositories_listed":4,"syntology":{"n":6,"n_ran":2,"n_unverified":4,"n_pointer_only":3}},{"url":"/paper/knowledge-graph-embedding-for","title":"Knowledge Graph Embedding for Ecotoxicological Effect Prediction","date":"2019-07-02","arxiv_id":"1907.01328","repositories_listed":4,"syntology":null},{"url":"/paper/graph-embedding-on-biomedical-networks","title":"Graph Embedding on Biomedical Networks: Methods, Applications, and Evaluations","date":"2019-06-12","arxiv_id":"1906.05017","repositories_listed":4,"syntology":{"n":11,"n_ran":4,"n_unverified":7,"n_pointer_only":0}},{"url":"/paper/190501669","title":"Representation Learning for Attributed Multiplex Heterogeneous Network","date":"2019-05-05","arxiv_id":"1905.01669","repositories_listed":4,"syntology":{"n":6,"n_ran":0,"n_unverified":6,"n_pointer_only":1}},{"url":"/paper/adversarially-regularized-graph-autoencoder","title":"Adversarially Regularized Graph Autoencoder for Graph Embedding","date":"2018-02-13","arxiv_id":"1802.04407","repositories_listed":4,"syntology":null},{"url":"/paper/laplacian-canonization-a-minimalist-approach-1","title":"Laplacian Canonization: A Minimalist Approach to Sign and Basis Invariant Spectral Embedding","date":"2023-10-28","arxiv_id":"2310.18716","repositories_listed":3,"syntology":{"n":12,"n_ran":11,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/graph-encoder-embedding","title":"One-Hot Graph Encoder Embedding","date":"2021-09-27","arxiv_id":"2109.13098","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_unverified":0,"n_pointer_only":2}},{"url":"/paper/autosf-towards-automatic-scoring-function","title":"Bilinear Scoring Function Search for Knowledge Graph Learning","date":"2021-07-01","arxiv_id":"2107.00184","repositories_listed":3,"syntology":null},{"url":"/paper/efficient-relation-aware-scoring-function","title":"Efficient Relation-aware Scoring Function Search for Knowledge Graph Embedding","date":"2021-04-22","arxiv_id":"2104.10880","repositories_listed":3,"syntology":null},{"url":"/paper/coke-contextualized-knowledge-graph-embedding","title":"CoKE: Contextualized Knowledge Graph Embedding","date":"2019-11-06","arxiv_id":"1911.02168","repositories_listed":3,"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/attributed-graph-clustering-a-deep","title":"Attributed Graph Clustering: A Deep Attentional Embedding Approach","date":"2019-06-15","arxiv_id":"1906.06532","repositories_listed":3,"syntology":{"n":8,"n_ran":2,"n_unverified":6,"n_pointer_only":1}},{"url":"/paper/geometric-laplacian-eigenmap-embedding","title":"GLEE: Geometric Laplacian Eigenmap Embedding","date":"2019-05-23","arxiv_id":"1905.09763","repositories_listed":3,"syntology":null}],"syntology_records":18,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}