Learning from not-all-negative pairwise data and unlabeled data

IF 7.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pattern Recognition Pub Date : 2025-07-01 Epub Date: 2025-02-13 DOI:10.1016/j.patcog.2025.111442
Shuying Huang, Junpeng Li, Changchun Hua, Yana Yang
{"title":"Learning from not-all-negative pairwise data and unlabeled data","authors":"Shuying Huang,&nbsp;Junpeng Li,&nbsp;Changchun Hua,&nbsp;Yana Yang","doi":"10.1016/j.patcog.2025.111442","DOIUrl":null,"url":null,"abstract":"<div><div>A weakly-supervised approach utilizing data pairs with comparative or similarity/dissimilarity information has gained popularity in various fields due to its cost-effectiveness. However, the challenge of dealing with not all negative (<em>i.e</em>., pairwise data that includes at least one positive) or not all positive (<em>i.e</em>., pairwise data that includes at least one negative) data pairs has not been specifically addressed by any algorithm. To overcome this bottleneck, this paper explores a novelty weakly-supervision framework of learning from pairwise data that includes at least one positive and unlabeled data points (<span><math><mrow><msub><mrow><mi>P</mi></mrow><mrow><mi>p</mi><mi>o</mi><mi>s</mi></mrow></msub><mi>U</mi></mrow></math></span>) as a representative. The provided pairwise data ensures that each data pair contains at least one positive data point. Unlabeled data refers to data without labeled information. Firstly, this paper shows an unbiased risk estimator for <span><math><mrow><msub><mrow><mi>P</mi></mrow><mrow><mi>p</mi><mi>o</mi><mi>s</mi></mrow></msub><mi>U</mi></mrow></math></span> data and use risk correction functions to mitigate the overfitting caused by negative terms. In addition, the estimation error bound is established for the empirical risk minimizer and the optimal convergence rate is obtained. Finally, the detailed experimental process and results are presented to demonstrate the effectiveness of the proposed method.</div></div>","PeriodicalId":49713,"journal":{"name":"Pattern Recognition","volume":"163 ","pages":"Article 111442"},"PeriodicalIF":7.6000,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Pattern Recognition","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0031320325001025","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/2/13 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

A weakly-supervised approach utilizing data pairs with comparative or similarity/dissimilarity information has gained popularity in various fields due to its cost-effectiveness. However, the challenge of dealing with not all negative (i.e., pairwise data that includes at least one positive) or not all positive (i.e., pairwise data that includes at least one negative) data pairs has not been specifically addressed by any algorithm. To overcome this bottleneck, this paper explores a novelty weakly-supervision framework of learning from pairwise data that includes at least one positive and unlabeled data points (PposU) as a representative. The provided pairwise data ensures that each data pair contains at least one positive data point. Unlabeled data refers to data without labeled information. Firstly, this paper shows an unbiased risk estimator for PposU data and use risk correction functions to mitigate the overfitting caused by negative terms. In addition, the estimation error bound is established for the empirical risk minimizer and the optimal convergence rate is obtained. Finally, the detailed experimental process and results are presented to demonstrate the effectiveness of the proposed method.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
从非全负的成对数据和未标记数据中学习
由于其成本效益,利用具有比较或相似/不相似信息的数据对的弱监督方法在各个领域得到了普及。然而,处理不全为负(即,成对数据至少包含一个正)或不全为正(即,成对数据至少包含一个负)数据对的挑战还没有被任何算法专门解决。为了克服这一瓶颈,本文探索了一种新的弱监督框架,该框架从成对数据中学习,其中至少包括一个正的未标记数据点(posu)作为代表。所提供的成对数据确保每个数据对至少包含一个正数据点。未标注数据是指未标注信息的数据。首先,本文给出了posu数据的无偏风险估计量,并利用风险修正函数来减轻负项引起的过拟合。此外,建立了经验风险最小器的估计误差界,得到了最优收敛速度。最后,给出了详细的实验过程和结果,验证了所提方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Pattern Recognition
Pattern Recognition 工程技术-工程:电子与电气
CiteScore
14.40
自引率
16.20%
发文量
683
审稿时长
5.6 months
期刊介绍: The field of Pattern Recognition is both mature and rapidly evolving, playing a crucial role in various related fields such as computer vision, image processing, text analysis, and neural networks. It closely intersects with machine learning and is being applied in emerging areas like biometrics, bioinformatics, multimedia data analysis, and data science. The journal Pattern Recognition, established half a century ago during the early days of computer science, has since grown significantly in scope and influence.
期刊最新文献
IrisMAE: Structure-aware masked image modeling for iris recognition Minimizing the pretraining gap: Domain-aligned text-based person retrieval Stealthy backdoor attack method targeting group fairness in self-supervised learning Multiple similarity and multiple kernel fusion based on graph inference network for circRNA-disease association prediction FMaMIL: Synergistic spatial-frequency Mamba multi-instance learning for weakly supervised pathology lesion segmentation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1