arXiv AI By Mengyao Zhou, Zhiheng Zhou, Xiao Han, Guiying Yan

Towards Trustworthy Hypergraph Neural Networks under Label Noise

Read the original on arXiv AI →

arXiv:2608. 04377v1 Announce Type: cross Abstract: Hypergraph neural networks (HGNNs) have demonstrated remarkable capabilities in processing complex higher-order relationships.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Sep 7

Hyperedge Anomaly Detection with Hypergraph Neural Network

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 Machine Learning
Sep 21

Particle Competition and Cooperation for Robust Graph Convolutional Network Learning Under Label Noise

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