{"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/network-embedding/papers/2","list_of":"/task/network-embedding","task":"Network 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":2,"pages_in_order":5,"rows_per_page":100,"rows":[101,200],"of":403,"counts":{"archive_papers_tagged":403,"with_a_code_link":165,"where_syntology_ran_a_sample":24,"not_listed_spam_title":0,"listed":403,"listed_where_code_ran":24,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":21,"every_run_a_failure_of_syntologys_instrument":3,"listed_with_a_run_with_no_instrument_failure":21,"listed_every_run_a_failure_of_syntologys_instrument":3,"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/network-embedding","prev":"/task/network-embedding","next":"/task/network-embedding/papers/3","papers":[{"url":"/paper/sce-scalable-network-embedding-from-sparsest","slug":"sce-scalable-network-embedding-from-sparsest","title":"SCE: Scalable Network Embedding from Sparsest Cut","date":"2020-06-30","arxiv_id":"2006.16499","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/sce-scalable-network-embedding-from-sparsest#ran","syntology_url":"https://syntology.ai/paper/2006.16499","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.16499"}},"official":{"repos":["szzhang17/Sparsest-Cut-Network-Embedding"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/unsupervised-differentiable-multi-aspect","slug":"unsupervised-differentiable-multi-aspect","title":"Unsupervised Differentiable Multi-aspect Network Embedding","date":"2020-06-07","arxiv_id":"2006.04239","repositories_listed":1,"syntology":null},{"url":"/paper/network-together-node-classification-via","slug":"network-together-node-classification-via","title":"Network Together: Node Classification via Cross-Network Deep Network Embedding","date":"2020-06-04","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/structural-temporal-graph-neural-networks-for","slug":"structural-temporal-graph-neural-networks-for","title":"Structural Temporal Graph Neural Networks for Anomaly Detection in Dynamic Graphs","date":"2020-05-15","arxiv_id":"2005.07427","repositories_listed":1,"syntology":null},{"url":"/paper/machine-learning-on-graphs-a-model-and","slug":"machine-learning-on-graphs-a-model-and","title":"Machine Learning on Graphs: A Model and Comprehensive Taxonomy","date":"2020-05-07","arxiv_id":"2005.03675","repositories_listed":1,"syntology":{"n":8,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/machine-learning-on-graphs-a-model-and#ran","syntology_url":"https://syntology.ai/paper/2005.03675","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.03675"}},"official":{"repos":["google/gcnn-survey-paper"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/new-datasets-and-a-benchmark-of-document","slug":"new-datasets-and-a-benchmark-of-document","title":"New Datasets and a Benchmark of Document Network Embedding Methods for Scientific Expert Finding","date":"2020-04-07","arxiv_id":"2004.03621","repositories_listed":1,"syntology":null},{"url":"/paper/heterogeneous-network-representation-learning","slug":"heterogeneous-network-representation-learning","title":"Heterogeneous Network Representation Learning: A Unified Framework with Survey and Benchmark","date":"2020-04-01","arxiv_id":"2004.00216","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-dynamic-heterogeneous-network-for","slug":"modeling-dynamic-heterogeneous-network-for","title":"Modeling Dynamic Heterogeneous Network for Link Prediction using Hierarchical Attention with Temporal RNN","date":"2020-04-01","arxiv_id":"2004.01024","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":1,"n_no_contract":8,"n_pointer_only":3,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 1 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/modeling-dynamic-heterogeneous-network-for#ran","syntology_url":"https://syntology.ai/paper/2004.01024","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.01024"}},"official":{"repos":["skx300/DyHATR"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/temporal-network-representation-learning-via","slug":"temporal-network-representation-learning-via","title":"Temporal Network Representation Learning via Historical Neighborhoods Aggregation","date":"2020-03-30","arxiv_id":"2003.13212","repositories_listed":1,"syntology":null},{"url":"/paper/debayes-a-bayesian-method-for-debiasing","slug":"debayes-a-bayesian-method-for-debiasing","title":"DeBayes: a Bayesian Method for Debiasing Network Embeddings","date":"2020-02-26","arxiv_id":"2002.11442","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-graph-auto-encoder-for-general-data","slug":"adaptive-graph-auto-encoder-for-general-data","title":"Adaptive Graph Auto-Encoder for General Data Clustering","date":"2020-02-20","arxiv_id":"2002.08648","repositories_listed":1,"syntology":null},{"url":"/paper/vertex-reinforced-random-walk-for-network","slug":"vertex-reinforced-random-walk-for-network","title":"Vertex-reinforced Random Walk for Network Embedding","date":"2020-02-11","arxiv_id":"2002.04497","repositories_listed":1,"syntology":null},{"url":"/paper/louvainne-hierarchical-louvain-method-for-1","slug":"louvainne-hierarchical-louvain-method-for-1","title":"LouvainNE: Hierarchical Louvain Method for High Quality and Scalable Network Embedding","date":"2020-02-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/inductive-document-network-embedding-with","slug":"inductive-document-network-embedding-with","title":"Inductive Document Network Embedding with Topic-Word Attention","date":"2020-01-10","arxiv_id":"2001.03369","repositories_listed":1,"syntology":null},{"url":"/paper/louvainne-hierarchical-louvain-method-for","slug":"louvainne-hierarchical-louvain-method-for","title":"LouvainNE: Hierarchical Louvain Method for High Quality and Scalable Network Embedding.","date":"2020-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-non-negative-symmetric-encoder-decoder","slug":"a-non-negative-symmetric-encoder-decoder","title":"A Non-negative Symmetric Encoder-Decoder Approach for Community Detection","date":"2019-12-24","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/jnet-learning-user-representations-via-joint","slug":"jnet-learning-user-representations-via-joint","title":"JNET: Learning User Representations via Joint Network Embedding and Topic Embedding","date":"2019-12-01","arxiv_id":"1912.00465","repositories_listed":1,"syntology":null},{"url":"/paper/rwne-a-scalable-random-walk-based-network","slug":"rwne-a-scalable-random-walk-based-network","title":"RWNE: A Scalable Random-Walk-Based Network Embedding Framework with Personalized Higher-Order Proximity Preserved","date":"2019-11-18","arxiv_id":"1911.07874","repositories_listed":1,"syntology":null},{"url":"/paper/riwalk-fast-structural-node-embedding-via","slug":"riwalk-fast-structural-node-embedding-via","title":"RiWalk: Fast Structural Node Embedding via Role Identification","date":"2019-10-15","arxiv_id":"1910.06541","repositories_listed":1,"syntology":null},{"url":"/paper/gaussian-process-based-dynamic-embedding-for","slug":"gaussian-process-based-dynamic-embedding-for","title":"Dynamic Embedding on Textual Networks via a Gaussian Process","date":"2019-10-05","arxiv_id":"1910.02187","repositories_listed":1,"syntology":null},{"url":"/paper/improving-textual-network-learning-with","slug":"improving-textual-network-learning-with","title":"Improving Textual Network Learning with Variational Homophilic Embeddings","date":"2019-09-30","arxiv_id":"1909.13456","repositories_listed":1,"syntology":null},{"url":"/paper/neural-embedding-propagation-on-heterogeneous","slug":"neural-embedding-propagation-on-heterogeneous","title":"Neural Embedding Propagation on Heterogeneous Networks","date":"2019-09-29","arxiv_id":"1910.00005","repositories_listed":1,"syntology":null},{"url":"/paper/temporal-network-embedding-with-micro-and","slug":"temporal-network-embedding-with-micro-and","title":"Temporal Network Embedding with Micro- and Macro-dynamics","date":"2019-09-10","arxiv_id":"1909.04246","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-training-methods-for-network","slug":"adversarial-training-methods-for-network","title":"Adversarial Training Methods for Network Embedding","date":"2019-08-30","arxiv_id":"1908.11514","repositories_listed":1,"syntology":null},{"url":"/paper/leap-nets-for-power-grid-perturbations","slug":"leap-nets-for-power-grid-perturbations","title":"LEAP nets for power grid perturbations","date":"2019-08-22","arxiv_id":"1908.08314","repositories_listed":1,"syntology":null},{"url":"/paper/domain-adversarial-network-alignment","slug":"domain-adversarial-network-alignment","title":"Domain-adversarial Network Alignment","date":"2019-08-15","arxiv_id":"1908.05429","repositories_listed":1,"syntology":null},{"url":"/paper/prone-fast-and-scalable-network","slug":"prone-fast-and-scalable-network","title":"ProNE: Fast and Scalable Network Representation Learning","date":"2019-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/intentgc-a-scalable-graph-convolution","slug":"intentgc-a-scalable-graph-convolution","title":"IntentGC: a Scalable Graph Convolution Framework Fusing Heterogeneous Information for Recommendation","date":"2019-07-24","arxiv_id":"1907.12377","repositories_listed":1,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":7,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/intentgc-a-scalable-graph-convolution#ran","syntology_url":"https://syntology.ai/paper/1907.12377","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.12377"}},"official":{"repos":["alibaba/euler"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-representation-learning-via-hard-and","slug":"graph-representation-learning-via-hard-and","title":"Graph Representation Learning via Hard and Channel-Wise Attention Networks","date":"2019-07-05","arxiv_id":"1907.04652","repositories_listed":1,"syntology":null},{"url":"/paper/network-embedding-on-compression-and-learning","slug":"network-embedding-on-compression-and-learning","title":"Network Embedding: on Compression and Learning","date":"2019-07-05","arxiv_id":"1907.02811","repositories_listed":1,"syntology":null},{"url":"/paper/netsmf-large-scale-network-embedding-as","slug":"netsmf-large-scale-network-embedding-as","title":"NetSMF: Large-Scale Network Embedding as Sparse Matrix Factorization","date":"2019-06-26","arxiv_id":"1906.11156","repositories_listed":1,"syntology":null},{"url":"/paper/signed-graph-attention-networks","slug":"signed-graph-attention-networks","title":"Signed Graph Attention Networks","date":"2019-06-26","arxiv_id":"1906.10958","repositories_listed":1,"syntology":null},{"url":"/paper/embedding-biomedical-ontologies-by-jointly","slug":"embedding-biomedical-ontologies-by-jointly","title":"Embedding Biomedical Ontologies by Jointly Encoding Network Structure and Textual Node Descriptors","date":"2019-06-13","arxiv_id":"1906.05939","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-network-embedding-via-incremental","slug":"dynamic-network-embedding-via-incremental","title":"Dynamic Network Embedding via Incremental Skip-gram with Negative Sampling","date":"2019-06-09","arxiv_id":"1906.03586","repositories_listed":1,"syntology":null},{"url":"/paper/task-guided-pair-embedding-in-heterogeneous","slug":"task-guided-pair-embedding-in-heterogeneous","title":"Task-Guided Pair Embedding in Heterogeneous Network","date":"2019-06-04","arxiv_id":"1906.01546","repositories_listed":1,"syntology":null},{"url":"/paper/is-a-single-vector-enough-exploring-node","slug":"is-a-single-vector-enough-exploring-node","title":"Is a Single Vector Enough? Exploring Node Polysemy for Network Embedding","date":"2019-05-25","arxiv_id":"1905.10668","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/is-a-single-vector-enough-exploring-node#ran","syntology_url":"https://syntology.ai/paper/1905.10668","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10668"}},"official":null}},{"url":"/paper/data-driven-approximation-of-parametrized","slug":"data-driven-approximation-of-parametrized","title":"Data driven approximation of parametrized PDEs by Reduced Basis and Neural Networks","date":"2019-04-02","arxiv_id":"1904.01514","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/data-driven-approximation-of-parametrized#ran","syntology_url":"https://syntology.ai/paper/1904.01514","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.01514"}},"official":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/graphvite-a-high-performance-cpu-gpu-hybrid","slug":"graphvite-a-high-performance-cpu-gpu-hybrid","title":"GraphVite: A High-Performance CPU-GPU Hybrid System for Node Embedding","date":"2019-03-02","arxiv_id":"1903.00757","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/graphvite-a-high-performance-cpu-gpu-hybrid#ran","syntology_url":"https://syntology.ai/paper/1903.00757","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.00757"}},"official":null}},{"url":"/paper/global-vectors-for-node-representations","slug":"global-vectors-for-node-representations","title":"Global Vectors for Node Representations","date":"2019-02-28","arxiv_id":"1902.11004","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-network-embedding-for-graph","slug":"unsupervised-network-embedding-for-graph","title":"Unsupervised Network Embedding for Graph Visualization, Clustering and Classification","date":"2019-02-25","arxiv_id":"1903.05980","repositories_listed":1,"syntology":null},{"url":"/paper/deep-node-ranking-an-algorithm-for-structural","slug":"deep-node-ranking-an-algorithm-for-structural","title":"Deep Node Ranking for Neuro-symbolic Structural Node Embedding and Classification","date":"2019-02-11","arxiv_id":"1902.03964","repositories_listed":1,"syntology":null},{"url":"/paper/learning-vertex-representations-for-bipartite","slug":"learning-vertex-representations-for-bipartite","title":"Learning Vertex Representations for Bipartite Networks","date":"2019-01-16","arxiv_id":"1901.09676","repositories_listed":1,"syntology":null},{"url":"/paper/attributed-network-embedding-via-subspace","slug":"attributed-network-embedding-via-subspace","title":"Attributed Network Embedding via Subspace Discovery","date":"2019-01-14","arxiv_id":"1901.04095","repositories_listed":1,"syntology":null},{"url":"/paper/search-efficient-binary-network-embedding","slug":"search-efficient-binary-network-embedding","title":"Search Efficient Binary Network Embedding","date":"2019-01-14","arxiv_id":"1901.04097","repositories_listed":1,"syntology":null},{"url":"/paper/deep-network-embedding-for-graph","slug":"deep-network-embedding-for-graph","title":"Deep Network Embedding for Graph Representation Learning in Signed Networks","date":"2019-01-07","arxiv_id":"1901.01718","repositories_listed":1,"syntology":null},{"url":"/paper/lnemlc-label-network-embeddings-for-multi","slug":"lnemlc-label-network-embeddings-for-multi","title":"LNEMLC: Label Network Embeddings for Multi-Label Classification","date":"2018-12-07","arxiv_id":"1812.02956","repositories_listed":1,"syntology":null},{"url":"/paper/attributed-network-embedding-for-incomplete","slug":"attributed-network-embedding-for-incomplete","title":"Attributed Network Embedding for Incomplete Attributed Networks","date":"2018-11-28","arxiv_id":"1811.11728","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/biasedwalk-biased-sampling-for-representation","slug":"biasedwalk-biased-sampling-for-representation","title":"BiasedWalk: Biased Sampling for Representation Learning on Graphs","date":"2018-09-07","arxiv_id":"1809.02482","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-reinforcement-learning-for-zero","slug":"hierarchical-reinforcement-learning-for-zero","title":"Hierarchical Reinforcement Learning for Zero-shot Generalization with Subtask Dependencies","date":"2018-07-19","arxiv_id":"1807.07665","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/hierarchical-reinforcement-learning-for-zero#ran","syntology_url":"https://syntology.ai/paper/1807.07665","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.07665"}},"official":{"repos":["srsohn/subtask-graph-execution"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/learning-deep-network-representations-with","slug":"learning-deep-network-representations-with","title":"Learning Deep Network Representations with Adversarially Regularized Autoencoders","date":"2018-07-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/netwalk-a-flexible-deep-embedding-approach","slug":"netwalk-a-flexible-deep-embedding-approach","title":"NetWalk: A Flexible Deep Embedding Approach for Anomaly Detection in Dynamic Networks","date":"2018-07-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/easing-embedding-learning-by-comprehensive","slug":"easing-embedding-learning-by-comprehensive","title":"Easing Embedding Learning by Comprehensive Transcription of Heterogeneous Information Networks","date":"2018-07-10","arxiv_id":"1807.03490","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/easing-embedding-learning-by-comprehensive#ran","syntology_url":"https://syntology.ai/paper/1807.03490","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.03490"}},"official":{"repos":["GentleZhu/HEER"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/spectral-network-embedding-a-fast-and","slug":"spectral-network-embedding-a-fast-and","title":"Spectral Network Embedding: A Fast and Scalable Method via Sparsity","date":"2018-06-07","arxiv_id":"1806.02623","repositories_listed":1,"syntology":null},{"url":"/paper/rsdne-exploring-relaxed-similarity-and","slug":"rsdne-exploring-relaxed-similarity-and","title":"RSDNE: Exploring Relaxed Similarity and Dissimilarity from Completely-imbalanced Labels for Network Embedding","date":"2018-04-25","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/neural-brane-neural-bayesian-personalized","slug":"neural-brane-neural-bayesian-personalized","title":"Neural-Brane: Neural Bayesian Personalized Ranking for Attributed Network Embedding","date":"2018-04-23","arxiv_id":"1804.08774","repositories_listed":1,"syntology":null},{"url":"/paper/gpsp-graph-partition-and-space-projection","slug":"gpsp-graph-partition-and-space-projection","title":"GPSP: Graph Partition and Space Projection based Approach for Heterogeneous Network Embedding","date":"2018-03-07","arxiv_id":"1803.02590","repositories_listed":1,"syntology":null},{"url":"/paper/shine-signed-heterogeneous-information","slug":"shine-signed-heterogeneous-information","title":"SHINE: Signed Heterogeneous Information Network Embedding for Sentiment Link Prediction","date":"2017-12-03","arxiv_id":"1712.00732","repositories_listed":1,"syntology":null},{"url":"/paper/prune-preserving-proximity-and-global-ranking","slug":"prune-preserving-proximity-and-global-ranking","title":"PRUNE: Preserving Proximity and Global Ranking for Network Embedding","date":"2017-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/contextual-regression-an-accurate-and","slug":"contextual-regression-an-accurate-and","title":"Contextual Regression: An Accurate and Conveniently Interpretable Nonlinear Model for Mining Discovery from Scientific Data","date":"2017-10-30","arxiv_id":"1710.10728","repositories_listed":1,"syntology":null},{"url":"/paper/metapath2vec-scalable-representation-learning","slug":"metapath2vec-scalable-representation-learning","title":"metapath2vec: Scalable Representation Learning for Heterogeneous Networks","date":"2017-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/deep-gaussian-embedding-of-graphs","slug":"deep-gaussian-embedding-of-graphs","title":"Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking","date":"2017-07-12","arxiv_id":"1707.03815","repositories_listed":1,"syntology":null},{"url":"/paper/cane-context-aware-network-embedding-for","slug":"cane-context-aware-network-embedding-for","title":"CANE: Context-Aware Network Embedding for Relation Modeling","date":"2017-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/task-guided-and-path-augmented-heterogeneous","slug":"task-guided-and-path-augmented-heterogeneous","title":"Task-Guided and Path-Augmented Heterogeneous Network Embedding for Author Identification","date":"2016-12-08","arxiv_id":"1612.02814","repositories_listed":1,"syntology":null},{"url":null,"slug":"network-alignment","title":"Network Alignment","date":"2025-04-15","arxiv_id":"2504.11367","repositories_listed":0,"syntology":null},{"url":null,"slug":"subset-contrastive-multi-omics-network","title":"Subset-Contrastive Multi-Omics Network Embedding","date":"2025-04-15","arxiv_id":"2504.11321","repositories_listed":0,"syntology":null},{"url":null,"slug":"unifying-structural-proximity-and-equivalence","title":"Unifying Structural Proximity and Equivalence for Enhanced Dynamic Network Embedding","date":"2025-03-14","arxiv_id":"2503.19926","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-attributed-dynamic-network","title":"Unsupervised Attributed Dynamic Network Embedding with Stability Guarantees","date":"2025-03-04","arxiv_id":"2503.02859","repositories_listed":0,"syntology":null},{"url":null,"slug":"stationary-distribution-of-node2vec-random","title":"Stationary distribution of node2vec random walks on household models","date":"2025-02-26","arxiv_id":"2502.19039","repositories_listed":0,"syntology":null},{"url":null,"slug":"end-to-end-triplet-loss-based-fine-tuning-for","title":"End-to-End triplet loss based fine-tuning for network embedding in effective PII detection","date":"2025-02-13","arxiv_id":"2502.09002","repositories_listed":0,"syntology":null},{"url":null,"slug":"heterogeneous-federated-learning-systems-for","title":"Heterogeneous Federated Learning Systems for Time-Series Power Consumption Prediction with Multi-Head Embedding Mechanism","date":"2025-01-21","arxiv_id":"2501.12136","repositories_listed":0,"syntology":null},{"url":null,"slug":"just-propagate-unifying-matrix-factorization","title":"Just Propagate: Unifying Matrix Factorization, Network Embedding, and LightGCN for Link Prediction","date":"2024-10-26","arxiv_id":"2410.21325","repositories_listed":0,"syntology":null},{"url":null,"slug":"simplifying-complex-machine-learning-by","title":"Simplifying complex machine learning by linearly separable network embedding spaces","date":"2024-10-02","arxiv_id":"2410.01865","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":"2408-02705","title":"PSNE: Efficient Spectral Sparsification Algorithms for Scaling Network Embedding","date":"2024-08-05","arxiv_id":"2408.02705","repositories_listed":0,"syntology":null},{"url":null,"slug":"harvesting-efficient-on-demand-order-pooling","title":"Harvesting Efficient On-Demand Order Pooling from Skilled Couriers: Enhancing Graph Representation Learning for Refining Real-time Many-to-One Assignments","date":"2024-06-20","arxiv_id":"2406.14635","repositories_listed":0,"syntology":null},{"url":null,"slug":"ms-imap-a-multi-scale-graph-embedding","title":"MS-IMAP -- A Multi-Scale Graph Embedding Approach for Interpretable Manifold Learning","date":"2024-06-04","arxiv_id":"2406.02778","repositories_listed":0,"syntology":null},{"url":null,"slug":"simplicity-within-biological-complexity","title":"Simplicity within biological complexity","date":"2024-05-15","arxiv_id":"2405.09595","repositories_listed":0,"syntology":null},{"url":null,"slug":"fusion-of-minutia-cylinder-codes-and-minutia","title":"Fusion of Minutia Cylinder Codes and Minutia Patch Embeddings for Latent Fingerprint Recognition","date":"2024-03-24","arxiv_id":"2403.16172","repositories_listed":0,"syntology":null},{"url":null,"slug":"time-to-cite-modeling-citation-networks-using","title":"Time to Cite: Modeling Citation Networks using the Dynamic Impact Single-Event Embedding Model","date":"2024-02-28","arxiv_id":"2403.00032","repositories_listed":0,"syntology":null},{"url":null,"slug":"vn-network-embedding-newly-emerging-entities","title":"VN Network: Embedding Newly Emerging Entities with Virtual Neighbors","date":"2024-02-21","arxiv_id":"2402.14033","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-loss-landscape-of-shallow-relu-like","title":"Loss Landscape of Shallow ReLU-like Neural Networks: Stationary Points, Saddle Escaping, and Network Embedding","date":"2024-02-08","arxiv_id":"2402.05626","repositories_listed":0,"syntology":null},{"url":null,"slug":"detecting-local-perturbations-of-networks-in","title":"Detecting local perturbations of networks in a latent hyperbolic embedding space","date":"2024-01-24","arxiv_id":"2401.13495","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-molecular-energy-landscapes-by","title":"Clustering Molecular Energy Landscapes by Adaptive Network Embedding","date":"2024-01-19","arxiv_id":"2401.10972","repositories_listed":0,"syntology":null},{"url":null,"slug":"can-we-hedge-carbon-risk-a-network-embedding","title":"Hedging carbon risk with a network approach","date":"2023-11-21","arxiv_id":"2311.12450","repositories_listed":0,"syntology":null},{"url":"/paper/semantic-annotation-of-tabular-data-for","slug":"semantic-annotation-of-tabular-data-for","title":"Semantic Annotation of Tabular Data for Machine-to-Machine Interoperability via Neuro-Symbolic Anchoring","date":"2023-11-20","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"network-embedding-using-sparse-approximations","title":"Network Embedding Using Sparse Approximations of Random Walks","date":"2023-08-25","arxiv_id":"2308.13663","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-weakly-supervised-segmentation-network","title":"A Weakly Supervised Segmentation Network Embedding Cross-scale Attention Guidance and Noise-sensitive Constraint for Detecting Tertiary Lymphoid Structures of Pancreatic Tumors","date":"2023-07-27","arxiv_id":"2307.14603","repositories_listed":0,"syntology":null},{"url":null,"slug":"source-aware-embedding-training-on","title":"Source-Aware Embedding Training on Heterogeneous Information Networks","date":"2023-07-10","arxiv_id":"2307.04336","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-level-embedding-for-time-evolving","title":"Graph-Level Embedding for Time-Evolving Graphs","date":"2023-06-01","arxiv_id":"2306.01012","repositories_listed":0,"syntology":null},{"url":null,"slug":"modeling-dynamic-heterogeneous-graph-and-node","title":"Modeling Dynamic Heterogeneous Graph and Node Importance for Future Citation Prediction","date":"2023-05-27","arxiv_id":"2305.17417","repositories_listed":0,"syntology":null},{"url":null,"slug":"semantic-random-walk-for-graph-representation","title":"Semantic Random Walk for Graph Representation Learning in Attributed Graphs","date":"2023-05-11","arxiv_id":"2305.06531","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":"space-invariant-projection-in-streaming","title":"Space-Invariant Projection in Streaming Network Embedding","date":"2023-03-11","arxiv_id":"2303.06293","repositories_listed":0,"syntology":null},{"url":null,"slug":"cross-version-defect-prediction-with-class","title":"Cross Version Defect Prediction with Class Dependency Embeddings","date":"2022-12-29","arxiv_id":"2212.14404","repositories_listed":0,"syntology":null},{"url":null,"slug":"author-name-disambiguation-via-heterogeneous","title":"Author Name Disambiguation via Heterogeneous Network Embedding from Structural and Semantic Perspectives","date":"2022-12-24","arxiv_id":"2212.12715","repositories_listed":0,"syntology":null},{"url":null,"slug":"recommending-on-graphs-a-comprehensive-review","title":"Recommending on graphs: a comprehensive review from a data perspective","date":"2022-12-23","arxiv_id":"2212.12230","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-model-data-driven-network-embedding","title":"A Model-data-driven Network Embedding Multidimensional Features for Tomographic SAR Imaging","date":"2022-11-28","arxiv_id":"2211.15002","repositories_listed":0,"syntology":null},{"url":null,"slug":"isolation-scheme-for-virtual-network","title":"An Isolation-Aware Online Virtual Network Embedding via Deep Reinforcement Learning","date":"2022-11-25","arxiv_id":"2211.14158","repositories_listed":0,"syntology":null}],"record_sha256":"dcd45421c57028d8e74bdf57179b1d7a69445fdb4970000fdc55dc10f39ee431","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}