Search Results for author: Kay Liu

Found 12 papers, 8 papers with code

TGTOD: A Global Temporal Graph Transformer for Outlier Detection at Scale

1 code implementation1 Dec 2024 Kay Liu, Jiahao Ding, MohamadAli Torkamani, Philip S. Yu

While Transformers have revolutionized machine learning on various data, existing Transformers for temporal graphs face limitations in (1) restricted receptive fields, (2) overhead of subgraph extraction, and (3) suboptimal generalization capability beyond link prediction.

LEGO-Learn: Label-Efficient Graph Open-Set Learning

no code implementations21 Oct 2024 Haoyan Xu, Kay Liu, Zhengtao Yao, Philip S. Yu, Kaize Ding, Yue Zhao

Graph open-set learning (GOL) and out-of-distribution (OOD) detection aim to address this challenge by training models that can accurately classify known, in-distribution (ID) classes while identifying and handling previously unseen classes during inference.

Node Classification Open Set Learning +1

BANGS: Game-Theoretic Node Selection for Graph Self-Training

1 code implementation12 Oct 2024 Fangxin Wang, Kay Liu, Sourav Medya, Philip S. Yu

Graph self-training is a semi-supervised learning method that iteratively selects a set of unlabeled data to retrain the underlying graph neural network (GNN) model and improve its prediction performance.

Graph Neural Network

Enhancing Fairness in Unsupervised Graph Anomaly Detection through Disentanglement

1 code implementation3 Jun 2024 Wenjing Chang, Kay Liu, Philip S. Yu, Jianjun Yu

Graph anomaly detection (GAD) is increasingly crucial in various applications, ranging from financial fraud detection to fake news detection.

Decision Making Disentanglement +5

Uncertainty in Graph Neural Networks: A Survey

no code implementations11 Mar 2024 Fangxin Wang, Yuqing Liu, Kay Liu, Yibo Wang, Sourav Medya, Philip S. Yu

Therefore, identifying, quantifying, and utilizing uncertainty are essential to enhance the performance of the model for the downstream tasks as well as the reliability of the GNN predictions.

Graph Learning Survey

Overcoming Pitfalls in Graph Contrastive Learning Evaluation: Toward Comprehensive Benchmarks

no code implementations24 Feb 2024 Qian Ma, Hongliang Chi, Hengrui Zhang, Kay Liu, Zhiwei Zhang, Lu Cheng, Suhang Wang, Philip S. Yu, Yao Ma

The rise of self-supervised learning, which operates without the need for labeled data, has garnered significant interest within the graph learning community.

Contrastive Learning Graph Learning +1

Confidence-aware Fine-tuning of Sequential Recommendation Systems via Conformal Prediction

no code implementations14 Feb 2024 Chen Wang, Fangxin Wang, Ruocheng Guo, Yueqing Liang, Kay Liu, Philip S. Yu

Recognizing the critical role of confidence in aligning training objectives with evaluation metrics, we propose CPFT, a versatile framework that enhances recommendation confidence by integrating Conformal Prediction (CP)-based losses with CE loss during fine-tuning.

Conformal Prediction Model Selection +1

Multitask Active Learning for Graph Anomaly Detection

1 code implementation24 Jan 2024 Wenjing Chang, Kay Liu, Kaize Ding, Philip S. Yu, Jianjun Yu

Firstly, by coupling node classification tasks, MITIGATE obtains the capability to detect out-of-distribution nodes without known anomalies.

Active Learning Graph Anomaly Detection +2

Data Augmentation for Supervised Graph Outlier Detection via Latent Diffusion Models

1 code implementation29 Dec 2023 Kay Liu, Hengrui Zhang, Ziqing Hu, Fangxin Wang, Philip S. Yu

To bridge this gap, we introduce GODM, a novel data augmentation for mitigating class imbalance in supervised Graph Outlier detection via latent Diffusion Models.

Data Augmentation Denoising +1

BOND: Benchmarking Unsupervised Outlier Node Detection on Static Attributed Graphs

2 code implementations21 Jun 2022 Kay Liu, Yingtong Dou, Yue Zhao, Xueying Ding, Xiyang Hu, Ruitong Zhang, Kaize Ding, Canyu Chen, Hao Peng, Kai Shu, Lichao Sun, Jundong Li, George H. Chen, Zhihao Jia, Philip S. Yu

To bridge this gap, we present--to the best of our knowledge--the first comprehensive benchmark for unsupervised outlier node detection on static attributed graphs called BOND, with the following highlights.

Anomaly Detection Benchmarking +2

Cannot find the paper you are looking for? You can Submit a new open access paper.