{"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/14","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":14,"pages_in_order":19,"rows_per_page":100,"rows":[1301,1400],"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/13","next":"/task/node-classification/papers/15","papers":[{"url":null,"slug":"automated-knowledge-modeling-for-cancer","title":"Automated Knowledge Modeling for Cancer Clinical Practice Guidelines","date":"2023-07-15","arxiv_id":"2307.10231","repositories_listed":0,"syntology":null},{"url":null,"slug":"supervised-attention-using-homophily-in-graph","title":"Supervised Attention Using Homophily in Graph Neural Networks","date":"2023-07-11","arxiv_id":"2307.05217","repositories_listed":0,"syntology":null},{"url":null,"slug":"hagnn-hybrid-aggregation-for-heterogeneous","title":"HAGNN: Hybrid Aggregation for Heterogeneous Graph Neural Networks","date":"2023-07-04","arxiv_id":"2307.01636","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-graph-classification-and-link","title":"A Survey on Graph Classification and Link Prediction based on GNN","date":"2023-07-03","arxiv_id":"2307.00865","repositories_listed":0,"syntology":null},{"url":null,"slug":"gpatcher-a-simple-and-adaptive-mlp-model-for","title":"GPatcher: A Simple and Adaptive MLP Model for Alleviating Graph Heterophily","date":"2023-06-25","arxiv_id":"2306.14340","repositories_listed":0,"syntology":null},{"url":null,"slug":"policyclustergcn-identifying-efficient","title":"PolicyClusterGCN: Identifying Efficient Clusters for Training Graph Convolutional Networks","date":"2023-06-25","arxiv_id":"2306.14357","repositories_listed":0,"syntology":null},{"url":null,"slug":"geometric-pooling-maintaining-more-useful","title":"Geometric Pooling: maintaining more useful information","date":"2023-06-21","arxiv_id":"2306.12341","repositories_listed":0,"syntology":null},{"url":null,"slug":"structure-aware-dropedge-towards-deep-graph","title":"Structure-Aware DropEdge Towards Deep Graph Convolutional Networks","date":"2023-06-21","arxiv_id":"2306.12091","repositories_listed":0,"syntology":null},{"url":null,"slug":"contrastive-disentangled-learning-on-graph","title":"Contrastive Disentangled Learning on Graph for Node Classification","date":"2023-06-20","arxiv_id":"2306.11344","repositories_listed":0,"syntology":null},{"url":null,"slug":"mixed-curvature-transformers-for-graph","title":"Mixed-Curvature Transformers for Graph Representation Learning papersreview","date":"2023-06-18","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"dual-node-and-edge-fairness-aware-graph","title":"Dual Node and Edge Fairness-Aware Graph Partition","date":"2023-06-16","arxiv_id":"2306.10123","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-unified-framework-of-graph-information","title":"A Unified Framework of Graph Information Bottleneck for Robustness and Membership Privacy","date":"2023-06-14","arxiv_id":"2306.08604","repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-linear-probing-for-few-shot-node","title":"Inductive Linear Probing for Few-shot Node Classification","date":"2023-06-14","arxiv_id":"2306.08192","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-on-graphs-under-label-noise","title":"Learning on Graphs under Label Noise","date":"2023-06-14","arxiv_id":"2306.08194","repositories_listed":0,"syntology":null},{"url":null,"slug":"uncertainty-aware-robust-learning-on-noisy","title":"Uncertainty-Aware Robust Learning on Noisy Graphs","date":"2023-06-14","arxiv_id":"2306.08210","repositories_listed":0,"syntology":null},{"url":null,"slug":"carl-g-clustering-accelerated-representation","title":"CARL-G: Clustering-Accelerated Representation Learning on Graphs","date":"2023-06-12","arxiv_id":"2306.06936","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-agent-network-empowering-nodes-with","title":"Graph Agent Network: Empowering Nodes with Inference Capabilities for Adversarial Resilience","date":"2023-06-12","arxiv_id":"2306.06909","repositories_listed":0,"syntology":null},{"url":null,"slug":"virtual-node-tuning-for-few-shot-node","title":"Virtual Node Tuning for Few-shot Node Classification","date":"2023-06-09","arxiv_id":"2306.06063","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-performance-discrepancies-across-local","title":"On Performance Discrepancies Across Local Homophily Levels in Graph Neural Networks","date":"2023-06-08","arxiv_id":"2306.05557","repositories_listed":0,"syntology":null},{"url":null,"slug":"dualhgnn-a-dual-hypergraph-neural-network-for","title":"DualHGNN: A Dual Hypergraph Neural Network for Semi-Supervised Node Classification based on Multi-View Learning and Density Awareness","date":"2023-06-07","arxiv_id":"2306.04214","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-and-effective-gnn-training-with","title":"Fast and Effective GNN Training with Linearized Random Spanning Trees","date":"2023-06-07","arxiv_id":"2306.04828","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-inference-in-contextual-stochastic","title":"Optimal Inference in Contextual Stochastic Block Models","date":"2023-06-06","arxiv_id":"2306.07948","repositories_listed":0,"syntology":null},{"url":null,"slug":"explaining-and-adapting-graph-conditional","title":"Explaining and Adapting Graph Conditional Shift","date":"2023-06-05","arxiv_id":"2306.03256","repositories_listed":0,"syntology":null},{"url":null,"slug":"renormalized-graph-neural-networks","title":"Renormalized Graph Representations for Node Classification","date":"2023-06-01","arxiv_id":"2306.00707","repositories_listed":0,"syntology":null},{"url":null,"slug":"spottarget-rethinking-the-effect-of-target","title":"Pitfalls in Link Prediction with Graph Neural Networks: Understanding the Impact of Target-link Inclusion & Better Practices","date":"2023-06-01","arxiv_id":"2306.00899","repositories_listed":0,"syntology":null},{"url":null,"slug":"bures-wasserstein-means-of-graphs","title":"Bures-Wasserstein Means of Graphs","date":"2023-05-31","arxiv_id":"2305.19738","repositories_listed":0,"syntology":null},{"url":null,"slug":"there-is-more-to-graphs-than-meets-the-eye","title":"There is more to graphs than meets the eye: Learning universal features with self-supervision","date":"2023-05-31","arxiv_id":"2305.19871","repositories_listed":0,"syntology":null},{"url":"/paper/self-attention-dual-embedding-for-graphs-with","slug":"self-attention-dual-embedding-for-graphs-with","title":"Self-attention Dual Embedding for Graphs with Heterophily","date":"2023-05-28","arxiv_id":"2305.18385","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-label-position-bias-in-graph-neural","title":"Towards Label Position Bias in Graph Neural Networks","date":"2023-05-25","arxiv_id":"2305.15822","repositories_listed":0,"syntology":null},{"url":null,"slug":"extracting-shopping-interest-related-product","title":"Extracting Shopping Interest-Related Product Types from the Web","date":"2023-05-23","arxiv_id":"2305.14549","repositories_listed":0,"syntology":null},{"url":null,"slug":"tokenized-graph-transformer-with-neighborhood","title":"Tokenized Graph Transformer with Neighborhood Augmentation for Node Classification in Large Graphs","date":"2023-05-22","arxiv_id":"2305.12677","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-explainable-graph-neural-networks-for","title":"Self-Explainable Graph Neural Networks for Link Prediction","date":"2023-05-21","arxiv_id":"2305.12578","repositories_listed":0,"syntology":null},{"url":null,"slug":"chainlet-orbits-topological-address-embedding","title":"Chainlet Orbits: Topological Address Embedding for the Bitcoin Blockchain","date":"2023-05-18","arxiv_id":"2306.07974","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimality-of-message-passing-architectures","title":"Optimality of Message-Passing Architectures for Sparse Graphs","date":"2023-05-17","arxiv_id":"2305.10391","repositories_listed":0,"syntology":null},{"url":null,"slug":"amgcl-feature-imputation-of-attribute-missing","title":"AmGCL: Feature Imputation of Attribute Missing Graph via Self-supervised Contrastive Learning","date":"2023-05-05","arxiv_id":"2305.03741","repositories_listed":0,"syntology":null},{"url":null,"slug":"zoo-guide-to-network-embedding","title":"Zoo Guide to Network Embedding","date":"2023-05-05","arxiv_id":"2305.03474","repositories_listed":0,"syntology":null},{"url":null,"slug":"imbalanced-node-classification-beyond","title":"Imbalanced Node Classification Beyond Homophilic Assumption","date":"2023-04-28","arxiv_id":"2304.14635","repositories_listed":0,"syntology":null},{"url":null,"slug":"generating-post-hoc-explanations-for-skip","title":"Generating Post-hoc Explanations for Skip-gram-based Node Embeddings by Identifying Important Nodes with Bridgeness","date":"2023-04-24","arxiv_id":"2304.12036","repositories_listed":0,"syntology":null},{"url":null,"slug":"meta-multigraph-search-rethinking-meta","title":"Meta-multigraph Search: Rethinking Meta-structure on Heterogeneous Information Networks","date":"2023-04-23","arxiv_id":"2304.11574","repositories_listed":0,"syntology":null},{"url":null,"slug":"detecting-political-opinions-in-tweets","title":"Detecting Political Opinions in Tweets through Bipartite Graph Analysis: A Skip Aggregation Graph Convolution Approach","date":"2023-04-22","arxiv_id":"2304.11367","repositories_listed":0,"syntology":null},{"url":null,"slug":"id-mixgcl-identity-mixup-for-graph","title":"ID-MixGCL: Identity Mixup for Graph Contrastive Learning","date":"2023-04-20","arxiv_id":"2304.10045","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributional-signals-for-node","title":"Distributional Signals for Node Classification in Graph Neural Networks","date":"2023-04-07","arxiv_id":"2304.03507","repositories_listed":0,"syntology":null},{"url":null,"slug":"fmgnn-fused-manifold-graph-neural-network","title":"FMGNN: Fused Manifold Graph Neural Network","date":"2023-04-03","arxiv_id":"2304.01081","repositories_listed":0,"syntology":null},{"url":null,"slug":"uncertainty-propagation-in-node","title":"Uncertainty Propagation in Node Classification","date":"2023-04-03","arxiv_id":"2304.00918","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-enhanced-graph-neural-networks","title":"Knowledge Enhanced Graph Neural Networks for Graph Completion","date":"2023-03-27","arxiv_id":"2303.15487","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairgat-fairness-aware-graph-attention","title":"FairGAT: Fairness-aware Graph Attention Networks","date":"2023-03-26","arxiv_id":"2303.14591","repositories_listed":0,"syntology":null},{"url":null,"slug":"structural-imbalance-aware-graph-augmentation","title":"Structural Imbalance Aware Graph Augmentation Learning","date":"2023-03-24","arxiv_id":"2303.13757","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairness-aware-graph-filter-design","title":"Fairness-Aware Graph Filter Design","date":"2023-03-20","arxiv_id":"2303.11459","repositories_listed":0,"syntology":null},{"url":null,"slug":"gann-graph-alignment-neural-network-for-semi","title":"GANN: Graph Alignment Neural Network for Semi-Supervised Learning","date":"2023-03-14","arxiv_id":"2303.07778","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-transformer-gans-for-graph-constrained","title":"Graph Transformer GANs for Graph-Constrained House Generation","date":"2023-03-14","arxiv_id":"2303.08225","repositories_listed":0,"syntology":null},{"url":null,"slug":"space-invariant-projection-in-streaming","title":"Space-Invariant Projection in Streaming Network Embedding","date":"2023-03-11","arxiv_id":"2303.06293","repositories_listed":0,"syntology":null},{"url":null,"slug":"chgnn-a-semi-supervised-contrastive","title":"CHGNN: A Semi-Supervised Contrastive Hypergraph Learning Network","date":"2023-03-10","arxiv_id":"2303.06213","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-positional-encoding-via-random-feature","title":"Graph Positional Encoding via Random Feature Propagation","date":"2023-03-06","arxiv_id":"2303.02918","repositories_listed":0,"syntology":null},{"url":null,"slug":"node-specific-space-selection-via-localized","title":"Node-Specific Space Selection via Localized Geometric Hyperbolicity in Graph Neural Networks","date":"2023-03-03","arxiv_id":"2303.01724","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-semantic-backdoor-attack-against-graph","title":"A semantic backdoor attack against Graph Convolutional Networks","date":"2023-02-28","arxiv_id":"2302.14353","repositories_listed":0,"syntology":null},{"url":null,"slug":"framelet-message-passing","title":"Framelet Message Passing","date":"2023-02-28","arxiv_id":"2302.14806","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphsr-a-data-augmentation-algorithm-for","title":"GraphSR: A Data Augmentation Algorithm for Imbalanced Node Classification","date":"2023-02-24","arxiv_id":"2302.12814","repositories_listed":0,"syntology":null},{"url":null,"slug":"diffusion-probabilistic-models-for-structured-1","title":"Diffusion Probabilistic Models for Structured Node Classification","date":"2023-02-21","arxiv_id":"2302.10506","repositories_listed":0,"syntology":null},{"url":null,"slug":"finding-heterophilic-neighbors-via-confidence","title":"Finding Heterophilic Neighbors via Confidence-based Subgraph Matching for Semi-supervised Node Classification","date":"2023-02-20","arxiv_id":"2302.09755","repositories_listed":0,"syntology":null},{"url":null,"slug":"building-shortcuts-between-distant-nodes-with","title":"Building Shortcuts between Distant Nodes with Biaffine Mapping for Graph Convolutional Networks","date":"2023-02-17","arxiv_id":"2302.08727","repositories_listed":0,"syntology":null},{"url":null,"slug":"heterophily-aware-graph-attention-network","title":"Heterophily-Aware Graph Attention Network","date":"2023-02-07","arxiv_id":"2302.03228","repositories_listed":0,"syntology":null},{"url":null,"slug":"bi-level-multi-objective-evolutionary","title":"Bi-level Multi-objective Evolutionary Learning: A Case Study on Multi-task Graph Neural Topology Search","date":"2023-02-06","arxiv_id":"2302.02565","repositories_listed":0,"syntology":null},{"url":null,"slug":"collective-robustness-certificates-exploiting","title":"Collective Robustness Certificates: Exploiting Interdependence in Graph Neural Networks","date":"2023-02-06","arxiv_id":"2302.02829","repositories_listed":0,"syntology":null},{"url":null,"slug":"simple-yet-effective-gradient-free-graph","title":"Simple yet Effective Gradient-Free Graph Convolutional Networks","date":"2023-02-01","arxiv_id":"2302.00371","repositories_listed":0,"syntology":null},{"url":null,"slug":"kg-hub-building-and-exchanging-biological","title":"KG-Hub -- Building and Exchanging Biological Knowledge Graphs","date":"2023-01-31","arxiv_id":"2302.10800","repositories_listed":0,"syntology":null},{"url":null,"slug":"orthoreg-improving-graph-regularized-mlps-via","title":"OrthoReg: Improving Graph-regularized MLPs via Orthogonality Regularization","date":"2023-01-31","arxiv_id":"2302.00109","repositories_listed":0,"syntology":null},{"url":null,"slug":"splitgnn-splitting-gnn-for-node","title":"SplitGNN: Splitting GNN for Node Classification with Heterogeneous Attention","date":"2023-01-27","arxiv_id":"2301.12885","repositories_listed":0,"syntology":null},{"url":null,"slug":"federated-learning-over-coupled-graphs","title":"Federated Learning over Coupled Graphs","date":"2023-01-26","arxiv_id":"2301.11099","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-neural-tangent-kernel-convergence-on","title":"Graph Neural Tangent Kernel: Convergence on Large Graphs","date":"2023-01-25","arxiv_id":"2301.10808","repositories_listed":0,"syntology":null},{"url":null,"slug":"determinate-node-selection-for-semi","title":"Determinate Node Selection for Semi-supervised Classification Oriented Graph Convolutional Networks","date":"2023-01-11","arxiv_id":"2301.04381","repositories_listed":0,"syntology":null},{"url":null,"slug":"weakly-supervised-joint-whole-slide","title":"Weakly Supervised Joint Whole-Slide Segmentation and Classification in Prostate Cancer","date":"2023-01-07","arxiv_id":"2301.02933","repositories_listed":0,"syntology":null},{"url":null,"slug":"guap-graph-universal-attack-through","title":"GUAP: Graph Universal Attack Through Adversarial Patching","date":"2023-01-04","arxiv_id":"2301.01731","repositories_listed":0,"syntology":null},{"url":null,"slug":"ganexplainer-gan-based-graph-neural-networks","title":"GANExplainer: GAN-based Graph Neural Networks Explainer","date":"2022-12-30","arxiv_id":"2301.00012","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hypergraph-neural-network-framework-for","title":"A Hypergraph Neural Network Framework for Learning Hyperedge-Dependent Node Embeddings","date":"2022-12-28","arxiv_id":"2212.14077","repositories_listed":0,"syntology":null},{"url":null,"slug":"personasage-a-multi-persona-graph-neural","title":"PersonaSAGE: A Multi-Persona Graph Neural Network","date":"2022-12-28","arxiv_id":"2212.13709","repositories_listed":0,"syntology":null},{"url":null,"slug":"2-hop-neighbor-class-similarity-2ncs-a-graph","title":"2-hop Neighbor Class Similarity (2NCS): A graph structural metric indicative of graph neural network performance","date":"2022-12-26","arxiv_id":"2212.13202","repositories_listed":0,"syntology":null},{"url":null,"slug":"refined-edge-usage-of-graph-neural-networks","title":"Refined Edge Usage of Graph Neural Networks for Edge Prediction","date":"2022-12-25","arxiv_id":"2212.12970","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-duplicated-characterization-of-graph","title":"Multi-duplicated Characterization of Graph Structures using Information Gain Ratio for Graph Neural Networks","date":"2022-12-24","arxiv_id":"2212.12691","repositories_listed":0,"syntology":null},{"url":null,"slug":"complete-the-missing-half-augmenting-1","title":"Complete the Missing Half: Augmenting Aggregation Filtering with Diversification for Graph Convolutional Neural Networks","date":"2022-12-21","arxiv_id":"2212.10822","repositories_listed":0,"syntology":null},{"url":null,"slug":"leave-graphs-alone-addressing-over-squashing","title":"Leave Graphs Alone: Addressing Over-Squashing without Rewiring","date":"2022-12-13","arxiv_id":"2212.06538","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-learning-for-anomaly-analytics","title":"Graph Learning for Anomaly Analytics: Algorithms, Applications, and Challenges","date":"2022-12-11","arxiv_id":"2212.05532","repositories_listed":0,"syntology":null},{"url":null,"slug":"alleviating-neighbor-bias-augmenting-graph","title":"Alleviating neighbor bias: augmenting graph self-supervise learning with structural equivalent positive samples","date":"2022-12-08","arxiv_id":"2212.04365","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-temporal-graph-neural-network-for-cyber","title":"A Temporal Graph Neural Network for Cyber Attack Detection and Localization in Smart Grids","date":"2022-12-07","arxiv_id":"2212.03390","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-graph-node-classification-via-time","title":"Dynamic Graph Node Classification via Time Augmentation","date":"2022-12-07","arxiv_id":"2212.03449","repositories_listed":0,"syntology":null},{"url":null,"slug":"semantic-graph-neural-network-with-multi","title":"Semantic Graph Neural Network with Multi-measure Learning for Semi-supervised Classification","date":"2022-12-04","arxiv_id":"2212.01749","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-model-selection-for-graph-neural","title":"Hierarchical Model Selection for Graph Neural Netoworks","date":"2022-12-01","arxiv_id":"2212.00898","repositories_listed":0,"syntology":null},{"url":null,"slug":"every-node-counts-improving-the-training-of","title":"Every Node Counts: Improving the Training of Graph Neural Networks on Node Classification","date":"2022-11-29","arxiv_id":"2211.16631","repositories_listed":0,"syntology":null},{"url":null,"slug":"text-representation-enrichment-utilizing","title":"Text Representation Enrichment Utilizing Graph based Approaches: Stock Market Technical Analysis Case Study","date":"2022-11-29","arxiv_id":"2211.16103","repositories_listed":0,"syntology":null},{"url":null,"slug":"flip-initial-features-generalization-of","title":"Mitigating Overfitting in Graph Neural Networks via Feature and Hyperplane Perturbation","date":"2022-11-28","arxiv_id":"2211.15081","repositories_listed":0,"syntology":null},{"url":null,"slug":"differentiable-meta-multigraph-search-with","title":"Differentiable Meta Multigraph Search with Partial Message Propagation on Heterogeneous Information Networks","date":"2022-11-27","arxiv_id":"2211.14752","repositories_listed":0,"syntology":null},{"url":null,"slug":"regrat-regularization-in-graphs-using","title":"ReGrAt: Regularization in Graphs using Attention to handle class imbalance","date":"2022-11-27","arxiv_id":"2211.14770","repositories_listed":0,"syntology":null},{"url":"/paper/enhancing-intra-class-information-extraction","slug":"enhancing-intra-class-information-extraction","title":"Enhancing Intra-class Information Extraction for Heterophilous Graphs: One Neural Architecture Search Approach","date":"2022-11-20","arxiv_id":"2211.10990","repositories_listed":0,"syntology":null},{"url":null,"slug":"neighborhood-convolutional-network-a-new","title":"Neighborhood Convolutional Network: A New Paradigm of Graph Neural Networks for Node Classification","date":"2022-11-15","arxiv_id":"2211.07845","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-heterophily-in-graph-convolution","title":"Revisiting Heterophily in Graph Convolution Networks by Learning Representations Across Topological and Feature Spaces","date":"2022-11-01","arxiv_id":"2211.00565","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-simple-hypergraph-kernel-convolution-based","title":"A Simple Hypergraph Kernel Convolution based on Discounted Markov Diffusion Process","date":"2022-10-30","arxiv_id":"2210.16884","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-heuristics-for-the-maximum-clique","title":"Learning Heuristics for the Maximum Clique Enumeration Problem Using Low Dimensional Representations","date":"2022-10-30","arxiv_id":"2210.16963","repositories_listed":0,"syntology":null},{"url":null,"slug":"when-do-we-need-gnn-for-node-classification","title":"When Do We Need Graph Neural Networks for Node Classification?","date":"2022-10-30","arxiv_id":"2210.16979","repositories_listed":0,"syntology":null},{"url":null,"slug":"localized-randomized-smoothing-for-collective-1","title":"Localized Randomized Smoothing for Collective Robustness Certification","date":"2022-10-28","arxiv_id":"2210.16140","repositories_listed":0,"syntology":null},{"url":"/paper/beyond-homophily-with-graph-echo-state-1","slug":"beyond-homophily-with-graph-echo-state-1","title":"Beyond Homophily with Graph Echo State Networks","date":"2022-10-27","arxiv_id":"2210.15731","repositories_listed":0,"syntology":null},{"url":null,"slug":"focusedcleaner-sanitizing-poisoned-graphs-for","title":"FocusedCleaner: Sanitizing Poisoned Graphs for Robust GNN-based Node Classification","date":"2022-10-25","arxiv_id":"2210.13815","repositories_listed":0,"syntology":null}],"record_sha256":"0a802969830e7c5e584c8dea46954667b5338dbd21684177ba430106df7908e1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}