arXiv:2601. 17469v2 Announce Type: replace Abstract: Graph Neural Networks (GNNs) have shown remarkable capabilities in learning from graph-structured data with various applications such as social analysis and bioinformatics.
By Wei Ju, Wei Zhang, Siyu Yi, Zhengyang Mao, Yifan Wang, Jingyang Yuan, Zhiping Xiao, Ziyue Qiao, Ming Zhang
The paper introduces an unsupervised hypergraph neural network designed to detect anomalous hyperedges—higher-order associations that deviate from typical patterns. Unlike conventional graph methods that capture only pairwise relationships, this approach leverages hypergraphs to model associations among any number of entities. Experiments on real-life datasets show the model effectively identifies unusual hyperedges without requiring labeled data.
By Md. Tanvir Alam, Md. Mahmudur Rahman, Md. Fahim Arefin, Chowdhury Farhan Ahmed, Zisan Mahmud, Md. Sadman Sakib, Carson K. Leung
arXiv:2608. 15055v1 Announce Type: new Abstract: Hypergraphs effectively model higher-order groupwise relationships beyond pairwise interactions, while pretrained language models (PLMs) and large language models (LLMs) provide rich semantic understanding from textual attributes.
By David Yoon Suk Kang, JungHyun Kim, Juhyun Jeon, Sang-Wook Kim
Particle Competition and Cooperation for Robust Graph Convolutional Network Learning Under Label Noise proposes PCC+GCN, a hybrid framework that refines labels using Particle Competition and Cooperation before training a GCN. PCC identifies suspicious nodes via particle domination dynamics and decides whether to keep, remove, or reassign their labels, optionally augmenting the graph with k‑nearest‑neighbor edges. Evaluated on ten NoisyGL datasets under various noise types, PCC+GCN achieved the highest average accuracy and rank, outperforming baseline GCN by 1.67 percentage points and proving computationally efficient, especially under instance‑dependent noise.
By Fabricio Breve
arXiv:2606. 09051v1 Announce Type: new Abstract: Convolutions have successfully transitioned from image processing to the complex realm of non-Euclidean higher-order domains, particularly in hypergraphs.
By Fuli Wang, Wei Qian, Daniel L. Lau, Gonzalo R. Arce
arXiv:2406.04805v4 Announce Type: replace-cross
Abstract: The rapid adoption, usefulness, and resource-intensive training of Graph Neural Network (GNN) models have made them an invaluable intellectua...
By Venkata Sai Pranav Bachina, Aaryan Ajay Sharma, Ankit Gangwal, Charu Sharma
arXiv:2606. 08467v1 Announce Type: cross Abstract: While confidence calibration is essential for trustworthy decision-making in safety-critical applications, the robustness of calibrated GNNs to adversarial structural perturbations remains largely unexplored.
By Cuong Dang, Jiahao Zhang, Hieu Ta Quang, Dung Le, Lu Cheng, Suhang Wang
The paper reinterprets graph neural networks (GNNs) as retrieval-augmented models, where each layer uses an MLP on a node representation and a permutation‑invariant summary of retrieved graph context instead of traditional message passing. It introduces RTA, a lightweight MLP‑based framework that replaces structural message passing with label‑aware retrieval and propagation, and provides theoretical links to softmax‑attention message passing and robustness to mis‑retrieved outliers. Experiments on text‑attributed graph benchmarks demonstrate that RTA matches or surpasses strong GNN and graph LLM baselines while improving efficiency and robustness.
By Jintang Li, Yuhong Chen, Ruofan Wu, Binli Luo, Jiayi Ji, Hui Li, Rongrong Ji
The paper introduces DeGLIF, a denoising method for graph data that leverages a leave‑one‑out influence function to make node‑level predictions robust to label noise. DeGLIF uses a small clean subset and a theoretically motivated relabelling function to identify and correct noisy nodes without requiring knowledge of the noise model or level. Two variants of DeGLIF are proposed, one of which is proven to increase risk for detected noisy points, and experiments demonstrate that DeGLIF outperforms baseline algorithms on several datasets.
By Pintu Kumar, Nandyala Hemachandra
arXiv:2502. 01272v3 Announce Type: replace Abstract: Graph Neural Networks (GNNs) have achieved notable success in tasks such as social and transportation networks.
By Chang Liu, Hai Huang, Yujie Xing, Xingquan Zuo
Credit risk detection, particularly mitigating individual fraud, is crucial for maintaining the stability of digital financial ecosystems. Accurately identifying credit fraud among billions of users is critical for minimizing financial losses and safeguarding the sustainability of inclusive financial services.
arXiv:2608. 02168v1 Announce Type: new Abstract: Credit risk detection, particularly mitigating individual fraud, is crucial for maintaining the stability of digital financial ecosystems.
By Xin Liu, Xiyuan Chen, Chenglong Wu, Xuan Zong, Jun Zhou, Dawei Cheng