转化为归纳:基于等级信息的无监督表示学习

IF 5.5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Deryk Willyan Biotto , Lucas Pascotti Valem , Daniel Carlos Guimarães Pedronette , Denis Henrique Pinheiro Salvadeo
{"title":"转化为归纳:基于等级信息的无监督表示学习","authors":"Deryk Willyan Biotto ,&nbsp;Lucas Pascotti Valem ,&nbsp;Daniel Carlos Guimarães Pedronette ,&nbsp;Denis Henrique Pinheiro Salvadeo","doi":"10.1016/j.neucom.2025.131010","DOIUrl":null,"url":null,"abstract":"<div><div>The use of deep learning in supervised scenarios has become well-established. However, there is growing interest in exploring unsupervised learning methods. Transductive approaches are promising for learning rich contextual relationships in unsupervised scenarios but face challenges when dealing with large amounts of data. The main motivation of this study is to investigate the feasibility of an inductive model, based on a neural network, learning representations from ranked lists generated by transductive methods in unsupervised scenarios. We propose an unsupervised approach called Inductive Ranking Learning (IRL), which leverages techniques to learn similarities and dissimilarities from pairs derived from ranked lists produced by transductive methods. This technique involves weighting the most relevant and irrelevant elements when calculating the error of likely positive and negative pairs, based on the position of the element in the ranked list relative to its pair. This allows learning without the need for labels. The proposed approach enables the use of transductive techniques to train inductive models, promoting generalization to unseen data, which is particularly important in scenarios where new data is constantly being introduced. Experimental results show promising performance, although the method may face challenges when dealing with ranked lists derived from large datasets. Overall, the proposed approach offers significant potential for both unsupervised learning and the exploration of transductive approaches in inductive models.</div></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":"651 ","pages":"Article 131010"},"PeriodicalIF":5.5000,"publicationDate":"2025-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Transduction to induction: Unsupervised representation learning based on rank information\",\"authors\":\"Deryk Willyan Biotto ,&nbsp;Lucas Pascotti Valem ,&nbsp;Daniel Carlos Guimarães Pedronette ,&nbsp;Denis Henrique Pinheiro Salvadeo\",\"doi\":\"10.1016/j.neucom.2025.131010\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The use of deep learning in supervised scenarios has become well-established. However, there is growing interest in exploring unsupervised learning methods. Transductive approaches are promising for learning rich contextual relationships in unsupervised scenarios but face challenges when dealing with large amounts of data. The main motivation of this study is to investigate the feasibility of an inductive model, based on a neural network, learning representations from ranked lists generated by transductive methods in unsupervised scenarios. We propose an unsupervised approach called Inductive Ranking Learning (IRL), which leverages techniques to learn similarities and dissimilarities from pairs derived from ranked lists produced by transductive methods. This technique involves weighting the most relevant and irrelevant elements when calculating the error of likely positive and negative pairs, based on the position of the element in the ranked list relative to its pair. This allows learning without the need for labels. The proposed approach enables the use of transductive techniques to train inductive models, promoting generalization to unseen data, which is particularly important in scenarios where new data is constantly being introduced. Experimental results show promising performance, although the method may face challenges when dealing with ranked lists derived from large datasets. Overall, the proposed approach offers significant potential for both unsupervised learning and the exploration of transductive approaches in inductive models.</div></div>\",\"PeriodicalId\":19268,\"journal\":{\"name\":\"Neurocomputing\",\"volume\":\"651 \",\"pages\":\"Article 131010\"},\"PeriodicalIF\":5.5000,\"publicationDate\":\"2025-07-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Neurocomputing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0925231225016820\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Neurocomputing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0925231225016820","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

在监督场景中使用深度学习已经得到了很好的应用。然而,人们对探索无监督学习方法的兴趣越来越大。转换方法有望在无监督场景中学习丰富的上下文关系,但在处理大量数据时面临挑战。本研究的主要动机是研究一种基于神经网络的归纳模型的可行性,该模型在无监督场景下从由换能法生成的排名列表中学习表征。我们提出了一种称为归纳排名学习(IRL)的无监督方法,该方法利用技术从由换能法产生的排名列表中获得的对中学习相似性和差异性。该技术涉及在计算可能的正对和负对的误差时,根据元素在排名列表中相对于其对的位置,对最相关和不相关的元素进行加权。这使得学习不需要标签。所提出的方法可以使用转换技术来训练归纳模型,促进对未见数据的泛化,这在不断引入新数据的情况下尤为重要。尽管该方法在处理来自大型数据集的排名列表时可能面临挑战,但实验结果显示了良好的性能。总的来说,所提出的方法为归纳模型中的无监督学习和转换方法的探索提供了巨大的潜力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Transduction to induction: Unsupervised representation learning based on rank information
The use of deep learning in supervised scenarios has become well-established. However, there is growing interest in exploring unsupervised learning methods. Transductive approaches are promising for learning rich contextual relationships in unsupervised scenarios but face challenges when dealing with large amounts of data. The main motivation of this study is to investigate the feasibility of an inductive model, based on a neural network, learning representations from ranked lists generated by transductive methods in unsupervised scenarios. We propose an unsupervised approach called Inductive Ranking Learning (IRL), which leverages techniques to learn similarities and dissimilarities from pairs derived from ranked lists produced by transductive methods. This technique involves weighting the most relevant and irrelevant elements when calculating the error of likely positive and negative pairs, based on the position of the element in the ranked list relative to its pair. This allows learning without the need for labels. The proposed approach enables the use of transductive techniques to train inductive models, promoting generalization to unseen data, which is particularly important in scenarios where new data is constantly being introduced. Experimental results show promising performance, although the method may face challenges when dealing with ranked lists derived from large datasets. Overall, the proposed approach offers significant potential for both unsupervised learning and the exploration of transductive approaches in inductive models.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Neurocomputing
Neurocomputing 工程技术-计算机:人工智能
CiteScore
13.10
自引率
10.00%
发文量
1382
审稿时长
70 days
期刊介绍: Neurocomputing publishes articles describing recent fundamental contributions in the field of neurocomputing. Neurocomputing theory, practice and applications are the essential topics being covered.
×
引用
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学术官方微信