{"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/node-classification/papers/18","list_of":"/task/node-classification","task":"Node Classification","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":18,"pages_in_order":19,"rows_per_page":100,"rows":[1701,1800],"of":1860,"counts":{"archive_papers_tagged":1860,"with_a_code_link":991,"where_syntology_ran_a_sample":305,"not_listed_spam_title":0,"listed":1860,"listed_where_code_ran":305,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":256,"every_run_a_failure_of_syntologys_instrument":49,"listed_with_a_run_with_no_instrument_failure":256,"listed_every_run_a_failure_of_syntologys_instrument":49,"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/node-classification","prev":"/task/node-classification/papers/17","next":"/task/node-classification/papers/19","papers":[{"url":null,"slug":"lfgcn-levitating-over-graphs-with-levy","title":"LFGCN: Levitating over Graphs with Levy Flights","date":"2020-09-04","arxiv_id":"2009.02365","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-supervised-smoothing-graph-neural","title":"SAIL: Self-Augmented Graph Contrastive Learning","date":"2020-09-02","arxiv_id":"2009.00934","repositories_listed":0,"syntology":null},{"url":null,"slug":"dve-dynamic-variational-embeddings-with","title":"DVE: Dynamic Variational Embeddings with Applications in Recommender Systems","date":"2020-08-27","arxiv_id":"2009.08962","repositories_listed":0,"syntology":null},{"url":null,"slug":"rethinking-and-relieving-over-smoothing-in","title":"Tackling Over-Smoothing for General Graph Convolutional Networks","date":"2020-08-22","arxiv_id":"2008.09864","repositories_listed":0,"syntology":null},{"url":null,"slug":"complete-the-missing-half-augmenting","title":"Complete the Missing Half: Augmenting Aggregation Filtering with Diversification for Graph Convolutional Networks","date":"2020-08-20","arxiv_id":"2008.08844","repositories_listed":0,"syntology":null},{"url":null,"slug":"degree-quant-quantization-aware-training-for","title":"Degree-Quant: Quantization-Aware Training for Graph Neural Networks","date":"2020-08-11","arxiv_id":"2008.05000","repositories_listed":0,"syntology":null},{"url":null,"slug":"dine-a-framework-for-deep-incomplete-network","title":"DINE: A Framework for Deep Incomplete Network Embedding","date":"2020-08-09","arxiv_id":"2008.06311","repositories_listed":0,"syntology":null},{"url":null,"slug":"directed-hypergraph-neural-network","title":"Directed hypergraph neural network","date":"2020-08-09","arxiv_id":"2008.03626","repositories_listed":0,"syntology":null},{"url":null,"slug":"multivariate-relations-aggregation-learning","title":"Multivariate Relations Aggregation Learning in Social Networks","date":"2020-08-09","arxiv_id":"2008.03654","repositories_listed":0,"syntology":null},{"url":null,"slug":"node2coords-graph-representation-learning","title":"node2coords: Graph Representation Learning with Wasserstein Barycenters","date":"2020-07-31","arxiv_id":"2007.16056","repositories_listed":0,"syntology":null},{"url":null,"slug":"representation-learning-of-graphs-using-graph","title":"Representation Learning of Graphs Using Graph Convolutional Multilayer Networks Based on Motifs","date":"2020-07-31","arxiv_id":"2007.15838","repositories_listed":0,"syntology":null},{"url":null,"slug":"label-consistency-based-graph-neural-networks","title":"Label-Consistency based Graph Neural Networks for Semi-supervised Node Classification","date":"2020-07-27","arxiv_id":"2007.13435","repositories_listed":0,"syntology":null},{"url":null,"slug":"simplification-of-graph-convolutional","title":"Simplification of Graph Convolutional Networks: A Matrix Factorization-based Perspective","date":"2020-07-17","arxiv_id":"2007.09036","repositories_listed":0,"syntology":null},{"url":null,"slug":"are-hyperbolic-representations-in-graphs","title":"Are Hyperbolic Representations in Graphs Created Equal?","date":"2020-07-15","arxiv_id":"2007.07698","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphcl-contrastive-self-supervised-learning","title":"GraphCL: Contrastive Self-Supervised Learning of Graph Representations","date":"2020-07-15","arxiv_id":"2007.08025","repositories_listed":0,"syntology":null},{"url":null,"slug":"next-waves-in-veridical-network-embedding","title":"Next Waves in Veridical Network Embedding","date":"2020-07-10","arxiv_id":"2007.05385","repositories_listed":0,"syntology":null},{"url":null,"slug":"active-learning-on-attributed-graphs-via","title":"Active Learning on Attributed Graphs via Graph Cognizant Logistic Regression and Preemptive Query Generation","date":"2020-07-09","arxiv_id":"2007.05003","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-heterogeneous-information-networks","title":"Pre-Trained Models for Heterogeneous Information Networks","date":"2020-07-07","arxiv_id":"2007.03184","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-spectrum-wavelet-to-vertex-propagation","title":"From Spectrum Wavelet to Vertex Propagation: Graph Convolutional Networks Based on Taylor Approximation","date":"2020-07-01","arxiv_id":"2007.00730","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-clustering-with-graph-neural-networks","title":"Graph Clustering with Graph Neural Networks","date":"2020-06-30","arxiv_id":"2006.16904","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-parametric-graph-learning-for-bayesian","title":"Non-Parametric Graph Learning for Bayesian Graph Neural Networks","date":"2020-06-23","arxiv_id":"2006.13335","repositories_listed":0,"syntology":null},{"url":null,"slug":"connecting-graph-convolutional-networks-and","title":"Connecting Graph Convolutional Networks and Graph-Regularized PCA","date":"2020-06-22","arxiv_id":"2006.12294","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantifying-challenges-in-the-application-of","title":"Quantifying Challenges in the Application of Graph Representation Learning","date":"2020-06-18","arxiv_id":"2006.10252","repositories_listed":0,"syntology":null},{"url":"/paper/nodenet-a-graph-regularised-neural-network","slug":"nodenet-a-graph-regularised-neural-network","title":"NodeNet: A Graph Regularised Neural Network for Node Classification","date":"2020-06-16","arxiv_id":"2006.09022","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-graph-attention-networks-using-effective","title":"Fast Graph Attention Networks Using Effective Resistance Based Graph Sparsification","date":"2020-06-15","arxiv_id":"2006.08796","repositories_listed":0,"syntology":null},{"url":null,"slug":"implicit-kernel-attention","title":"Implicit Kernel Attention","date":"2020-06-11","arxiv_id":"2006.06147","repositories_listed":0,"syntology":null},{"url":null,"slug":"eigen-gnn-a-graph-structure-preserving-plug","title":"Eigen-GNN: A Graph Structure Preserving Plug-in for GNNs","date":"2020-06-08","arxiv_id":"2006.04330","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-combinatorial-solver-for-graph","title":"Learning Combinatorial Solver for Graph Matching","date":"2020-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"shoestring-graph-based-semi-supervised-1","title":"Shoestring: Graph-Based Semi-Supervised Classification With Severely Limited Labeled Data","date":"2020-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-process-for-the-evaluation-of-node","title":"A Process for the Evaluation of Node Embedding Methods in the Context of Node Classification","date":"2020-05-29","arxiv_id":"2005.14683","repositories_listed":0,"syntology":null},{"url":null,"slug":"privacy-preserving-graph-neural-network-for","title":"Vertically Federated Graph Neural Network for Privacy-Preserving Node Classification","date":"2020-05-25","arxiv_id":"2005.11903","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-attack-on-hierarchical-graph","title":"Adversarial Attack on Hierarchical Graph Pooling Neural Networks","date":"2020-05-23","arxiv_id":"2005.11560","repositories_listed":0,"syntology":null},{"url":null,"slug":"foundations-and-modelling-of-dynamic-networks","title":"Foundations and modelling of dynamic networks using Dynamic Graph Neural Networks: A survey","date":"2020-05-13","arxiv_id":"2005.07496","repositories_listed":0,"syntology":null},{"url":null,"slug":"anonymized-gcn-a-novel-robust-graph-embedding","title":"AN-GCN: An Anonymous Graph Convolutional Network Defense Against Edge-Perturbing Attack","date":"2020-05-06","arxiv_id":"2005.03482","repositories_listed":0,"syntology":null},{"url":null,"slug":"hopgat-hop-aware-supervision-graph-attention","title":"HopGAT: Hop-aware Supervision Graph Attention Networks for Sparsely Labeled Graphs","date":"2020-04-09","arxiv_id":"2004.04333","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-graph-convolutional-network-composition","title":"A Graph Convolutional Network Composition Framework for Semi-supervised Classification","date":"2020-04-08","arxiv_id":"2004.03994","repositories_listed":0,"syntology":null},{"url":null,"slug":"attribute2vec-deep-network-embedding-through","title":"Attribute2vec: Deep Network Embedding Through Multi-Filtering GCN","date":"2020-04-03","arxiv_id":"2004.01375","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-over-smoothing-in-deep-gcns","title":"Revisiting Over-smoothing in Deep GCNs","date":"2020-03-30","arxiv_id":"2003.13663","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-collective-learning-framework-to-boost-gnn","title":"A Collective Learning Framework to Boost GNN Expressiveness","date":"2020-03-26","arxiv_id":"2003.12169","repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-graph-attention-network","title":"Spectral Graph Attention Network with Fast Eigen-approximation","date":"2020-03-16","arxiv_id":"2003.07450","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-convolutional-auto-encoder-with-bi","title":"Unsupervised Graph Embedding via Adaptive Graph Learning","date":"2020-03-10","arxiv_id":"2003.04508","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-graphs-and-knowledge-networks-the","title":"Knowledge Graphs and Knowledge Networks: The Story in Brief","date":"2020-03-07","arxiv_id":"2003.03623","repositories_listed":0,"syntology":null},{"url":null,"slug":"epine-enhanced-proximity-information-network","title":"EPINE: Enhanced Proximity Information Network Embedding","date":"2020-03-04","arxiv_id":"2003.02689","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-supervised-graph-representation-learning","title":"Self-Supervised Graph Representation Learning via Global Context Prediction","date":"2020-03-03","arxiv_id":"2003.01604","repositories_listed":0,"syntology":null},{"url":null,"slug":"permutohedral-gcn-graph-convolutional","title":"Permutohedral-GCN: Graph Convolutional Networks with Global Attention","date":"2020-03-02","arxiv_id":"2003.00635","repositories_listed":0,"syntology":null},{"url":null,"slug":"indirect-adversarial-attacks-via-poisoning","title":"Indirect Adversarial Attacks via Poisoning Neighbors for Graph Convolutional Networks","date":"2020-02-19","arxiv_id":"2002.08012","repositories_listed":0,"syntology":null},{"url":null,"slug":"investigating-extensions-to-random-walk-based","title":"Investigating Extensions to Random Walk Based Graph Embedding","date":"2020-02-17","arxiv_id":"2002.07252","repositories_listed":0,"syntology":null},{"url":null,"slug":"line-hypergraph-convolution-network-applying","title":"Line Hypergraph Convolution Network: Applying Graph Convolution for Hypergraphs","date":"2020-02-09","arxiv_id":"2002.03392","repositories_listed":0,"syntology":null},{"url":null,"slug":"hgat-hierarchical-graph-attention-network-for","title":"Fake News Detection on News-Oriented Heterogeneous Information Networks through Hierarchical Graph Attention","date":"2020-02-05","arxiv_id":"2002.04397","repositories_listed":0,"syntology":null},{"url":null,"slug":"explain-graph-neural-networks-to-understand","title":"Explain Graph Neural Networks to Understand Weighted Graph Features in Node Classification","date":"2020-02-02","arxiv_id":"2002.00514","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-ordering-towards-the-optimal-by","title":"Graph Ordering: Towards the Optimal by Learning","date":"2020-01-18","arxiv_id":"2001.06631","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-inference-learning-for-semi-supervised-1","title":"Graph Inference Learning for Semi-supervised Classification","date":"2020-01-17","arxiv_id":"2001.06137","repositories_listed":0,"syntology":null},{"url":null,"slug":"node-masking-making-graph-neural-networks","title":"Node Masking: Making Graph Neural Networks Generalize and Scale Better","date":"2020-01-17","arxiv_id":"2001.07524","repositories_listed":0,"syntology":null},{"url":null,"slug":"document-network-projection-in-pretrained","title":"Document Network Projection in Pretrained Word Embedding Space","date":"2020-01-16","arxiv_id":"2001.05727","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-fcn-for-image-semantic-segmentation","title":"Graph-FCN for image semantic segmentation","date":"2020-01-02","arxiv_id":"2001.00335","repositories_listed":0,"syntology":null},{"url":null,"slug":"unifying-graph-convolutional-networks-as","title":"Unifying Graph Convolutional Networks as Matrix Factorization","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/multi-label-graph-convolutional-network","slug":"multi-label-graph-convolutional-network","title":"Multi-Label Graph Convolutional Network Representation Learning","date":"2019-12-26","arxiv_id":"1912.11757","repositories_listed":0,"syntology":null},{"url":null,"slug":"expanding-label-sets-for-graph-convolutional","title":"Expanding Label Sets for Graph Convolutional Networks","date":"2019-12-18","arxiv_id":"1912.09575","repositories_listed":0,"syntology":null},{"url":null,"slug":"zoom-in-to-where-it-matters-a-hierarchical","title":"Zoom in to where it matters: a hierarchical graph based model for mammogram analysis","date":"2019-12-16","arxiv_id":"1912.07517","repositories_listed":0,"syntology":null},{"url":null,"slug":"bhin2vec-balancing-the-type-of-relation-in","title":"BHIN2vec: Balancing the Type of Relation in Heterogeneous Information Network","date":"2019-11-26","arxiv_id":"1912.08925","repositories_listed":0,"syntology":null},{"url":null,"slug":"minimal-driver-nodes-for-structural","title":"Minimal Driver Nodes for Structural Controllability of Large-Scale Dynamical Systems: Node Classification","date":"2019-11-26","arxiv_id":"1911.11388","repositories_listed":0,"syntology":null},{"url":null,"slug":"customized-graph-embedding-tailoring-the","title":"Customized Graph Embedding: Tailoring Embedding Vectors to different Applications","date":"2019-11-21","arxiv_id":"1911.09454","repositories_listed":0,"syntology":null},{"url":null,"slug":"exponential-family-graph-embeddings","title":"Exponential Family Graph Embeddings","date":"2019-11-20","arxiv_id":"1911.09007","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hierarchy-of-graph-neural-networks-based-on-1","title":"A Hierarchy of Graph Neural Networks Based on Learnable Local Features","date":"2019-11-13","arxiv_id":"1911.05256","repositories_listed":0,"syntology":null},{"url":null,"slug":"constant-curvature-graph-convolutional-1","title":"Constant Curvature Graph Convolutional Networks","date":"2019-11-12","arxiv_id":"1911.05076","repositories_listed":0,"syntology":null},{"url":null,"slug":"higher-order-weighted-graph-convolutional","title":"Higher-order Weighted Graph Convolutional Networks","date":"2019-11-11","arxiv_id":"1911.04129","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-node-classification-by-co-training","title":"HighwayGraph: Modelling Long-distance Node Relations for Improving General Graph Neural Network","date":"2019-11-10","arxiv_id":"1911.03904","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-graph-convolutional-neural-networks-2","title":"Bayesian Graph Convolutional Neural Networks using Node Copying","date":"2019-11-08","arxiv_id":"1911.04965","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-graph-embedding-via-lstm-history","title":"Dynamic Graph Embedding via LSTM History Tracking","date":"2019-11-05","arxiv_id":"1911.01551","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-graph-convolutional-neural-networks-1","title":"Bayesian Graph Convolutional Neural Networks Using Non-Parametric Graph Learning","date":"2019-10-26","arxiv_id":"1910.12132","repositories_listed":0,"syntology":null},{"url":null,"slug":"network2vec-learning-node-representation","title":"Network2Vec Learning Node Representation Based on Space Mapping in Networks","date":"2019-10-23","arxiv_id":"1910.10379","repositories_listed":0,"syntology":null},{"url":null,"slug":"active-learning-for-graph-neural-networks-via","title":"Active Learning for Graph Neural Networks via Node Feature Propagation","date":"2019-10-16","arxiv_id":"1910.07567","repositories_listed":0,"syntology":null},{"url":null,"slug":"link-prediction-via-deep-learning","title":"Link Prediction via Graph Attention Network","date":"2019-10-10","arxiv_id":"1910.04807","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-joint-variational-graph-autoencoders","title":"Dynamic Joint Variational Graph Autoencoders","date":"2019-10-04","arxiv_id":"1910.01963","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-robust-representations-with-graph","title":"Learning Robust Representations with Graph Denoising Policy Network","date":"2019-10-04","arxiv_id":"1910.01784","repositories_listed":0,"syntology":null},{"url":null,"slug":"active-learning-graph-neural-networks-via","title":"Active Learning Graph Neural Networks via Node Feature Propagation","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"attributed-graph-learning-with-2-d-graph","title":"Attributed Graph Learning with 2-D Graph Convolution","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"chordal-gcn-exploiting-sparsity-in-training","title":"Chordal-GCN: Exploiting sparsity in training large-scale graph convolutional networks","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"dimensional-reweighting-graph-convolution","title":"Dimensional Reweighting Graph Convolution Networks","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"octave-graph-convolutional-network","title":"Octave Graph Convolutional Network","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"ordinary-differential-equations-on-graph","title":"Ordinary differential equations on graph networks","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"pine-universal-deep-embedding-for-graph-nodes","title":"PINE: Universal Deep Embedding for Graph Nodes via Partial Permutation Invariant Set Functions","date":"2019-09-25","arxiv_id":"1909.12903","repositories_listed":0,"syntology":null},{"url":null,"slug":"subgraph-attention-for-node-classification","title":"Subgraph Attention for Node Classification and Hierarchical Graph Pooling","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"transfer-active-learning-for-graph-neural","title":"Transfer Active Learning For Graph Neural Networks","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"uncertainty-aware-prediction-for-graph-neural","title":"Uncertainty-Aware Prediction for Graph Neural Networks","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-learning-of-node-embeddings-by","title":"Unsupervised Learning of Node Embeddings by Detecting Communities","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"node-injection-attacks-on-graphs-via","title":"Node Injection Attacks on Graphs via Reinforcement Learning","date":"2019-09-14","arxiv_id":"1909.06543","repositories_listed":0,"syntology":null},{"url":"/paper/auto-gnn-neural-architecture-search-of-graph","slug":"auto-gnn-neural-architecture-search-of-graph","title":"Auto-GNN: Neural Architecture Search of Graph Neural Networks","date":"2019-09-07","arxiv_id":"1909.03184","repositories_listed":0,"syntology":null},{"url":"/paper/measuring-and-relieving-the-over-smoothing","slug":"measuring-and-relieving-the-over-smoothing","title":"Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological View","date":"2019-09-07","arxiv_id":"1909.03211","repositories_listed":0,"syntology":null},{"url":null,"slug":"effective-and-efficient-network-embedding","title":"Initialization for Network Embedding: A Graph Partition Approach","date":"2019-08-28","arxiv_id":"1908.10697","repositories_listed":0,"syntology":null},{"url":"/paper/hpgat-high-order-proximity-informed-graph","slug":"hpgat-high-order-proximity-informed-graph","title":"hpGAT: High-order Proximity Informed Graph Attention Network","date":"2019-08-28","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"motif2vec-motif-aware-node-representation","title":"motif2vec: Motif Aware Node Representation Learning for Heterogeneous Networks","date":"2019-08-22","arxiv_id":"1908.08227","repositories_listed":0,"syntology":null},{"url":null,"slug":"ahine-adaptive-heterogeneous-information","title":"AHINE: Adaptive Heterogeneous Information Network Embedding","date":"2019-08-20","arxiv_id":"1909.01087","repositories_listed":0,"syntology":null},{"url":null,"slug":"megan-a-generative-adversarial-network-for","title":"MEGAN: A Generative Adversarial Network for Multi-View Network Embedding","date":"2019-08-20","arxiv_id":"1909.01084","repositories_listed":0,"syntology":null},{"url":null,"slug":"honem-network-embedding-using-higher-order","title":"HONEM: Learning Embedding for Higher Order Networks","date":"2019-08-15","arxiv_id":"1908.05387","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-kernel-supervised-hashing-for-network","title":"Deep Hashing for Signed Social Network Embedding","date":"2019-08-12","arxiv_id":"1908.04007","repositories_listed":0,"syntology":null},{"url":"/paper/censnet-convolution-with-edge-node-switching","slug":"censnet-convolution-with-edge-node-switching","title":"CensNet: Convolution with Edge-Node Switching in Graph Neural Networks","date":"2019-08-10","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-relational-classification-via-bayesian","title":"Multi-Relational Classification via Bayesian Ranked Non-Linear Embeddings","date":"2019-08-06","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-supervised-tensor-factorization-for-node","title":"Semi-Supervised Tensor Factorization for Node Classification in Complex Social Networks","date":"2019-07-24","arxiv_id":"1907.10416","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-skip-gram-based-graph-embeddings","title":"Improving Skip-Gram based Graph Embeddings via Centrality-Weighted Sampling","date":"2019-07-20","arxiv_id":"1907.08793","repositories_listed":0,"syntology":null}],"record_sha256":"83f34b33857968d780ff3d21f8e3b25b21d7e4f1925c8d1996e13ff8a32a338e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}