Deryk Willyan Biotto , Lucas Pascotti Valem , Daniel Carlos Guimarães Pedronette , Denis Henrique Pinheiro Salvadeo
{"title":"转化为归纳:基于等级信息的无监督表示学习","authors":"Deryk Willyan Biotto , Lucas Pascotti Valem , Daniel Carlos Guimarães Pedronette , 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 , Lucas Pascotti Valem , Daniel Carlos Guimarães Pedronette , 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}
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 publishes articles describing recent fundamental contributions in the field of neurocomputing. Neurocomputing theory, practice and applications are the essential topics being covered.