Hound:在文本属性图上为少样本与零样本节点分类寻找监督信号
Hound: Hunting Supervision Signals for Few and Zero Shot Node Classification on Text-attributed Graph
AI总结:
本文提出 Hound 框架,通过节点扰动、文本匹配和语义否定三种增强技术为文本属性图上的少样本与零样本节点分类引入更多监督信号,在 5 个数据集上一致优于 13 个基线,准确率提升通常超过 5%。
摘要:
文本属性图(TAG)是一类重要的图结构数据,其中每个节点都带有文本描述。TAG 上的少样本和零样本节点分类在学术界和社交网络等领域有许多应用。然而,由于缺乏监督信号,这两项任务具有挑战性,现有方法仅使用对比损失来对齐基于图的节点嵌入和基于语言的文本嵌入。在本文中,我们提出 Hound,通过引入更多监督信号来提高准确率,其核心思想是超越数据自带的节点-文本对。具体来说,我们设计了三种增强技术,即节点扰动、文本匹配和语义否定,以便为每个文本提供更多参考节点,反之亦然。节点扰动通过添加/删除边来产生多样化的节点嵌入,从而可以与文本匹配。文本匹配检索具有相似嵌入的文本,以与节点匹配。语义否定使用负向提示构造一个语义相反的负文本,并与原始节点和文本进行对比。我们在 5 个数据集上评估 Hound,并与 13 个最先进的基线进行比较。结果表明,Hound 一致地优于所有基线,并且相对于表现最好的基线,其准确率提升通常超过 5%。
英文摘要:
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 networks. However, the two tasks are challenging due to the lack of supervision signals, and existing methods only use the contrastive loss to align graph-based node embedding and language-based text embedding. In this paper, we propose Hound to improve accuracy by introducing more supervision signals, and the core idea is to go beyond the node-text pairs that come with data. Specifically, we design three augmentation techniques, i.e., node perturbation, text matching, and semantics negation to provide more reference nodes for each text and vice versa. Node perturbation adds/drops edges to produce diversified node embeddings that can be matched with a text. Text matching retrieves texts with similar embeddings to match with a node. Semantics negation uses a negative prompt to construct a negative text with the opposite semantics, which is contrasted with the original node and text. We evaluate Hound on 5 datasets and compare with 13 state-of-the-art baselines. The results show that Hound consistently outperforms all baselines, and its accuracy improvements over the best-performing baseline are usually over 5%.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。