paper-with-me

Papers Graph Classification

“Graph Classification” 태그가 달린 논문 1,024편 · 필터 해제

Global to Local: Topology-Preserving Adaptive Graph Pooling via Granular-Ball

2026-09-04 · Sen Zhao, Gaojie Xu, Shuyin Xia, Yifan Guan 외 arxiv

Graph pooling aims to compress the graph, including both node embeddings and their underlying topological patterns, into a more compact representation. Previous works focus primarily on the overly fine-grained representa…

Graph Classification

Physics-Aware Random Walk Fingerprints for Scalable Power Grid Graph Classification

2026-09-04 · Adnan Anwar arxiv

Recent benchmarks such as PowerGraph provide large collections of power-grid graphs for cascading-failure classification. Graph neural networks (GNNs) achieve strong predictive performance on this task, but typically req…

Graph Classification

Inductive Correlation Clustering with Graph Neural Networks

2026-08-27 · Francesco Paolo Nerini, Francesco Bonchi, Arijit Khan, André Panisson arxiv

Correlation Clustering (CC) is a natural formulation of clustering in combinatorial optimization, which uses a graph representation of the input and does not require a pre-specified number of clusters. Given $n$ objects …

Graph Classification

Boosting Data Augmentation with Stochastic Weight Averaging

2026-08-14 · Longde Huang, Axel Flinth, Jan E. Gerken arxiv

The symmetries of a learning task have become an important factor in designing modern deep learning solutions. Data augmentation is a straightforward and effective way of incorporating symmetries into a generic neural ne…

Graph ClassificationData Augmentation

HP-JEPA: Hierarchical Partitioning for Multi-Resolution Graph Joint-Embedding Predictive Learning

2026-08-01 · Ruichen Xu, Jingxiang Qu, Wenhan Gao, Jiaxing Zhang 외 arxiv

Graph self-supervised learning aims to learn transferable representations from large-scale unlabeled graph data. Joint-embedding predictive architectures (JEPAs) avoid explicit negative-pair construction and raw-input re…

Graph Representation LearningSelf-Supervised LearningGraph ClassificationGraph Regression

TopoFormer: Topology Meets Attention for Graph Learning

2026-07-30 · Md Joshem Uddin, Astrit Tola, Cuneyt Gurcan Akcora, Baris Coskunuzer arxiv

We introduce Topoformer, a lightweight and scalable framework for graph representation learning that encodes topological structure into attention-friendly sequences. At the core of our method is Topo-Scan, a novel module…

Molecular Property PredictionGraph Representation LearningGraph ClassificationGraph Learning

Towards Faithful Graph Explanations with Synergistic Edge Effects via Granular Balls

2026-07-23 · Jiancu Chen, Shuyin Xia, Guan Wang, Degang Chen 외 arxiv

Instance-level explanations aim to reveal the rationale behind a model's decisions for a specific graph. Previous methods explain graph neural networks (GNNs) by selecting important edges to induce subgraphs, where edge …

Graph Classification

EdgeRefine: Privacy-Utility Balance for Graphs via Jaccard Sampling under Edge Differential Privacy

2026-07-09 · Wenxiu Ding, Muzhi Liu, Zheng Yan, Mingjun Wang 외 arxiv

Graph Neural Networks (GNNs) have shown considerable success in learning from graph-structured data, but their use in privacy-sensitive areas remains difficult because graph structure can leak sensitive link information.…

Graph ClassificationNode ClassificationGraph Learning

Towards the Explainability of Temporal Graph Networks via Memory Backtracking and Topological Attribution

2026-07-04 · Yazheng Liu, Xi Zhang, Sihong Xie, Hui Xiong arxiv

Temporal graphs are ubiquitous in real-world applications and Temporal Graph Networks (TGNs) have achieved superior predictive accuracy. Understanding which historical events drive model predictions can enhance trustwort…

Node Property PredictionGraph ClassificationLink Prediction

Graph Neural Networks for the Graphical Bootstrap

2026-07-03 · Rigers Aliaj, Gabriele Dian, Reza Doobary, Paul Heslop arxiv

We study a graph classification problem involving over 20 million graphs, arising from high-order perturbative computations of correlators in planar $\mathcal{N}=4$ super-Yang--Mills, a model closely related to the theor…

