Exploiting Text Semantics for Few and Zero Shot Node Classification on Text-attributed Graph
Text-attributed graph (TAG) provides a text description for each graph node, and few- and zero-shot node classification on TAGs have many applications in fields such as academia and social networks. Existing work utilizes various graph-based augmentation techniques to train the node and text embeddings, while text-based augmentations are largely unexplored. In this paper, we propose Text Semantics Augmentation (TSA) to improve accuracy by introducing more text semantic supervision signals. Specifically, we design two augmentation techniques, i.e., positive semantics matching and negative semantics contrast, to provide more reference texts for each graph node or text description. Positive semantic matching retrieves texts with similar embeddings to match with a graph node. Negative semantic contrast adds a negative prompt to construct a text description with the opposite semantics, which is contrasted with the original node and text. We evaluate TSA on 5 datasets and compare with 13 state-of-the-art baselines. The results show that TSA consistently outperforms all baselines, and its accuracy improvements over the best-performing baseline are usually over 5%.
Code (0)
등록된 구현이 없습니다.
Tasks
Node ClassificationTAGSimilar Papers 제목 키워드 기반
Hound: Hunting Supervision Signals for Few and Zero Shot Node Classification on Text-attributed Graph
Text-attributed graph (TAG) is an important type of graph structured data with text descriptions for each node. Few- and zero-shot node classification on TAGs have many applications in fields such as academia and social …
NegationNode ClassificationTAGText MatchingCHARM: A Multimodal Graph Foundation Model with Hierarchical Context Modeling for Zero-Shot Transfer
Graph foundation models (GFMs) have emerged as a promising paradigm for transferring knowledge across graph domains and tasks. Real-world graphs associate nodes with text, images, and other modalities, making multimodal …
KMF: Knowledge-Aware Multi-Faceted Representation Learning for Zero-Shot Node Classification
Recently, Zero-Shot Node Classification (ZNC) has been an emerging and crucial task in graph data analysis. This task aims to predict nodes from unseen classes which are unobserved in the training process. Existing work …
Node ClassificationRepresentation LearningTransfer LearningOpenKD: Opening Prompt Diversity for Zero- and Few-shot Keypoint Detection
Exploiting the foundation models (e.g., CLIP) to build a versatile keypoint detector has gained increasing attention. Most existing models accept either the text prompt (e.g., ``the nose of a cat''), or the visual prompt…
DiversityKeypoint DetectionLarge Language ModelSpatial ReasoningA Zero-shot Generalized Graph Anomaly Detection Framework via Node Reconstruction
Cross-domain graph anomaly detection (GAD) aims to identify abnormal nodes in unseen target graphs, showing strong potential in real-world applications with heterogeneous graph data. However, existing methods often depen…
Graph Anomaly Detection