arXiv Machine Learning

MDTE: Minority-Aware Diffusion over Temporal Edge Events for Imbalanced Node Classification

arXiv AI
Sep 16

GraphIFE: Rethinking Graph Imbalance Node Classification via Invariant Learning

GraphIFE addresses the class imbalance problem in graph-structured data by tackling a quality inconsistency issue in synthesized nodes. The framework uses graph invariant learning to strengthen embedding space representations and identify invariant features, leading to improved performance on minority classes. Experiments show that GraphIFE consistently outperforms various baselines across multiple datasets.

By Fanlong Zeng, Wensheng Gan, Kangjie Chen, Philip S. Yu
arXiv Machine Learning
Oct 7

Hub for Outliers, Spokes for Inliers: Uniform Latent Space Construction for Dual-Mismatched Semi-Supervised Learning

The paper introduces a hub‑spoke latent space design for dual‑mismatched semi‑supervised learning, where known classes are uniformly arranged around a central hub and each class forms a compact cluster around its prototype. The hub serves as an anchor for a low‑evidence region that captures high‑uncertainty unknown class samples, thereby reducing majority‑class domination and improving feature discriminability. Experiments demonstrate that this approach outperforms state‑of‑the‑art methods, achieving up to a 3.25% improvement across various settings.

By Li Yuan, Yaxin Hou, Jiawei Tang, Yongbiao Gao, Yuheng Jia
arXiv Machine Learning
Jul 31

ARES: Anomaly Recognition Model For Edge Streams

arXiv:2511. 22078v2 Announce Type: replace Abstract: Many real-world scenarios involving streaming information can be represented as temporal graphs, where data flows through dynamic changes in edges over time.

By Simone Mungari, Albert Bifet, Giuseppe Manco, Bernhard Pfahringer
arXiv Machine Learning
Oct 5

Differentiable Koopman Operator for Contrastive Learning on Dynamic Graphs

The paper introduces KAIROS, a self‑supervised framework that embeds a differentiable Koopman operator into a dynamic graph contrastive learning loop. By linearizing temporal evolution in the embedding space, KAIROS jointly optimizes raw node features and a graph‑diffused structural view using multi‑granularity contrastive objectives across time windows. For anomaly detection, it combines Koopman prediction residuals with temporal inconsistency and local neighborhood deviation, achieving state‑of‑the‑art results on nine dynamic graph benchmarks and competitive performance on unsupervised node classification.

By Md Abrar Jahin, Taufikur Rahman Fuad, Md Rizwan Parvez
arXiv AI
3d ago

Towards Generalist Graph-Level Anomaly Detection

The paper introduces GenGLAD, a generalist graph-level anomaly detection framework that learns transferable anomaly knowledge across diverse domains using discriminative subgraph extraction. It employs a graph neural network to identify anomaly-discriminative substructures and adapts to new domains at test time by evaluating multi-dimensional discrepancies between subgraphs and contextual information. Experiments on varied benchmarks show GenGLAD outperforms existing methods in performance, generalization, and data efficiency.

By Junjun Pan, Yixin Liu, Yu Zheng, Fuyi Li, Alan Wee-Chung Liew, Shirui Pan