{"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/15","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":15,"pages_in_order":19,"rows_per_page":100,"rows":[1401,1500],"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/14","next":"/task/node-classification/papers/16","papers":[{"url":null,"slug":"hcl-improving-graph-representation-with","title":"HCL: Improving Graph Representation with Hierarchical Contrastive Learning","date":"2022-10-21","arxiv_id":"2210.12020","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-magnetic-framelet-based-convolutional","title":"A Magnetic Framelet-Based Convolutional Neural Network for Directed Graphs","date":"2022-10-20","arxiv_id":"2210.10993","repositories_listed":0,"syntology":null},{"url":null,"slug":"causally-guided-regularization-of-graph","title":"Causally-guided Regularization of Graph Attention Improves Generalizability","date":"2022-10-20","arxiv_id":"2210.10946","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-classification-thresholds-for-graph","title":"On Classification Thresholds for Graph Attention with Edge Features","date":"2022-10-18","arxiv_id":"2210.10014","repositories_listed":0,"syntology":null},{"url":null,"slug":"using-graph-algorithms-to-pretrain-graph","title":"Using Graph Algorithms to Pretrain Graph Completion Transformers","date":"2022-10-14","arxiv_id":"2210.07453","repositories_listed":0,"syntology":null},{"url":null,"slug":"boosting-graph-neural-networks-via-adaptive","title":"Boosting Graph Neural Networks via Adaptive Knowledge Distillation","date":"2022-10-12","arxiv_id":"2210.05920","repositories_listed":0,"syntology":null},{"url":null,"slug":"jurygcn-quantifying-jackknife-uncertainty-on","title":"JuryGCN: Quantifying Jackknife Uncertainty on Graph Convolutional Networks","date":"2022-10-12","arxiv_id":"2210.05959","repositories_listed":0,"syntology":null},{"url":null,"slug":"linkless-link-prediction-via-relational","title":"Linkless Link Prediction via Relational Distillation","date":"2022-10-11","arxiv_id":"2210.05801","repositories_listed":0,"syntology":null},{"url":"/paper/break-the-wall-between-homophily-and","slug":"break-the-wall-between-homophily-and","title":"Uplifting Message Passing Neural Network with Graph Original Information","date":"2022-10-08","arxiv_id":"2210.05382","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-semantic-representation-learning","title":"Unsupervised Semantic Representation Learning of Scientific Literature Based on Graph Attention Mechanism and Maximum Mutual Information","date":"2022-10-07","arxiv_id":"2210.03292","repositories_listed":0,"syntology":null},{"url":null,"slug":"teaching-yourself-c-graph-self-distillation","title":"Teaching Yourself: Graph Self-Distillation on Neighborhood for Node Classification","date":"2022-10-05","arxiv_id":"2210.02097","repositories_listed":0,"syntology":null},{"url":null,"slug":"asgnn-graph-neural-networks-with-adaptive","title":"ASGNN: Graph Neural Networks with Adaptive Structure","date":"2022-10-03","arxiv_id":"2210.01002","repositories_listed":0,"syntology":null},{"url":null,"slug":"tpgnn-learning-high-order-information-in","title":"TPGNN: Learning High-order Information in Dynamic Graphs via Temporal Propagation","date":"2022-10-03","arxiv_id":"2210.01171","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-anomaly-detection-with-graph-neural","title":"Graph Anomaly Detection with Graph Neural Networks: Current Status and Challenges","date":"2022-09-29","arxiv_id":"2209.14930","repositories_listed":0,"syntology":null},{"url":null,"slug":"relation-embedding-based-graph-neural","title":"Enabling Homogeneous GNNs to Handle Heterogeneous Graphs via Relation Embedding","date":"2022-09-23","arxiv_id":"2209.11414","repositories_listed":0,"syntology":null},{"url":null,"slug":"imbalanced-nodes-classification-for-graph","title":"Imbalanced Node Processing Method in Graph Neural Network Classification Task","date":"2022-09-18","arxiv_id":"2209.08514","repositories_listed":0,"syntology":null},{"url":null,"slug":"de-bruijn-goes-neural-causality-aware-graph","title":"De Bruijn goes Neural: Causality-Aware Graph Neural Networks for Time Series Data on Dynamic Graphs","date":"2022-09-17","arxiv_id":"2209.08311","repositories_listed":0,"syntology":null},{"url":"/paper/make-heterophily-graphs-better-fit-gnn-a","slug":"make-heterophily-graphs-better-fit-gnn-a","title":"Make Heterophily Graphs Better Fit GNN: A Graph Rewiring Approach","date":"2022-09-17","arxiv_id":"2209.08264","repositories_listed":0,"syntology":null},{"url":null,"slug":"spgp-structure-prototype-guided-graph-pooling","title":"SPGP: Structure Prototype Guided Graph Pooling","date":"2022-09-16","arxiv_id":"2209.07817","repositories_listed":0,"syntology":null},{"url":null,"slug":"dip-gnn-discriminative-pre-training-of-graph","title":"DiP-GNN: Discriminative Pre-Training of Graph Neural Networks","date":"2022-09-15","arxiv_id":"2209.07499","repositories_listed":0,"syntology":null},{"url":null,"slug":"hub-aware-random-walk-graph-embedding-methods","title":"Hub-aware Random Walk Graph Embedding Methods for Classification","date":"2022-09-15","arxiv_id":"2209.07603","repositories_listed":0,"syntology":null},{"url":null,"slug":"characterizing-graph-datasets-for-node","title":"Characterizing Graph Datasets for Node Classification: Homophily-Heterophily Dichotomy and Beyond","date":"2022-09-13","arxiv_id":"2209.06177","repositories_listed":0,"syntology":null},{"url":"/paper/semantic2graph-graph-based-multi-modal","slug":"semantic2graph-graph-based-multi-modal","title":"Semantic2Graph: Graph-based Multi-modal Feature Fusion for Action Segmentation in Videos","date":"2022-09-13","arxiv_id":"2209.05653","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-polynomial-convolution-models-for-node","title":"Graph Polynomial Convolution Models for Node Classification of Non-Homophilous Graphs","date":"2022-09-12","arxiv_id":"2209.05020","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-complex-network-based-graph-embedding","title":"A Complex Network based Graph Embedding Method for Link Prediction","date":"2022-09-11","arxiv_id":"2209.04884","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-supervised-learning-for-heterogeneous","title":"Self-supervised Learning for Heterogeneous Graph via Structure Information based on Metapath","date":"2022-09-09","arxiv_id":"2209.04218","repositories_listed":0,"syntology":null},{"url":null,"slug":"cadence-detection-in-symbolic-classical-music","title":"Cadence Detection in Symbolic Classical Music using Graph Neural Networks","date":"2022-08-31","arxiv_id":"2208.14819","repositories_listed":0,"syntology":null},{"url":null,"slug":"associative-learning-for-network-embedding","title":"Associative Learning for Network Embedding","date":"2022-08-30","arxiv_id":"2208.14376","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-with-few-labeled-nodes-via-augmented","title":"Toward Robust Graph Semi-Supervised Learning against Extreme Data Scarcity","date":"2022-08-26","arxiv_id":"2208.12422","repositories_listed":0,"syntology":null},{"url":null,"slug":"signed-graph-neural-networks-a-frequency","title":"Signed Graph Neural Networks: A Frequency Perspective","date":"2022-08-15","arxiv_id":"2208.07323","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-influence-of-network-structural","title":"TPM: Transition Probability Matrix -- Graph Structural Feature based Embedding","date":"2022-08-07","arxiv_id":"2208.03712","repositories_listed":0,"syntology":null},{"url":null,"slug":"node-copying-a-random-graph-model-for","title":"Node Copying: A Random Graph Model for Effective Graph Sampling","date":"2022-08-04","arxiv_id":"2208.02435","repositories_listed":0,"syntology":null},{"url":null,"slug":"analysis-of-the-spatio-temporal-dynamics-of","title":"Analysis of the Spatio-temporal Dynamics of COVID-19 in Massachusetts via Spectral Graph Wavelet Theory","date":"2022-07-28","arxiv_id":"2208.01749","repositories_listed":0,"syntology":null},{"url":null,"slug":"label-only-membership-inference-attack","title":"Label-Only Membership Inference Attack against Node-Level Graph Neural Networks","date":"2022-07-27","arxiv_id":"2207.13766","repositories_listed":0,"syntology":null},{"url":null,"slug":"digraphwave-scalable-extraction-of-structural","title":"Digraphwave: Scalable Extraction of Structural Node Embeddings via Diffusion on Directed Graphs","date":"2022-07-20","arxiv_id":"2207.10149","repositories_listed":0,"syntology":null},{"url":null,"slug":"comprehensive-graph-gradual-pruning-for","title":"Comprehensive Graph Gradual Pruning for Sparse Training in Graph Neural Networks","date":"2022-07-18","arxiv_id":"2207.08629","repositories_listed":0,"syntology":null},{"url":null,"slug":"demystifying-graph-convolution-with-a-simple","title":"Demystifying Graph Convolution with a Simple Concatenation","date":"2022-07-18","arxiv_id":"2207.12931","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-cnn-for-moving-object-detection-in","title":"Graph CNN for Moving Object Detection in Complex Environments from Unseen Videos","date":"2022-07-13","arxiv_id":"2207.06440","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-spectral-graph-convolutions-to-large","title":"From Spectral Graph Convolutions to Large Scale Graph Convolutional Networks","date":"2022-07-12","arxiv_id":"2207.05669","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-graph-neural-network-fairness-in-the","title":"On Graph Neural Network Fairness in the Presence of Heterophilous Neighborhoods","date":"2022-07-10","arxiv_id":"2207.04376","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-guarantee-of-training-graph","title":"Generalization Guarantee of Training Graph Convolutional Networks with Graph Topology Sampling","date":"2022-07-07","arxiv_id":"2207.03584","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-networks-in-a-product-of-hyperbolic","title":"Neural Networks in a Product of Hyperbolic Spaces","date":"2022-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"rgl-a-simple-yet-effective-relation-graph-1","title":"RGL: A Simple yet Effective Relation Graph Augmented Prompt-based Tuning Approach for Few-Shot Learning","date":"2022-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"similarity-aware-positive-instance-sampling-1","title":"Similarity-aware Positive Instance Sampling for Graph Contrastive Pre-training","date":"2022-06-23","arxiv_id":"2206.11959","repositories_listed":0,"syntology":null},{"url":null,"slug":"propagation-with-adaptive-mask-then-training","title":"Propagation with Adaptive Mask then Training for Node Classification on Attributed Networks","date":"2022-06-21","arxiv_id":"2206.10142","repositories_listed":0,"syntology":null},{"url":null,"slug":"resnorm-tackling-long-tailed-degree","title":"ResNorm: Tackling Long-tailed Degree Distribution Issue in Graph Neural Networks via Normalization","date":"2022-06-16","arxiv_id":"2206.08181","repositories_listed":0,"syntology":null},{"url":null,"slug":"superiority-of-gnn-over-nn-in-generalizing","title":"Superiority of GNN over NN in generalizing bandlimited functions","date":"2022-06-13","arxiv_id":"2206.05904","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-supervised-hierarchical-graph","title":"Semi-Supervised Hierarchical Graph Classification","date":"2022-06-11","arxiv_id":"2206.05416","repositories_listed":0,"syntology":null},{"url":null,"slug":"synthetic-over-sampling-for-imbalanced-node","title":"Synthetic Over-sampling for Imbalanced Node Classification with Graph Neural Networks","date":"2022-06-10","arxiv_id":"2206.05335","repositories_listed":0,"syntology":null},{"url":null,"slug":"we-cannot-guarantee-safety-the-undecidability","title":"Fundamental Limits in Formal Verification of Message-Passing Neural Networks","date":"2022-06-10","arxiv_id":"2206.05070","repositories_listed":0,"syntology":null},{"url":null,"slug":"alternately-optimized-graph-neural-networks","title":"Alternately Optimized Graph Neural Networks","date":"2022-06-08","arxiv_id":"2206.03638","repositories_listed":0,"syntology":null},{"url":null,"slug":"interpolation-based-correlation-reduction","title":"Mixed Graph Contrastive Network for Semi-Supervised Node Classification","date":"2022-06-06","arxiv_id":"2206.02796","repositories_listed":0,"syntology":null},{"url":"/paper/restructuring-graph-for-higher-homophily-via","slug":"restructuring-graph-for-higher-homophily-via","title":"Restructuring Graph for Higher Homophily via Adaptive Spectral Clustering","date":"2022-06-06","arxiv_id":"2206.02386","repositories_listed":0,"syntology":null},{"url":"/paper/universal-deep-gnns-rethinking-residual","slug":"universal-deep-gnns-rethinking-residual","title":"Universal Deep GNNs: Rethinking Residual Connection in GNNs from a Path Decomposition Perspective for Preventing the Over-smoothing","date":"2022-05-30","arxiv_id":"2205.15127","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-order-pooling-for-graph-neural-networks","title":"High-Order Pooling for Graph Neural Networks with Tensor Decomposition","date":"2022-05-24","arxiv_id":"2205.11691","repositories_listed":0,"syntology":null},{"url":null,"slug":"imgcl-revisiting-graph-contrastive-learning","title":"ImGCL: Revisiting Graph Contrastive Learning on Imbalanced Node Classification","date":"2022-05-23","arxiv_id":"2205.11332","repositories_listed":0,"syntology":null},{"url":null,"slug":"delator-automatic-detection-of-money","title":"DELATOR: Money Laundering Detection via Multi-Task Learning on Large Transaction Graphs","date":"2022-05-20","arxiv_id":"2205.10293","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairnorm-fair-and-fast-graph-neural-network","title":"FairNorm: Fair and Fast Graph Neural Network Training","date":"2022-05-20","arxiv_id":"2205.09977","repositories_listed":0,"syntology":null},{"url":null,"slug":"parallel-and-distributed-graph-neural","title":"Parallel and Distributed Graph Neural Networks: An In-Depth Concurrency Analysis","date":"2022-05-19","arxiv_id":"2205.09702","repositories_listed":0,"syntology":null},{"url":null,"slug":"ndggnet-a-node-independent-gate-based-graph","title":"NDGGNET-A Node Independent Gate based Graph Neural Networks","date":"2022-05-11","arxiv_id":"2205.05348","repositories_listed":0,"syntology":null},{"url":null,"slug":"select-and-calibrate-the-low-confidence-dual","title":"Select and Calibrate the Low-confidence: Dual-Channel Consistency based Graph Convolutional Networks","date":"2022-05-08","arxiv_id":"2205.03753","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-optimal-propagation-for-graph-neural","title":"Optimal Propagation for Graph Neural Networks","date":"2022-05-06","arxiv_id":"2205.02998","repositories_listed":0,"syntology":null},{"url":null,"slug":"fastgcl-fast-self-supervised-learning-on","title":"FastGCL: Fast Self-Supervised Learning on Graphs via Contrastive Neighborhood Aggregation","date":"2022-05-02","arxiv_id":"2205.00905","repositories_listed":0,"syntology":null},{"url":null,"slug":"detecting-topology-attacks-against-graph","title":"Detecting Topology Attacks against Graph Neural Networks","date":"2022-04-21","arxiv_id":"2204.10072","repositories_listed":0,"syntology":null},{"url":null,"slug":"dark-spot-detection-from-sar-images-based-on","title":"Dark Spot Detection from SAR Images Based on Superpixel Deeper Graph Convolutional Network","date":"2022-04-20","arxiv_id":"2204.09230","repositories_listed":0,"syntology":null},{"url":null,"slug":"effects-of-graph-convolutions-in-deep","title":"Effects of Graph Convolutions in Multi-layer Networks","date":"2022-04-20","arxiv_id":"2204.09297","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphhop-new-insights-into-graphhop-and-its","title":"Label Efficient Regularization and Propagation for Graph Node Classification","date":"2022-04-19","arxiv_id":"2204.08646","repositories_listed":0,"syntology":null},{"url":null,"slug":"ergo-event-relational-graph-transformer-for","title":"ERGO: Event Relational Graph Transformer for Document-level Event Causality Identification","date":"2022-04-15","arxiv_id":"2204.07434","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-view-graph-structure-learning-using","title":"Multi-view graph structure learning using subspace merging on Grassmann manifold","date":"2022-04-11","arxiv_id":"2204.05258","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-graph-representation-learning","title":"A Survey on Graph Representation Learning Methods","date":"2022-04-04","arxiv_id":"2204.01855","repositories_listed":0,"syntology":null},{"url":null,"slug":"message-passing-neural-networks-for","title":"Message Passing Neural Networks for Hypergraphs","date":"2022-03-31","arxiv_id":"2203.16995","repositories_listed":0,"syntology":null},{"url":null,"slug":"neighbor-enhanced-graph-convolutional","title":"Neighbor Enhanced Graph Convolutional Networks for Node Classification and Recommendation","date":"2022-03-30","arxiv_id":"2203.16097","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-simple-yet-effective-pretraining-strategy","title":"Supervised Graph Contrastive Learning for Few-shot Node Classification","date":"2022-03-29","arxiv_id":"2203.15936","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-top-down-supervised-learning-approach-to","title":"A Top-down Supervised Learning Approach to Hierarchical Multi-label Classification in Networks","date":"2022-03-23","arxiv_id":"2203.12569","repositories_listed":0,"syntology":null},{"url":null,"slug":"supervised-contrastive-learning-with","title":"Supervised Contrastive Learning with Structure Inference for Graph Classification","date":"2022-03-15","arxiv_id":"2203.07691","repositories_listed":0,"syntology":null},{"url":null,"slug":"shift-robust-node-classification-via-graph","title":"Shift-Robust Node Classification via Graph Adversarial Clustering","date":"2022-03-07","arxiv_id":"2203.15802","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-partial-multiplex-network-embedding","title":"Deep Partial Multiplex Network Embedding","date":"2022-03-05","arxiv_id":"2203.02656","repositories_listed":0,"syntology":null},{"url":null,"slug":"pay-attention-to-relations-multi-embeddings","title":"Pay Attention to Relations: Multi-embeddings for Attributed Multiplex Networks","date":"2022-03-03","arxiv_id":"2203.01903","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-edge-disentanglement-for-node","title":"Exploring Edge Disentanglement for Node Classification","date":"2022-02-23","arxiv_id":"2202.11245","repositories_listed":0,"syntology":null},{"url":null,"slug":"when-does-a-spectral-graph-neural-network","title":"When Does A Spectral Graph Neural Network Fail in Node Classification?","date":"2022-02-16","arxiv_id":"2202.07902","repositories_listed":0,"syntology":null},{"url":null,"slug":"geometric-graph-representation-learning-via","title":"Geometric Graph Representation Learning via Maximizing Rate Reduction","date":"2022-02-13","arxiv_id":"2202.06241","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-asymmetric-embedding-for-attributed","title":"Learning Asymmetric Embedding for Attributed Networks via Convolutional Neural Network","date":"2022-02-13","arxiv_id":"2202.06307","repositories_listed":0,"syntology":null},{"url":null,"slug":"bandit-sampling-for-multiplex-networks","title":"Bandit Sampling for Multiplex Networks","date":"2022-02-08","arxiv_id":"2202.03621","repositories_listed":0,"syntology":null},{"url":null,"slug":"fmp-toward-fair-graph-message-passing-against","title":"FMP: Toward Fair Graph Message Passing against Topology Bias","date":"2022-02-08","arxiv_id":"2202.04187","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-models-for-output-space-invariance-in-1","title":"Neural Models for Output-Space Invariance in Combinatorial Problems","date":"2022-02-07","arxiv_id":"2202.03229","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-neural-network-with-curriculum-learning","title":"Graph Neural Network with Curriculum Learning for Imbalanced Node Classification","date":"2022-02-05","arxiv_id":"2202.02529","repositories_listed":0,"syntology":null},{"url":null,"slug":"investigating-transfer-learning-in-graph","title":"Investigating Transfer Learning in Graph Neural Networks","date":"2022-02-01","arxiv_id":"2202.00740","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-robust-representation-through-graph","title":"Learning Robust Representation through Graph Adversarial Contrastive Learning","date":"2022-01-31","arxiv_id":"2201.13025","repositories_listed":0,"syntology":null},{"url":null,"slug":"density-aware-hyper-graph-neural-networks-for","title":"Density-Aware Hyper-Graph Neural Networks for Graph-based Semi-supervised Node Classification","date":"2022-01-27","arxiv_id":"2201.11511","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-learning-of-hierarchical-community","title":"Joint Learning of Hierarchical Community Structure and Node Representations: An Unsupervised Approach","date":"2022-01-22","arxiv_id":"2201.09086","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-hyperbolic-graph-embeddings-via","title":"Enhancing Hyperbolic Graph Embeddings via Contrastive Learning","date":"2022-01-21","arxiv_id":"2201.08554","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-node-representation-learning-via-1","title":"Fair Node Representation Learning via Adaptive Data Augmentation","date":"2022-01-21","arxiv_id":"2201.08549","repositories_listed":0,"syntology":null},{"url":null,"slug":"informative-pseudo-labeling-for-graph-neural","title":"Informative Pseudo-Labeling for Graph Neural Networks with Few Labels","date":"2022-01-20","arxiv_id":"2201.07951","repositories_listed":0,"syntology":null},{"url":null,"slug":"dehin-a-decentralized-framework-for-embedding","title":"DeHIN: A Decentralized Framework for Embedding Large-scale Heterogeneous Information Networks","date":"2022-01-08","arxiv_id":"2201.02757","repositories_listed":0,"syntology":null},{"url":null,"slug":"neighbor2vec-an-efficient-and-effective","title":"Neighbor2vec: an efficient and effective method for Graph Embedding","date":"2022-01-07","arxiv_id":"2201.02626","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-decipher-a-transparent-dual-attention","title":"Graph Decipher: A transparent dual-attention graph neural network to understand the message-passing mechanism for the node classification","date":"2022-01-04","arxiv_id":"2201.01381","repositories_listed":0,"syntology":null},{"url":null,"slug":"toward-the-analysis-of-graph-neural-networks","title":"Toward the Analysis of Graph Neural Networks","date":"2022-01-01","arxiv_id":"2201.00115","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-comprehensive-analytical-survey-on","title":"A Comprehensive Analytical Survey on Unsupervised and Semi-Supervised Graph Representation Learning Methods","date":"2021-12-20","arxiv_id":"2112.10372","repositories_listed":0,"syntology":null},{"url":null,"slug":"time-aware-neighbor-sampling-for-temporal","title":"Time-Aware Neighbor Sampling for Temporal Graph Networks","date":"2021-12-18","arxiv_id":"2112.09845","repositories_listed":0,"syntology":null},{"url":null,"slug":"bgl-gpu-efficient-gnn-training-by-optimizing","title":"BGL: GPU-Efficient GNN Training by Optimizing Graph Data I/O and Preprocessing","date":"2021-12-16","arxiv_id":"2112.08541","repositories_listed":0,"syntology":null}],"record_sha256":"71ce8df58e3b28ef28e7b341f9c07b84395d3c9843ff3920c03aa75346011b99","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}