Relational Feature Modeling: Enhancing Predictive Learning Through Network-Based Features Augmentation

Ankur Kumar Singhal;Anurag Singh
{"title":"Relational Feature Modeling: Enhancing Predictive Learning Through Network-Based Features Augmentation","authors":"Ankur Kumar Singhal;Anurag Singh","doi":"10.1109/TAI.2026.3687508","DOIUrl":null,"url":null,"abstract":"Feature representation and augmentation are central factors for improving predictive accuracy of the prediction model, particularly in domains constrained by limited data availability, such as agriculture and biological systems. Data scarcity, usually caused by annotation costs, variability in environmental factors, and the rarity of critical events, restricts the effectiveness of conventional models. While traditional prediction models perform well in data-rich scenarios, their performance degrades in small-data scenarios, leading to reduced predictive accuracy. To address limitations, a network-based feature augmentation prediction framework is proposed for small-data scenarios. An instance-specific parenclitic network is constructed for each data instance by modeling deviations among features, where nodes represent features and edges show the pairwise relationships. Further, three important structural descriptors edge count (global connectivity), entropy centrality (dispersion of influence), and clustering coefficient (local cohesiveness) are extracted and concatenated with the original feature vector to form an augmented representation. The augmented data are then modelled using a regularised multivariate Gaussian distribution, with class-conditional likelihoods. The framework is evaluated on three different datasets and performs better than the baseline methods, with accuracy improvements of 5.1%, 5.6%, and 4.0%. Additional analyses using residual and contour plots confirmed improved stability and interpretability, showing the proposed model is scalable and effective across domains with limited data.","PeriodicalId":73305,"journal":{"name":"IEEE transactions on artificial intelligence","volume":"7 10","pages":"5472-5481"},"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/11495002/","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

Feature representation and augmentation are central factors for improving predictive accuracy of the prediction model, particularly in domains constrained by limited data availability, such as agriculture and biological systems. Data scarcity, usually caused by annotation costs, variability in environmental factors, and the rarity of critical events, restricts the effectiveness of conventional models. While traditional prediction models perform well in data-rich scenarios, their performance degrades in small-data scenarios, leading to reduced predictive accuracy. To address limitations, a network-based feature augmentation prediction framework is proposed for small-data scenarios. An instance-specific parenclitic network is constructed for each data instance by modeling deviations among features, where nodes represent features and edges show the pairwise relationships. Further, three important structural descriptors edge count (global connectivity), entropy centrality (dispersion of influence), and clustering coefficient (local cohesiveness) are extracted and concatenated with the original feature vector to form an augmented representation. The augmented data are then modelled using a regularised multivariate Gaussian distribution, with class-conditional likelihoods. The framework is evaluated on three different datasets and performs better than the baseline methods, with accuracy improvements of 5.1%, 5.6%, and 4.0%. Additional analyses using residual and contour plots confirmed improved stability and interpretability, showing the proposed model is scalable and effective across domains with limited data.
关系特征建模:通过基于网络的特征增强增强预测学习
特征表示和增强是提高预测模型预测准确性的核心因素,特别是在数据可用性有限的领域,如农业和生物系统。数据稀缺性通常由注释成本、环境因素的可变性和关键事件的稀缺性引起,限制了传统模型的有效性。虽然传统的预测模型在数据丰富的场景中表现良好,但在小数据场景中其性能会下降,导致预测精度降低。针对小数据场景,提出了一种基于网络的特征增强预测框架。通过对特征之间的偏差建模,为每个数据实例构建实例特定的圆弧网络,其中节点表示特征,边表示成对关系。此外,提取三个重要的结构描述符边缘计数(全局连通性)、熵中心性(影响分散)和聚类系数(局部内聚性),并将其与原始特征向量连接起来,形成增强表示。然后使用正则化的多元高斯分布对增强数据进行建模,并具有类条件似然。该框架在三个不同的数据集上进行了评估,并比基线方法表现更好,准确率提高了5.1%,5.6%和4.0%。使用残差图和等高线图的附加分析证实了改进的稳定性和可解释性,表明所提出的模型在有限数据的跨域可扩展和有效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信
小红书