Kernel methods for transfer learning to avoid negative transfer (Q2224084)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7305375
Language Label Description Also known as
default for all languages
No label defined
    English
    Kernel methods for transfer learning to avoid negative transfer
    scientific article; zbMATH DE number 7305375

      Statements

      Kernel methods for transfer learning to avoid negative transfer (English)
      0 references
      0 references
      3 February 2021
      0 references
      Summary: In the big data era, with the devolvement of information storage and processing capability of computers, new tasks become more and more complex and also with higher requirements. In the other side, out-of-date information of old tasks are abounded at will. Due to the considerable cost for classifying the emerged new tasks, transfer learning techniques are developed to extract useful knowledge from existing similar datasets, and a large number of research works have been published in recent years. However, an open problem in transfer learning is the negative transfer which happens due to different distributions among tasks. In this manuscript, we are targeting at proposing a kernel method to evaluate both the task relatedness and the instance similarities. The minimum description length principle (MDLP) is adopted which was proved effective for evaluating models in transfer learning scenario. Extensive experiments show the effectiveness of our algorithm in terms of the classification accuracy in real datasets.
      0 references
      transfer learning
      0 references
      kernel methods
      0 references
      classification
      0 references
      negative transfer
      0 references
      big data
      0 references
      knowledge extraction
      0 references
      task relatedness
      0 references
      instance similarities
      0 references
      minimum description length principle
      0 references

      Identifiers