File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Learning Transferred Weights from Co-Occurrence Data for Heterogeneous Transfer Learning

TitleLearning Transferred Weights from Co-Occurrence Data for Heterogeneous Transfer Learning
Authors
Keywordsdirected cyclic network (DCN)
heterogeneous transfer learning
multidomain
transferred weight
Co-occurrence data
Issue Date2016
Citation
IEEE Transactions on Neural Networks and Learning Systems, 2016, v. 27, n. 11, p. 2187-2200 How to Cite?
Abstract© 2012 IEEE. One of the main research problems in heterogeneous transfer learning is to determine whether a given source domain is effective in transferring knowledge to a target domain, and then to determine how much of the knowledge should be transferred from a source domain to a target domain. The main objective of this paper is to solve this problem by evaluating the relatedness among given domains through transferred weights. We propose a novel method to learn such transferred weights with the aid of co-occurrence data, which contain the same set of instances but in different feature spaces. Because instances with the same category should have similar features, our method is to compute their principal components in each feature space such that co-occurrence data can be rerepresented by these principal components. The principal component coefficients from different feature spaces for the same instance in the co-occurrence data have the same order of significance for describing the category information. By using these principal component coefficients, the Markov Chain Monte Carlo method is employed to construct a directed cyclic network where each node is a domain and each edge weight is the conditional dependence from one domain to another domain. Here, the edge weight of the network can be employed as the transferred weight from a source domain to a target domain. The weight values can be taken as a prior for setting parameters in the existing heterogeneous transfer learning methods to control the amount of knowledge transferred from a source domain to a target domain. The experimental results on synthetic and real-world data sets are reported to illustrate the effectiveness of the proposed method that can capture strong or weak relations among feature spaces, and enhance the learning performance of heterogeneous transfer learning.
Persistent Identifierhttp://hdl.handle.net/10722/276545
ISSN
2020 Impact Factor: 10.451
2020 SCImago Journal Rankings: 2.882
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorYang, Liu-
dc.contributor.authorJing, Liping-
dc.contributor.authorYu, Jian-
dc.contributor.authorNg, Michael K.-
dc.date.accessioned2019-09-18T08:33:56Z-
dc.date.available2019-09-18T08:33:56Z-
dc.date.issued2016-
dc.identifier.citationIEEE Transactions on Neural Networks and Learning Systems, 2016, v. 27, n. 11, p. 2187-2200-
dc.identifier.issn2162-237X-
dc.identifier.urihttp://hdl.handle.net/10722/276545-
dc.description.abstract© 2012 IEEE. One of the main research problems in heterogeneous transfer learning is to determine whether a given source domain is effective in transferring knowledge to a target domain, and then to determine how much of the knowledge should be transferred from a source domain to a target domain. The main objective of this paper is to solve this problem by evaluating the relatedness among given domains through transferred weights. We propose a novel method to learn such transferred weights with the aid of co-occurrence data, which contain the same set of instances but in different feature spaces. Because instances with the same category should have similar features, our method is to compute their principal components in each feature space such that co-occurrence data can be rerepresented by these principal components. The principal component coefficients from different feature spaces for the same instance in the co-occurrence data have the same order of significance for describing the category information. By using these principal component coefficients, the Markov Chain Monte Carlo method is employed to construct a directed cyclic network where each node is a domain and each edge weight is the conditional dependence from one domain to another domain. Here, the edge weight of the network can be employed as the transferred weight from a source domain to a target domain. The weight values can be taken as a prior for setting parameters in the existing heterogeneous transfer learning methods to control the amount of knowledge transferred from a source domain to a target domain. The experimental results on synthetic and real-world data sets are reported to illustrate the effectiveness of the proposed method that can capture strong or weak relations among feature spaces, and enhance the learning performance of heterogeneous transfer learning.-
dc.languageeng-
dc.relation.ispartofIEEE Transactions on Neural Networks and Learning Systems-
dc.subjectdirected cyclic network (DCN)-
dc.subjectheterogeneous transfer learning-
dc.subjectmultidomain-
dc.subjecttransferred weight-
dc.subjectCo-occurrence data-
dc.titleLearning Transferred Weights from Co-Occurrence Data for Heterogeneous Transfer Learning-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/TNNLS.2015.2472457-
dc.identifier.scopuseid_2-s2.0-85027557459-
dc.identifier.volume27-
dc.identifier.issue11-
dc.identifier.spage2187-
dc.identifier.epage2200-
dc.identifier.eissn2162-2388-
dc.identifier.isiWOS:000386940300004-
dc.identifier.issnl2162-237X-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats