AffNet: Designing Multi-Headed Affinity and Adaptive Thresholding for Unsupervised Homophily Estimation

Indranil Ojha;Kushal Bose;Swagatam Das
{"title":"AffNet: Designing Multi-Headed Affinity and Adaptive Thresholding for Unsupervised Homophily Estimation","authors":"Indranil Ojha;Kushal Bose;Swagatam Das","doi":"10.1109/TAI.2026.3688210","DOIUrl":null,"url":null,"abstract":"The message-passing (MP) framework contributes to the profound success of the graph neural networks (GNNs). MP predominantly operates on homophilic graphs where the adjacent nodes are highly likely to have identical class labels. However, for heterophilic graphs containing adjacent nodes frequently with different class labels, numerous sophisticated algorithms have been proposed. A prior idea about the homophily of a graph helps choose the algorithm to be used. The estimation of homophily relies on the node labels which, practically, are often unavailable. Hence, we remain clueless about which GNNs should be applied to the input dataset. To mitigate the issue, we propose a novel and efficient method to measure the homophily without having prior information on the node labels. Our method employs trainable affinity vectors equipped with nodes apart from the pre-existing node features. The affinity vector of a node represents the feature vector that the node expects in a suitable neighbor. We measure affinity scores between nodes as the similarity between the affinity of one node to the features of another node. In this connection, we define a unique homophily measure based on the affinity scores of nodes with themselves. Extending the concept, the multi-headed affinity (MHA) vectors are designed to represent a diverse set of choices the nodes have to connect to other neighbors. Furthermore, we design an adaptive strategy to apply learned thresholds by going beyond the prevailing ones that use fixed thresholds. The estimated affinity scores are subsequently considered as the probability scores determining the existence of edges. In this context, we propose a robust architecture AffNet that can be used to simultaneously estimate homophily in an unsupervised setting, solve the link prediction task and build recommendation systems. Applying our framework to several standard and large-scale datasets, we obtain impressive performances compared with the various state-of-the-art methods.","PeriodicalId":73305,"journal":{"name":"IEEE transactions on artificial intelligence","volume":"7 10","pages":"5512-5523"},"PeriodicalIF":0.0000,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE transactions on artificial intelligence","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/11495122/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/4/27 0:00:00","PubModel":"Epub","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The message-passing (MP) framework contributes to the profound success of the graph neural networks (GNNs). MP predominantly operates on homophilic graphs where the adjacent nodes are highly likely to have identical class labels. However, for heterophilic graphs containing adjacent nodes frequently with different class labels, numerous sophisticated algorithms have been proposed. A prior idea about the homophily of a graph helps choose the algorithm to be used. The estimation of homophily relies on the node labels which, practically, are often unavailable. Hence, we remain clueless about which GNNs should be applied to the input dataset. To mitigate the issue, we propose a novel and efficient method to measure the homophily without having prior information on the node labels. Our method employs trainable affinity vectors equipped with nodes apart from the pre-existing node features. The affinity vector of a node represents the feature vector that the node expects in a suitable neighbor. We measure affinity scores between nodes as the similarity between the affinity of one node to the features of another node. In this connection, we define a unique homophily measure based on the affinity scores of nodes with themselves. Extending the concept, the multi-headed affinity (MHA) vectors are designed to represent a diverse set of choices the nodes have to connect to other neighbors. Furthermore, we design an adaptive strategy to apply learned thresholds by going beyond the prevailing ones that use fixed thresholds. The estimated affinity scores are subsequently considered as the probability scores determining the existence of edges. In this context, we propose a robust architecture AffNet that can be used to simultaneously estimate homophily in an unsupervised setting, solve the link prediction task and build recommendation systems. Applying our framework to several standard and large-scale datasets, we obtain impressive performances compared with the various state-of-the-art methods.
非监督同态估计的多头亲和和自适应阈值设计
消息传递(MP)框架对图神经网络(gnn)的巨大成功做出了贡献。MP主要作用于同态图,其中相邻节点极有可能具有相同的类标记。然而,对于经常包含不同类标记的相邻节点的异亲图,已经提出了许多复杂的算法。关于图的同态的先验思想有助于选择要使用的算法。同态性的估计依赖于节点标签,而实际上,这些标签通常是不可用的。因此,我们仍然不知道应该将哪些gnn应用于输入数据集。为了解决这个问题,我们提出了一种新的、有效的方法来测量同质性,而不需要节点标签上的先验信息。我们的方法采用可训练的亲和向量,这些亲和向量配备了除已有节点特征之外的节点。节点的亲和向量表示该节点在合适的邻居中期望的特征向量。我们测量节点之间的亲和力得分作为一个节点与另一个节点的特征的亲和力之间的相似性。在这方面,我们定义了一个基于节点与自身亲和分数的唯一同质性度量。扩展这个概念,多头亲和(MHA)向量被设计为表示节点必须连接到其他邻居的各种选择集。此外,我们设计了一种自适应策略,通过超越使用固定阈值的流行阈值来应用学习阈值。估计的亲和性分数随后被认为是确定边缘存在的概率分数。在这种情况下,我们提出了一种鲁棒的AffNet架构,可以同时用于在无监督环境下估计同质性,解决链接预测任务和构建推荐系统。将我们的框架应用于几个标准和大规模数据集,与各种最先进的方法相比,我们获得了令人印象深刻的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
7.70
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书