{"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/graph-learning/papers/15","list_of":"/task/graph-learning","task":"Graph Learning","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":16,"rows_per_page":100,"rows":[1401,1500],"of":1570,"counts":{"archive_papers_tagged":1570,"with_a_code_link":686,"where_syntology_ran_a_sample":193,"not_listed_spam_title":0,"listed":1570,"listed_where_code_ran":193,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":162,"every_run_a_failure_of_syntologys_instrument":31,"listed_with_a_run_with_no_instrument_failure":162,"listed_every_run_a_failure_of_syntologys_instrument":31,"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/graph-learning","prev":"/task/graph-learning/papers/14","next":"/task/graph-learning/papers/16","papers":[{"url":null,"slug":"robust-graph-learning-under-wasserstein","title":"Robust Graph Learning Under Wasserstein Uncertainty","date":"2021-05-10","arxiv_id":"2105.04210","repositories_listed":0,"syntology":null},{"url":null,"slug":"fedgl-federated-graph-learning-framework-with","title":"FedGL: Federated Graph Learning Framework with Global Self-Supervision","date":"2021-05-07","arxiv_id":"2105.03170","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-learning-a-survey","title":"Graph Learning: A Survey","date":"2021-05-03","arxiv_id":"2105.00696","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-decoupling-attention-markov-networks","title":"Graph Decoupling Attention Markov Networks for Semi-supervised Graph Node Classification","date":"2021-04-28","arxiv_id":"2104.13718","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-supervised-superpixel-based-multi","title":"Semi-supervised Superpixel-based Multi-Feature Graph Learning for Hyperspectral Image Data","date":"2021-04-27","arxiv_id":"2104.13268","repositories_listed":0,"syntology":null},{"url":null,"slug":"sgl-spectral-graph-learning-from-measurements","title":"SGL: Spectral Graph Learning from Measurements","date":"2021-04-16","arxiv_id":"2104.07867","repositories_listed":0,"syntology":null},{"url":"/paper/disentangled-motif-aware-graph-learning-for","slug":"disentangled-motif-aware-graph-learning-for","title":"Disentangled Motif-aware Graph Learning for Phrase Grounding","date":"2021-04-13","arxiv_id":"2104.06008","repositories_listed":0,"syntology":null},{"url":null,"slug":"auto-weighted-multi-view-feature-selection","title":"Auto-weighted Multi-view Feature Selection with Graph Optimization","date":"2021-04-11","arxiv_id":"2104.04906","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-intention-network-for-click-through","title":"Graph Intention Network for Click-through Rate Prediction in Sponsored Search","date":"2021-03-30","arxiv_id":"2103.16164","repositories_listed":0,"syntology":null},{"url":null,"slug":"entity-context-graph-learning-entity","title":"Entity Context Graph: Learning Entity Representations fromSemi-Structured Textual Sources on the Web","date":"2021-03-29","arxiv_id":"2103.15950","repositories_listed":0,"syntology":null},{"url":null,"slug":"ia-gcn-interpretable-attention-based-graph","title":"IA-GCN: Interpretable Attention based Graph Convolutional Network for Disease prediction","date":"2021-03-29","arxiv_id":"2103.15587","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-aware-contrastive-molecular-graph","title":"Knowledge-aware Contrastive Molecular Graph Learning","date":"2021-03-24","arxiv_id":"2103.13047","repositories_listed":0,"syntology":null},{"url":null,"slug":"expanding-semantic-knowledge-for-zero-shot","title":"Expanding Semantic Knowledge for Zero-shot Graph Embedding","date":"2021-03-23","arxiv_id":"2103.12491","repositories_listed":0,"syntology":null},{"url":null,"slug":"recognizing-predictive-substructures-with","title":"Recognizing Predictive Substructures with Subgraph Information Bottleneck","date":"2021-03-20","arxiv_id":"2103.11155","repositories_listed":0,"syntology":null},{"url":null,"slug":"ano-graph-learning-normal-scene-contextual","title":"Ano-Graph: Learning Normal Scene Contextual Graphs to Detect Video Anomalies","date":"2021-03-18","arxiv_id":"2103.10502","repositories_listed":0,"syntology":null},{"url":null,"slug":"diversified-multiscale-graph-learning-with","title":"Diversified Multiscale Graph Learning with Graph Self-Correction","date":"2021-03-17","arxiv_id":"2103.09754","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-force-learning","title":"Graph Force Learning","date":"2021-03-07","arxiv_id":"2103.04344","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-graph-learning-under-smoothness-priors","title":"Online Graph Learning under Smoothness Priors","date":"2021-03-05","arxiv_id":"2103.03762","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-level-adaptive-region-of-interest-and","title":"Multi-Level Adaptive Region of Interest and Graph Learning for Facial Action Unit Recognition","date":"2021-02-24","arxiv_id":"2102.12154","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-graph-modeling-of-simultaneous-eeg","title":"Dynamic Graph Modeling of Simultaneous EEG and Eye-tracking Data for Reading Task Identification","date":"2021-02-21","arxiv_id":"2102.11922","repositories_listed":0,"syntology":null},{"url":null,"slug":"glam-graph-learning-by-modeling-affinity-to","title":"GLAM: Graph Learning by Modeling Affinity to Labeled Nodes for Graph Neural Networks","date":"2021-02-20","arxiv_id":"2102.10403","repositories_listed":0,"syntology":null},{"url":null,"slug":"structured-graph-learning-for-scalable","title":"Structured Graph Learning for Scalable Subspace Clustering: From Single-view to Multi-view","date":"2021-02-16","arxiv_id":"2102.07943","repositories_listed":0,"syntology":null},{"url":null,"slug":"pre-demosaic-graph-based-light-field-image","title":"Pre-demosaic Graph-based Light Field Image Compression","date":"2021-02-15","arxiv_id":"2102.07883","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-greedy-graph-search-algorithm-based-on","title":"A Greedy Graph Search Algorithm Based on Changepoint Analysis for Automatic QRS Complex Detection","date":"2021-02-06","arxiv_id":"2102.03538","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-graph-constrained-changepoint-learning","title":"A Graph-Constrained Changepoint Learning Approach for Automatic QRS-Complex Detection","date":"2021-02-02","arxiv_id":"2102.01319","repositories_listed":0,"syntology":null},{"url":null,"slug":"identifying-first-order-lowpass-graph-signals","title":"Identifying First-order Lowpass Graph Signals using Perron Frobenius Theorem","date":"2021-01-20","arxiv_id":"2101.07938","repositories_listed":0,"syntology":null},{"url":null,"slug":"edge-featured-graph-attention-network","title":"Edge-Featured Graph Attention Network","date":"2021-01-19","arxiv_id":"2101.07671","repositories_listed":0,"syntology":null},{"url":null,"slug":"temporal-contrastive-graph-for-self","title":"Temporal Contrastive Graph Learning for Video Action Recognition and Retrieval","date":"2021-01-04","arxiv_id":"2101.00820","repositories_listed":0,"syntology":null},{"url":null,"slug":"tensorizing-subgraph-search-in-the-supernet","title":"Topology-aware Tensor Decomposition for Meta-graph Learning","date":"2021-01-04","arxiv_id":"2101.01078","repositories_listed":0,"syntology":null},{"url":null,"slug":"coldexpand-semi-supervised-graph-learning-in","title":"ColdExpand: Semi-Supervised Graph Learning in Cold Start","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"dual-bipartite-graph-learning-a-general","title":"Dual Bipartite Graph Learning: A General Approach for Domain Adaptive Object Detection","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-learning-via-spectral-densification","title":"Graph Learning via Spectral Densification","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"incremental-learning-on-growing-graphs","title":"Incremental Learning on Growing Graphs","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-collaborative-filtering-via","title":"Inductive Collaborative Filtering via Relation Graph Learning","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-solve-multi-robot-task-allocation","title":"Learning to Solve Multi-Robot Task Allocation with a Covariant-Attention based Neural Architecture","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"light-field-saliency-detection-with-dual-1","title":"Light Field Saliency Detection With Dual Local Graph Learning and Reciprocative Guidance","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"online-discriminative-graph-learning-from","title":"Online Discriminative Graph Learning from Multi-Class Smooth Signals","date":"2021-01-01","arxiv_id":"2101.00184","repositories_listed":0,"syntology":null},{"url":null,"slug":"wasserstein-coupled-graph-learning-for-cross","title":"Wasserstein Coupled Graph Learning for Cross-Modal Retrieval","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"bosonic-random-walk-networks-for-graph","title":"Bosonic Random Walk Networks for Graph Learning","date":"2020-12-31","arxiv_id":"2101.00082","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-air-quality-and-weather-prediction","title":"Joint Air Quality and Weather Prediction Based on Multi-Adversarial Spatiotemporal Networks","date":"2020-12-30","arxiv_id":"2012.15037","repositories_listed":0,"syntology":null},{"url":null,"slug":"product-graph-learning-from-multi-domain-data","title":"Product Graph Learning from Multi-domain Data with Sparsity and Rank Constraints","date":"2020-12-15","arxiv_id":"2012.08090","repositories_listed":0,"syntology":null},{"url":null,"slug":"distance-wise-graph-contrastive-learning","title":"Rethinking the Promotion Brought by Contrastive Learning to Semi-Supervised Node Classification","date":"2020-12-14","arxiv_id":"2012.07437","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-source-data-driven-outage-location-in","title":"Multi-Source Data Fusion Outage Location in Distribution Systems via Probabilistic Graph Models","date":"2020-12-04","arxiv_id":"2012.02877","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-adversarially-robust","title":"Unsupervised Adversarially-Robust Representation Learning on Graphs","date":"2020-12-04","arxiv_id":"2012.02486","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-attacks-on-deep-graph-matching","title":"Adversarial Attacks on Deep Graph Matching","date":"2020-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"nonconvex-sparse-graph-learning-under","title":"Nonconvex Sparse Graph Learning under Laplacian Constrained Graphical Model","date":"2020-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-heterogeneous-graph-embedding","title":"A Survey on Heterogeneous Graph Embedding: Methods, Techniques, Applications and Sources","date":"2020-11-30","arxiv_id":"2011.14867","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-view-sensor-fusion-by-integrating-model","title":"Multi-view Sensor Fusion by Integrating Model-based Estimation and Graph Learning for Collaborative Object Localization","date":"2020-11-16","arxiv_id":"2011.07704","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-predictions-of-multi-modal-ride-hailing","title":"Joint predictions of multi-modal ride-hailing demands: a deep multi-task multigraph learning-based approach","date":"2020-11-11","arxiv_id":"2011.05602","repositories_listed":0,"syntology":null},{"url":null,"slug":"node-centric-graph-learning-from-data-for","title":"Node-Centric Graph Learning from Data for Brain State Identification","date":"2020-11-04","arxiv_id":"2011.02179","repositories_listed":0,"syntology":null},{"url":"/paper/relational-graph-learning-on-visual-and","slug":"relational-graph-learning-on-visual-and","title":"Relational Graph Learning on Visual and Kinematics Embeddings for Accurate Gesture Recognition in Robotic Surgery","date":"2020-11-03","arxiv_id":"2011.01619","repositories_listed":0,"syntology":null},{"url":null,"slug":"learn-to-cross-lingual-transfer-with-meta","title":"Learn to Cross-lingual Transfer with Meta Graph Learning Across Heterogeneous Languages","date":"2020-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"figlearn-filter-and-graph-learning-using","title":"FiGLearn: Filter and Graph Learning using Optimal Transport","date":"2020-10-29","arxiv_id":"2010.15457","repositories_listed":0,"syntology":null},{"url":null,"slug":"multilayer-clustered-graph-learning","title":"Multilayer Clustered Graph Learning","date":"2020-10-29","arxiv_id":"2010.15456","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-simple-spectral-failure-mode-for-graph","title":"A Simple Spectral Failure Mode for Graph Convolutional Networks","date":"2020-10-25","arxiv_id":"2010.13152","repositories_listed":0,"syntology":null},{"url":null,"slug":"co-embedding-of-nodes-and-edges-with-graph","title":"Co-embedding of Nodes and Edges with Graph Neural Networks","date":"2020-10-25","arxiv_id":"2010.13242","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-sparse-graph-laplacian-with-k","title":"Learning Sparse Graph Laplacian with K Eigenvector Prior via Iterative GLASSO and Projection","date":"2020-10-25","arxiv_id":"2010.13179","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-learning-for-clustering-multi-view-data","title":"Learning Multi-layer Graphs and a Common Representation for Clustering","date":"2020-10-23","arxiv_id":"2010.12301","repositories_listed":0,"syntology":null},{"url":null,"slug":"iterative-graph-self-distillation-1","title":"Iterative Graph Self-Distillation","date":"2020-10-23","arxiv_id":"2010.12609","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-algorithms-for-graph-navigation","title":"Neural Algorithms for Graph Navigation","date":"2020-10-17","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-size-generalization-in-graph-neural-1","title":"From Local Structures to Size Generalization in Graph Neural Networks","date":"2020-10-17","arxiv_id":"2010.08853","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-driven-event-identification-using-deep","title":"Learning Latent Interactions for Event classification via Graph Neural Networks and PMU Data","date":"2020-10-04","arxiv_id":"2010.01616","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-graph-learning-instance-aware","title":"Dynamic Graph: Learning Instance-aware Connectivity for Neural Networks","date":"2020-10-02","arxiv_id":"2010.01097","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-level-graph-convolutional-network-with","title":"Multi-Level Graph Convolutional Network with Automatic Graph Learning for Hyperspectral Image Classification","date":"2020-09-19","arxiv_id":"2009.09196","repositories_listed":0,"syntology":null},{"url":null,"slug":"dual-constrained-deep-semi-supervised-coupled","title":"Dual-constrained Deep Semi-Supervised Coupled Factorization Network with Enriched Prior","date":"2020-09-08","arxiv_id":"2009.03714","repositories_listed":0,"syntology":null},{"url":null,"slug":"structured-graph-learning-for-clustering-and","title":"Structured Graph Learning for Clustering and Semi-supervised Classification","date":"2020-08-31","arxiv_id":"2008.13429","repositories_listed":0,"syntology":null},{"url":null,"slug":"offer-a-motif-dimensional-framework-for","title":"OFFER: A Motif Dimensional Framework for Network Representation Learning","date":"2020-08-27","arxiv_id":"2008.12010","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-embedding-for-combinatorial","title":"Graph Learning for Combinatorial Optimization: A Survey of State-of-the-Art","date":"2020-08-26","arxiv_id":"2008.12646","repositories_listed":0,"syntology":null},{"url":null,"slug":"sigl-securing-software-installations-through","title":"SIGL: Securing Software Installations Through Deep Graph Learning","date":"2020-08-26","arxiv_id":"2008.11533","repositories_listed":0,"syntology":null},{"url":null,"slug":"kernel-based-graph-learning-from-smooth","title":"Kernel-based Graph Learning from Smooth Signals: A Functional Viewpoint","date":"2020-08-23","arxiv_id":"2008.10065","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-domain-invariant-graph-for-adaptive","title":"Learning Domain-invariant Graph for Adaptive Semi-supervised Domain Adaptation with Few Labeled Source Samples","date":"2020-08-21","arxiv_id":"2008.09359","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":"concentration-bounds-for-co-occurrence","title":"A Matrix Chernoff Bound for Markov Chains and Its Application to Co-occurrence Matrices","date":"2020-08-06","arxiv_id":"2008.02464","repositories_listed":0,"syntology":null},{"url":null,"slug":"accuracy-and-stability-of-solar-variable","title":"Accuracy and stability of solar variable selection comparison under complicated dependence structures","date":"2020-07-30","arxiv_id":"2007.15614","repositories_listed":0,"syntology":null},{"url":null,"slug":"ultrahigh-dimensional-instrument-detection","title":"Instrument variable detection with graph learning : an application to high dimensional GIS-census data for house pricing","date":"2020-07-30","arxiv_id":"2007.15769","repositories_listed":0,"syntology":null},{"url":null,"slug":"grale-designing-networks-for-graph-learning","title":"Grale: Designing Networks for Graph Learning","date":"2020-07-23","arxiv_id":"2007.12002","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":"inverse-graph-identification-can-we-identify","title":"Inverse Graph Identification: Can We Identify Node Labels Given Graph Labels?","date":"2020-07-12","arxiv_id":"2007.05970","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-generative-graph-method-to-solve-the","title":"A Generative Graph Method to Solve the Travelling Salesman Problem","date":"2020-07-09","arxiv_id":"2007.04949","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-topology-inference-from-streaming","title":"Online Topology Inference from Streaming Stationary Graph Signals with Partial Connectivity Information","date":"2020-07-07","arxiv_id":"2007.03653","repositories_listed":0,"syntology":null},{"url":null,"slug":"hop-sampling-a-simple-regularized-graph","title":"Hop Sampling: A Simple Regularized Graph Learning for Non-Stationary Environments","date":"2020-06-26","arxiv_id":"2006.14897","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":"graph-learning-for-inverse-landscape-genetics","title":"Graph Learning for Inverse Landscape Genetics","date":"2020-06-22","arxiv_id":"2006.12334","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":"self-supervised-learning-generative-or","title":"Self-supervised Learning: Generative or Contrastive","date":"2020-06-15","arxiv_id":"2006.08218","repositories_listed":0,"syntology":null},{"url":null,"slug":"accurately-solving-physical-systems-with","title":"Accurately Solving Physical Systems with Graph Learning","date":"2020-06-06","arxiv_id":"2006.03897","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-learning-with-loss-guided-training","title":"Graph Learning with Loss-Guided Training","date":"2020-05-31","arxiv_id":"2006.00460","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-graph-learning-for-semi-supervised","title":"Deep graph learning for semi-supervised classification","date":"2020-05-29","arxiv_id":"2005.14403","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-stochastic-block-model-scalable","title":"Neural Stochastic Block Model & Scalable Community-Based Graph Learning","date":"2020-05-16","arxiv_id":"2005.07855","repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-and-unsupervised-representation","title":"Inductive and Unsupervised Representation Learning on Graph Structured Objects","date":"2020-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-learning-approaches-to-recommender","title":"Graph Learning Approaches to Recommender Systems: A Review","date":"2020-04-22","arxiv_id":"2004.11718","repositories_listed":0,"syntology":null},{"url":null,"slug":"mxpool-multiplex-pooling-for-hierarchical-1","title":"MxPool: Multiplex Pooling for Hierarchical Graph Representation Learning","date":"2020-04-15","arxiv_id":"2004.06846","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-domain-adaptation-for-alignment","title":"Graph Domain Adaptation for Alignment-Invariant Brain Surface Segmentation","date":"2020-03-31","arxiv_id":"2004.00074","repositories_listed":0,"syntology":null},{"url":null,"slug":"latent-patient-network-learning-for-automatic","title":"Latent-Graph Learning for Disease Prediction","date":"2020-03-27","arxiv_id":"2003.13620","repositories_listed":0,"syntology":null},{"url":null,"slug":"continual-graph-learning","title":"Overcoming Catastrophic Forgetting in Graph Neural Networks with Experience Replay","date":"2020-03-22","arxiv_id":"2003.09908","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-flexible-framework-for-large-graph-learning","title":"An Uncoupled Training Architecture for Large Graph Learning","date":"2020-03-21","arxiv_id":"2003.09638","repositories_listed":0,"syntology":null},{"url":null,"slug":"few-shot-graph-classification-with-model","title":"Adaptive-Step Graph Meta-Learner for Few-Shot Graph Classification","date":"2020-03-18","arxiv_id":"2003.08246","repositories_listed":0,"syntology":null},{"url":null,"slug":"3d-dynamic-point-cloud-denoising-via-spatial","title":"Dynamic Point Cloud Denoising via Manifold-to-Manifold Distance","date":"2020-03-17","arxiv_id":"2003.08355","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":"a-survey-on-the-expressive-power-of-graph","title":"A Survey on The Expressive Power of Graph Neural Networks","date":"2020-03-09","arxiv_id":"2003.04078","repositories_listed":0,"syntology":null}],"record_sha256":"3de0096bd4d07407cdbbd693e6b8a9ab9139ca5e41e6d1d836b216c6d46bb5e2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}