{"url":"/task/network-embedding","name":"Network Embedding","slug":"network-embedding","description_markdown":"**Network Embedding**, also known as \"Network Representation Learning\", is a collective term for techniques for mapping graph nodes to vectors of real numbers in a multidimensional space. To be useful, a good embedding should preserve the structure of the graph. The vectors can then be used as input to various network and graph analysis tasks, such as link prediction\r\n\r\n\r\n<span class=\"description-source\">Source: [Tutorial on NLP-Inspired Network Embedding ](https://arxiv.org/abs/1910.07212)</span>","categories":[{"name":"Computer Vision","url":"/area/computer-vision"},{"name":"Methodology","url":"/area/methodology"},{"name":"Natural Language Processing","url":"/area/natural-language-processing"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":403,"papers_with_code":165,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"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":5,"subtasks":0,"parent_tasks":1},"benchmarks":[],"datasets":[{"url":"/dataset/arxiv-astro-ph","name":"arXiv Astro-Ph","full_name":"","num_papers_in_archive":10},{"url":"/dataset/netzschleuder","name":"Netzschleuder","full_name":"network catalogue, repository and centrifuge","num_papers_in_archive":5},{"url":"/dataset/is-a","name":"IS-A","full_name":null,"num_papers_in_archive":4},{"url":"/dataset/birdeep","name":"BIRDeep","full_name":"BIRDeep_AudioAnnotations","num_papers_in_archive":1},{"url":"/dataset/part-of","name":"PART-OF","full_name":null,"num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[{"url":"/task/representation-learning","name":"Representation Learning"}],"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":165,"tagged_in_all":403,"items":[{"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/structural-deep-network-embedding","title":"Structural Deep Network Embedding","date":"2016-06-01","arxiv_id":null,"repositories_listed":6,"syntology":null},{"url":"/paper/multi-scale-attributed-node-embedding","title":"Multi-scale Attributed Node Embedding","date":"2019-09-28","arxiv_id":"1909.13021","repositories_listed":5,"syntology":{"n":6,"n_ran":0,"n_unverified":6,"n_pointer_only":0}},{"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/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/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/mvn2vec-preservation-and-collaboration-in","title":"mvn2vec: Preservation and Collaboration in Multi-View Network Embedding","date":"2018-01-19","arxiv_id":"1801.06597","repositories_listed":4,"syntology":null},{"url":"/paper/network-embedding-as-matrix-factorization","title":"Network Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2vec","date":"2017-10-09","arxiv_id":"1710.02971","repositories_listed":4,"syntology":{"n":3,"n_ran":3,"n_unverified":0,"n_pointer_only":0}},{"url":"/paper/robust-dynamic-network-embedding-via","title":"Robust Dynamic Network Embedding via Ensembles","date":"2021-05-30","arxiv_id":"2105.14557","repositories_listed":3,"syntology":null},{"url":"/paper/sub-graph-contrast-for-scalable-self","title":"Sub-graph Contrast for Scalable Self-Supervised Graph Representation Learning","date":"2020-09-22","arxiv_id":"2009.10273","repositories_listed":3,"syntology":null},{"url":"/paper/multi-view-collaborative-network-embedding","title":"Multi-View Collaborative Network Embedding","date":"2020-05-17","arxiv_id":"2005.08189","repositories_listed":3,"syntology":null},{"url":"/paper/outlier-aware-network-embedding-for","title":"Outlier Aware Network Embedding for Attributed Networks","date":"2018-11-19","arxiv_id":"1811.07609","repositories_listed":3,"syntology":null},{"url":"/paper/network-representation-learning-with-rich","title":"Network Representation Learning with Rich Text Information","date":"2015-06-24","arxiv_id":null,"repositories_listed":3,"syntology":null},{"url":"/paper/joint-admission-control-and-resource","title":"Joint Admission Control and Resource Allocation of Virtual Network Embedding via Hierarchical Deep Reinforcement Learning","date":"2024-06-25","arxiv_id":"2406.17334","repositories_listed":2,"syntology":{"n":7,"n_ran":3,"n_unverified":4,"n_pointer_only":7}},{"url":"/paper/flagvne-a-flexible-and-generalizable","title":"FlagVNE: A Flexible and Generalizable Reinforcement Learning Framework for Network Resource Allocation","date":"2024-04-19","arxiv_id":"2404.12633","repositories_listed":2,"syntology":{"n":6,"n_ran":1,"n_unverified":5,"n_pointer_only":6}},{"url":"/paper/online-knowledge-distillation-via-mutual","title":"Online Knowledge Distillation via Mutual Contrastive Learning for Visual Recognition","date":"2022-07-23","arxiv_id":"2207.11518","repositories_listed":2,"syntology":null},{"url":"/paper/glodyne-global-topology-preserving-dynamic","title":"GloDyNE: Global Topology Preserving Dynamic Network Embedding","date":"2020-08-05","arxiv_id":"2008.01935","repositories_listed":2,"syntology":null},{"url":"/paper/network-embedding-with-completely-imbalanced-1","title":"Network Embedding with Completely-imbalanced Labels","date":"2020-07-07","arxiv_id":"2007.03545","repositories_listed":2,"syntology":null},{"url":"/paper/csne-conditional-signed-network-embedding","title":"CSNE: Conditional Signed Network Embedding","date":"2020-05-19","arxiv_id":"2005.10701","repositories_listed":2,"syntology":null},{"url":"/paper/fast-network-embedding-enhancement-via-high","title":"Fast Network Embedding Enhancement via High Order Proximity Approximation","date":"2020-05-13","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/network-representation-learning-for-link","title":"Benchmarking Network Embedding Models for Link Prediction: Are We Making Progress?","date":"2020-02-25","arxiv_id":"2002.11522","repositories_listed":2,"syntology":null},{"url":"/paper/adversarial-deep-network-embedding-for-cross","title":"Adversarial Deep Network Embedding for Cross-network Node Classification","date":"2020-02-18","arxiv_id":"2002.07366","repositories_listed":2,"syntology":{"n":11,"n_ran":8,"n_unverified":3,"n_pointer_only":11}},{"url":"/paper/unsupervised-attributed-multiplex-network","title":"Unsupervised Attributed Multiplex Network Embedding","date":"2019-11-15","arxiv_id":"1911.06750","repositories_listed":2,"syntology":null},{"url":"/paper/higitclass-keyword-driven-hierarchical","title":"HiGitClass: Keyword-Driven Hierarchical Classification of GitHub Repositories","date":"2019-10-16","arxiv_id":"1910.07115","repositories_listed":2,"syntology":null},{"url":"/paper/fast-and-accurate-network-embeddings-via-very","title":"Fast and Accurate Network Embeddings via Very Sparse Random Projection","date":"2019-08-30","arxiv_id":"1908.11512","repositories_listed":2,"syntology":{"n":3,"n_ran":0,"n_unverified":3,"n_pointer_only":0}},{"url":"/paper/dynwalks-global-topology-and-recent-changes-1","title":"DynWalks: Global Topology and Recent Changes Awareness Dynamic Network Embedding","date":"2019-07-27","arxiv_id":"1907.11968","repositories_listed":2,"syntology":null},{"url":"/paper/190600684","title":"DANE: Domain Adaptive Network Embedding","date":"2019-06-03","arxiv_id":"1906.00684","repositories_listed":2,"syntology":null},{"url":"/paper/hahe-hierarchical-attentive-heterogeneous","title":"HAHE: Hierarchical Attentive Heterogeneous Information Network Embedding","date":"2019-01-31","arxiv_id":"1902.01475","repositories_listed":2,"syntology":null},{"url":"/paper/enhanced-network-embedding-with-text","title":"Enhanced Network Embedding with Text Information","date":"2018-11-29","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/binarized-attributed-network-embedding","title":"Binarized Attributed Network Embedding","date":"2018-10-22","arxiv_id":null,"repositories_listed":2,"syntology":null}],"syntology_records":9,"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"}}