Coarse-to-Fine Open-Set Graph Node Classification with Large Language Models
Xueqi Ma, Xingjun Ma, Sarah Monazam Erfani, Danilo Mandic, James Bailey

TL;DR
This paper introduces a novel coarse-to-fine open-set classification framework leveraging large language models to improve out-of-distribution detection and classification on graph datasets, without relying on synthetic OOD samples.
Contribution
The paper proposes a new CFC framework that combines LLM prompts with GNNs for effective OOD detection and classification, enhancing interpretability and practical utility.
Findings
CFC improves OOD detection by 10% over state-of-the-art methods.
CFC achieves up to 70% accuracy in OOD classification on graph datasets.
Utilizes genuine semantic OOD instances for better interpretability.
Abstract
Developing open-set classification methods capable of classifying in-distribution (ID) data while detecting out-of-distribution (OOD) samples is essential for deploying graph neural networks (GNNs) in open-world scenarios. Existing methods typically treat all OOD samples as a single class, despite real-world applications, especially high-stake settings such as fraud detection and medical diagnosis, demanding deeper insights into OOD samples, including their probable labels. This raises a critical question: can OOD detection be extended to OOD classification without true label information? To address this question, we propose a Coarse-to-Fine open-set Classification (CFC) framework that leverages large language models (LLMs) for graph datasets. CFC consists of three key components: a coarse classifier that uses LLM prompts for OOD detection and outlier label generation, a GNN-based fine…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsAdvanced Graph Neural Networks · Graph Theory and Algorithms · Big Data and Digital Economy