Graph Classification

Graph Classification via Network Usable Information: From Representation Evaluation to Structure Selection

2026-07-03 · Abdullah Shaik, Anwar Said arxiv

We propose NetinfoGC, a framework for graph classification that extends the Network Usable Information (NUI) paradigm to graph-level learning. Unlike conventional graph neural network approaches that rely on end-to-end t…

Graph ClassificationGraph Neural Network

Learning Graphs through Continuous Information Entropy Fields

2026-06-22 · Hui Cong, Bo Sun, Ziheng Jiao, Yisheng An arxiv

Graph theory is inherently descriptive, capturing what relationships exist but not why they arise, because it treats edges as primitive constructs. This paper proposes a new explanatory framework for graph learning, wher…

Graph ClassificationNode ClassificationGraph Learning

A Completion-Aware Framework for Impactful Counterfactual Explainability in Graph Neural Networks

2026-06-20 · Maria Myrto Villia, Filippos Gouidis, Theodore Patkos, Panos Trahanias arxiv

In this study, we propose a novel pipeline for generic, model-agnostic, local-level counterfactual explainability in graph neural networks (GNNs). Although counterfactual explainers capable of both adding and removing ed…

Explanation GenerationGraph ClassificationLink Prediction

Controlled Dynamics Attractor Transformer

2026-06-13 · Cheng Zhang, Minnan Luo, Zesheng Yang, Ming Li 외 arxiv

Transformer architectures have dramatically advanced representation learning and inference in deep models through self-attention mechanisms. In parallel,associative memory (AM) frameworks map representations onto energy …

Representation LearningGraph Anomaly DetectionGraph Classification

PAC-Bayesian Adversarially Robust Generalization for Message Passing Graph Neural Networks: A Sensitivity Analysis

2026-06-04 · Ziling Liang, Xinping Yi, Qingsong Wen, Shi Jin arxiv

Whilst the vulnerability of graph neural networks (GNNs) to adversarial attacks poses a critical threat to graph representation learning, the understanding of the robust generalization behavior remains a fundamental chal…

Graph Representation LearningAdversarial RobustnessGraph Classification

Convex Distance Operator Transport: A Convex and Geometry-Preserving Formulation

2026-06-01 · Junhyoung Chung, Euijong Song, Won Hwa Kim, Gunwoong Park arxiv

We introduce Convex Distance Operator Transport (CDOT), the first convex optimal transport framework that aligns distributions across heterogeneous domains by jointly preserving feature correspondence and intrinsic geome…

Graph ClassificationPoint Clouds

AbstainGNN: Teaching Graph Neural Networks to Abstain for Graph Classification

2026-05-29 · Xixun Lin, Zhiheng Zhou, Zhengyin Zhang, Yancheng Chen 외 arxiv

Graph classification is a core task in graph data mining with widespread real-world applications. Recent advances in graph neural networks (GNNs) have led to substantial performance improvements for graph classification.…

Graph Classification

Can Subgraph Explanations Be Weaponized to Steal Graph Neural Networks?

2026-05-28 · Ojas Nimase, Jiate Li, Yue Zhao, Yushun Dong arxiv

Graph Machine Learning as a Service (GMLaaS) platforms increasingly implement explainability interfaces to meet regulatory transparency requirements. However, this transparency creates exploitable vulnerabilities for mod…

Graph ClassificationModel extraction

A Generalized Tikhonov Layer for Interpretable-by-design Graph Neural Networks

2026-05-27 · Nicolas Tremblay, Benjamin Ricaud, Filippo Maria Bianchi arxiv

We propose the Tikhonov layer, a graph neural network layer that is interpretable by design: once trained, its learned parameters directly reveal which node features and which aspects of the graph topology were leveraged…

Graph ClassificationGraph Neural Network

Distance-Matrix Wasserstein Statistics for Scalable Gromov--Wasserstein Learning

2026-05-14 · Ao Xu, Tieru Wu arxiv

Gromov--Wasserstein (GW) distances compare graphs, shapes, and point clouds through internal distances, without requiring a common coordinate system. This invariance is powerful, but discrete GW is a nonconvex quadratic …

Graph ClassificationTwo-sample testingPoint Clouds
1–20 / 1,024 다음 →