A Transfer Learning Algorithm Based on Support Vector Machine

In many scenarios of classification, test and training data must come from same feature space and have same distribution. However, this assumption may not be satisfactory in many practical applications. In recent years, the emergence of transfer learning has provided a new technology to solve this p...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Neural processing letters 2023-10, Vol.55 (5), p.6043-6066
Hauptverfasser: Wu, Weifei, Chen, Shidian, Bao, LiYing
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In many scenarios of classification, test and training data must come from same feature space and have same distribution. However, this assumption may not be satisfactory in many practical applications. In recent years, the emergence of transfer learning has provided a new technology to solve this problem. Aiming at problems that the existing transfer learning algorithms only utilize the data in source domain to assist the learning tasks of target domain without considering the effect of target data to source domain, the selectivity bias of knowledge and scarce labeled samples, this paper proposed a collaboration mutual transfer learning algorithm based on support vector machine -CMATLSVM.CMATLSVM realizes multiple mutual learnings between source and target domains through the collaborative mutual assistance. In collaborative mutual assistance, in order to further improve the classification effect of target domain task, a similarity measure is introduced, which restricts negative transfer in constraints of objective function. At the same time representative dataset in source domain are obtained to reduce the size of training data and improve training efficiency. The experimental results on several real-world datasets show the effectiveness of CMATLSVM, and it also has certain advantages compared with benchmark algorithms.
ISSN:1370-4621
1573-773X
DOI:10.1007/s11063-022-11126-8