{"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-classification/papers/9","list_of":"/task/graph-classification","task":"Graph 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":9,"pages_in_order":10,"rows_per_page":100,"rows":[801,900],"of":927,"counts":{"archive_papers_tagged":927,"with_a_code_link":483,"where_syntology_ran_a_sample":174,"not_listed_spam_title":0,"listed":927,"listed_where_code_ran":174,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":150,"every_run_a_failure_of_syntologys_instrument":24,"listed_with_a_run_with_no_instrument_failure":150,"listed_every_run_a_failure_of_syntologys_instrument":24,"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-classification","prev":"/task/graph-classification/papers/8","next":"/task/graph-classification/papers/10","papers":[{"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":"topology-aware-graph-pooling-networks","title":"Topology-Aware Graph Pooling Networks","date":"2020-10-19","arxiv_id":"2010.09834","repositories_listed":0,"syntology":null},{"url":null,"slug":"k-plex-cover-pooling-for-graph-neural","title":"K-plex Cover Pooling for Graph Neural Networks","date":"2020-10-17","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multivariate-time-series-classification-with-1","title":"Multivariate Time Series Classification with Hierarchical Variational Graph Pooling","date":"2020-10-12","arxiv_id":"2010.05649","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-the-power-of-persistence-1","title":"Understanding the Power of Persistence Pairing via Permutation Test","date":"2020-10-10","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"uncertainty-matching-graph-neural-networks-to","title":"Uncertainty-Matching Graph Neural Networks to Defend Against Poisoning Attacks","date":"2020-09-30","arxiv_id":"2009.14455","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-graph-neural-networks-for-link","title":"Revisiting Graph Neural Networks for Link Prediction","date":"2020-09-28","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graphcrop-subgraph-cropping-for-graph","title":"GraphCrop: Subgraph Cropping for Graph Classification","date":"2020-09-22","arxiv_id":"2009.10564","repositories_listed":0,"syntology":null},{"url":null,"slug":"contrastive-self-supervised-learning-for-1","title":"Contrastive Self-supervised Learning for Graph Classification","date":"2020-09-13","arxiv_id":"2009.05923","repositories_listed":0,"syntology":null},{"url":null,"slug":"certified-robustness-of-graph-classification","title":"Certified Robustness of Graph Classification against Topology Attack with Randomized Smoothing","date":"2020-09-12","arxiv_id":"2009.05872","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-convolutional-neural-networks-with-node","title":"Graph Convolutional Neural Networks with Node Transition Probability-based Message Passing and DropNode Regularization","date":"2020-08-28","arxiv_id":"2008.12578","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":"cross-global-attention-graph-kernel-network","title":"Cross-Global Attention Graph Kernel Network Prediction of Drug Prescription","date":"2020-08-04","arxiv_id":"2008.01868","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-view-adaptive-graph-convolutions-for","title":"Multi-view adaptive graph convolutions for graph classification","date":"2020-07-24","arxiv_id":"2007.12450","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-neural-networks-with-haar-transform","title":"MathNet: Haar-Like Wavelet Multiresolution-Analysis for Graph Representation and Learning","date":"2020-07-22","arxiv_id":"2007.11202","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-hierarchical-graph-classification-with","title":"Robust Hierarchical Graph Classification with Subgraph Attention","date":"2020-07-19","arxiv_id":"2007.10908","repositories_listed":0,"syntology":null},{"url":null,"slug":"m-evolve-structural-mapping-based-data","title":"M-Evolve: Structural-Mapping-Based Data Augmentation for Graph Classification","date":"2020-07-11","arxiv_id":"2007.05700","repositories_listed":0,"syntology":null},{"url":null,"slug":"structural-landmarking-and-interaction","title":"Structural Landmarking and Interaction Modelling: on Resolution Dilemmas in Graph Classification","date":"2020-06-29","arxiv_id":"2006.15763","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-pooling-with-node-proximity-for","title":"Graph Pooling with Node Proximity for Hierarchical Representation Learning","date":"2020-06-19","arxiv_id":"2006.11118","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-aware-transformer-is-attention-all","title":"Graph-Aware Transformer: Is Attention All Graphs Need?","date":"2020-06-09","arxiv_id":"2006.05213","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-graph-representation-by","title":"Unsupervised Graph Representation by Periphery and Hierarchical Information Maximization","date":"2020-06-08","arxiv_id":"2006.04696","repositories_listed":0,"syntology":null},{"url":null,"slug":"simpool-towards-topology-based-graph-pooling","title":"SimPool: Towards Topology Based Graph Pooling with Structural Similarity Features","date":"2020-06-03","arxiv_id":"2006.02244","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":"non-iid-graph-neural-networks","title":"Customized Graph Neural Networks","date":"2020-05-22","arxiv_id":"2005.12386","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-hard-is-graph-isomorphism-for-graph","title":"How hard is to distinguish graphs with graph neural networks?","date":"2020-05-13","arxiv_id":"2005.06649","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-better-graph-representation-two","title":"Towards Better Graph Representation: Two-Branch Collaborative Graph Neural Networks for Multimodal Marketing Intention Detection","date":"2020-05-13","arxiv_id":"2005.08706","repositories_listed":0,"syntology":null},{"url":null,"slug":"ring-reservoir-neural-networks-for-graphs","title":"Ring Reservoir Neural Networks for Graphs","date":"2020-05-11","arxiv_id":"2005.05294","repositories_listed":0,"syntology":null},{"url":null,"slug":"mer-gcn-micro-expression-recognition-based-on","title":"MER-GCN: Micro Expression Recognition Based on Relation Modeling with Graph Convolutional Network","date":"2020-04-19","arxiv_id":"2004.08915","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":"pooling-in-graph-convolutional-neural","title":"Pooling in Graph Convolutional Neural Networks","date":"2020-04-07","arxiv_id":"2004.03519","repositories_listed":0,"syntology":null},{"url":null,"slug":"geometrically-principled-connections-in-graph","title":"Geometrically Principled Connections in Graph Neural Networks","date":"2020-04-06","arxiv_id":"2004.02658","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":"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":"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":"wasserstein-based-graph-alignment","title":"Wasserstein-based Graph Alignment","date":"2020-03-12","arxiv_id":"2003.06048","repositories_listed":0,"syntology":null},{"url":null,"slug":"ego-based-entropy-measures-for-structural","title":"Ego-based Entropy Measures for Structural Representations","date":"2020-03-01","arxiv_id":"2003.00553","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-end-to-end-graph-convolutional-kernel","title":"An End-to-End Graph Convolutional Kernel Support Vector Machine","date":"2020-02-29","arxiv_id":"2003.00226","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-attentional-autoencoder-for-anticancer","title":"Graph Attentional Autoencoder for Anticancer Hyperfood Prediction","date":"2020-01-16","arxiv_id":"2001.05724","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-the-power-of-persistence","title":"Understanding the Power of Persistence Pairing via Permutation Test","date":"2020-01-16","arxiv_id":"2001.06058","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-channel-graph-convolutional-networks","title":"Multi-Channel Graph Convolutional Networks","date":"2019-12-17","arxiv_id":"1912.08306","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":"coloring-graph-neural-networks-for-node-1","title":"Coloring graph neural networks for node disambiguation","date":"2019-12-12","arxiv_id":"1912.06058","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-hyperparameter-optimization-with","title":"Bayesian Hyperparameter Optimization with BoTorch, GPyTorch and Ax","date":"2019-12-11","arxiv_id":"1912.05686","repositories_listed":0,"syntology":null},{"url":null,"slug":"independence-promoted-graph-disentangled","title":"Independence Promoted Graph Disentangled Networks","date":"2019-11-26","arxiv_id":"1911.11430","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-global-alignment-graph-kernel-using","title":"Scalable Global Alignment Graph Kernel Using Random Features: From Node Embedding to Graph Embedding","date":"2019-11-25","arxiv_id":"1911.11119","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":"the-power-of-graph-convolutional-networks-to","title":"Fundamental Limits of Deep Graph Convolutional Networks","date":"2019-10-28","arxiv_id":"1910.12954","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":"deep-learning-for-molecular-graphs-with","title":"Deep Learning for Molecular Graphs with Tiered Graph Autoencoders and Graph Prediction","date":"2019-10-24","arxiv_id":"1910.11390","repositories_listed":0,"syntology":null},{"url":null,"slug":"temporal-graph-kernels-for-classifying","title":"Temporal Graph Kernels for Classifying Dissemination Processes","date":"2019-10-14","arxiv_id":"1911.05496","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-hist-graph-classification-from-latent","title":"Graph-Hist: Graph Classification from Latent Feature Histograms With Application to Bot Detection","date":"2019-10-02","arxiv_id":"1910.01180","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-preserving-grid-layout-a-simple-graph","title":"Graph-Preserving Grid Layout: A Simple Graph Drawing Method for Graph Classification using CNNs","date":"2019-09-26","arxiv_id":"1909.12383","repositories_listed":0,"syntology":null},{"url":null,"slug":"diagonal-graph-convolutional-networks-with","title":"Diagonal Graph Convolutional Networks with Adaptive Neighborhood Aggregation","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"empowering-graph-representation-learning-with","title":"Empowering Graph Representation Learning with Paired Training and Graph Co-Attention","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"haarpooling-graph-pooling-with-compressive-1","title":"HaarPooling: Graph Pooling with Compressive Haar Basis","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"how-can-we-generalise-learning-distributed","title":"How can we generalise learning distributed representations of graphs?","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"mincut-pooling-in-graph-neural-networks-1","title":"Mincut Pooling in Graph Neural Networks","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":"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":"topology-aware-pooling-via-graph-attention","title":"Topology-Aware Pooling via Graph Attention","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-hierarchical-graph","title":"Unsupervised Hierarchical Graph Representation Learning with Variational Bayes","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-universal-self-attention-network-1","title":"Unsupervised Universal Self-Attention Network for Graph Classification","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/a-non-negative-factorization-approach-to-node","slug":"a-non-negative-factorization-approach-to-node","title":"A Non-Negative Factorization approach to node pooling in Graph Convolutional Neural Networks","date":"2019-09-07","arxiv_id":"1909.03287","repositories_listed":0,"syntology":null},{"url":null,"slug":"near-neighborhood-edge-aggregator-for-graph","title":"NEAR: Neighborhood Edge AggregatoR for Graph Classification","date":"2019-09-06","arxiv_id":"1909.02746","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-weisfeiler-lehman-assignment-kernels-via","title":"Deep Weisfeiler-Lehman Assignment Kernels via Multiple Kernel Learning","date":"2019-08-19","arxiv_id":"1908.06661","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":"graph-neural-networks-for-small-graph-and","title":"Graph Neural Networks for Small Graph and Giant Network Representation Learning: An Overview","date":"2019-08-01","arxiv_id":"1908.00187","repositories_listed":0,"syntology":null},{"url":null,"slug":"topology-based-scalable-graph-kernels","title":"Topology Based Scalable Graph Kernels","date":"2019-07-15","arxiv_id":"1907.07129","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-supervised-graph-embedding-for-multi","title":"Semi-Supervised Graph Embedding for Multi-Label Graph Node Classification","date":"2019-07-12","arxiv_id":"1907.05743","repositories_listed":0,"syntology":null},{"url":null,"slug":"label-aware-graph-convolutional-network-not","title":"Label-Aware Graph Convolutional Networks","date":"2019-07-10","arxiv_id":"1907.04707","repositories_listed":0,"syntology":null},{"url":null,"slug":"ipool-information-based-pooling-in","title":"iPool -- Information-based Pooling in Hierarchical Graph Neural Networks","date":"2019-07-01","arxiv_id":"1907.00832","repositories_listed":0,"syntology":null},{"url":null,"slug":"attacking-graph-convolutional-networks-via","title":"Attacking Graph Convolutional Networks via Rewiring","date":"2019-06-10","arxiv_id":"1906.03750","repositories_listed":0,"syntology":null},{"url":null,"slug":"labeled-graph-generative-adversarial-networks","title":"Labeled Graph Generative Adversarial Networks","date":"2019-06-07","arxiv_id":"1906.03220","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploiting-edge-features-for-graph-neural","title":"Exploiting Edge Features for Graph Neural Networks","date":"2019-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"discriminative-structural-graph","title":"Discriminative structural graph classification","date":"2019-05-31","arxiv_id":"1905.13422","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-graph-compression-via-optimal","title":"Solving graph compression via optimal transport","date":"2019-05-29","arxiv_id":"1905.12158","repositories_listed":0,"syntology":null},{"url":"/paper/edge-contraction-pooling-for-graph-neural","slug":"edge-contraction-pooling-for-graph-neural","title":"Edge Contraction Pooling for Graph Neural Networks","date":"2019-05-27","arxiv_id":"1905.10990","repositories_listed":0,"syntology":null},{"url":"/paper/function-space-pooling-for-graph","slug":"function-space-pooling-for-graph","title":"Function Space Pooling For Graph Convolutional Networks","date":"2019-05-15","arxiv_id":"1905.06259","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-graph-classification-networks-datasets-and","title":"On Graph Classification Networks, Datasets and Baselines","date":"2019-05-12","arxiv_id":"1905.04682","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-graph-neural-networks-with-noisy","title":"Learning Graph Neural Networks with Noisy Labels","date":"2019-05-05","arxiv_id":"1905.01591","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-geometrical-graph-classification","title":"DEEP GEOMETRICAL GRAPH CLASSIFICATION","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-classification-with-geometric","title":"Graph Classification with Geometric Scattering","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-transformer","title":"Graph Transformer","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/graph-kernels-a-survey","slug":"graph-kernels-a-survey","title":"Graph Kernels: A Survey","date":"2019-04-27","arxiv_id":"1904.12218","repositories_listed":0,"syntology":null},{"url":"/paper/spi-gcn-a-simple-permutation-invariant-graph","slug":"spi-gcn-a-simple-permutation-invariant-graph","title":"SPI-GCN: A Simple Permutation-Invariant Graph Convolutional Network","date":"2019-04-08","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-aligned-spatial-graph-convolutional","title":"Learning Backtrackless Aligned-Spatial Graph Convolutional Networks for Graph Classification","date":"2019-04-06","arxiv_id":"1904.04238","repositories_listed":0,"syntology":null},{"url":"/paper/quantum-based-subgraph-convolutional-neural","slug":"quantum-based-subgraph-convolutional-neural","title":"Quantum-based subgraph convolutional neural networks","date":"2019-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-graph-kernels","title":"A Survey on Graph Kernels","date":"2019-03-28","arxiv_id":"1903.11835","repositories_listed":0,"syntology":null},{"url":"/paper/subgraph-networks-with-application-to","slug":"subgraph-networks-with-application-to","title":"Subgraph Networks with Application to Structural Feature Space Expansion","date":"2019-03-21","arxiv_id":"1903.09022","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-vertex-convolutional-networks-for","title":"Learning Vertex Convolutional Networks for Graph Classification","date":"2019-02-26","arxiv_id":"1902.09936","repositories_listed":0,"syntology":null},{"url":"/paper/capsule-neural-networks-for-graph","slug":"capsule-neural-networks-for-graph","title":"Capsule Neural Networks for Graph Classification using Explicit Tensorial Graph Representations","date":"2019-02-22","arxiv_id":"1902.08399","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-program-reidentification-a-graph-neural","title":"Attentional Heterogeneous Graph Neural Network: Application to Program Reidentification","date":"2018-12-10","arxiv_id":"1812.04064","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-based-security-and-privacy-analytics","title":"Graph-based Security and Privacy Analytics via Collective Classification with Joint Weight Learning and Propagation","date":"2018-12-04","arxiv_id":"1812.01661","repositories_listed":0,"syntology":null},{"url":"/paper/discriminative-graph-autoencoder","slug":"discriminative-graph-autoencoder","title":"Discriminative Graph Autoencoder","date":"2018-11-17","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/gaussian-induced-convolution-for-graphs","slug":"gaussian-induced-convolution-for-graphs","title":"Gaussian-Induced Convolution for Graphs","date":"2018-11-11","arxiv_id":"1811.04393","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-convolutional-neural-networks-via-motif","title":"Graph Convolutional Neural Networks via Motif-based Attention","date":"2018-11-11","arxiv_id":"1811.08270","repositories_listed":0,"syntology":null},{"url":null,"slug":"geometric-scattering-for-graph-data-analysis","title":"Geometric Scattering for Graph Data Analysis","date":"2018-10-07","arxiv_id":"1810.03068","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploiting-edge-features-in-graph-neural","title":"Exploiting Edge Features in Graph Neural Networks","date":"2018-09-07","arxiv_id":"1809.02709","repositories_listed":0,"syntology":null},{"url":null,"slug":"retgk-graph-kernels-based-on-return","title":"RetGK: Graph Kernels based on Return Probabilities of Random Walks","date":"2018-09-07","arxiv_id":"1809.02670","repositories_listed":0,"syntology":null}],"record_sha256":"896d9c26a63e00ea9d7121988e72957a839bf02bde4c3fd84689002636cb1c8f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}