• DocumentCode
    2776496
  • Title

    Feature space transformation for transfer learning

  • Author

    Grozavu, Nistor ; Bennani, Younés ; Labiod, Lazhar

  • Author_Institution
    LIPN, Univ. Paris 13, Villetaneuse, France
  • fYear
    2012
  • fDate
    10-15 June 2012
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    In this paper, we propose a study on the use of weighted topological learning and matrix factorization methods to transform the representation space of a sparse dataset in order to increase the quality of learning, and adapt it to the case of transfer learning. The matrix factorization allows us to find latent variables, weighted topological learning is used to detect the most relevant among them. New data representation is based on their projections on the weighted topological model. Each object in the dataset is described by a new representation consisting of the distances of this object to all components of the topological model (prototypes). For transfer learning, we propose a new method where the representation of data is done in the same way as in the first phase, but using a pruned topological model. This pruning is performed after labeling the units of the topological model using the labels available for transfer. The experiments are presented as a part of an International Challenge [1] where we have obtained promising results (5th rank).
  • Keywords
    learning (artificial intelligence); matrix decomposition; International Challenge; data representation; feature space transformation; matrix factorization methods; prototypes; pruned topological model; representation space; sparse dataset; transfer learning; weighted topological learning; weighted topological model; Algorithm design and analysis; Data mining; Data models; Matrix decomposition; Prototypes; Sparse matrices; Unsupervised learning;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Neural Networks (IJCNN), The 2012 International Joint Conference on
  • Conference_Location
    Brisbane, QLD
  • ISSN
    2161-4393
  • Print_ISBN
    978-1-4673-1488-6
  • Electronic_ISBN
    2161-4393
  • Type

    conf

  • DOI
    10.1109/IJCNN.2012.6252732
  • Filename
    6252732