• DocumentCode
    2249238
  • Title

    Multi-step Bridged Refinement for classifying cross-domian data

  • Author

    Qin, Jiang-Wei ; Peng, Hong ; Liang, Peng ; Ma, Qian-li ; Wei, Jia

  • Author_Institution
    Sch. of Comput. Sci. & Eng., South China Univ. of Technol., Guangzhou, China
  • Volume
    5
  • fYear
    2010
  • fDate
    11-14 July 2010
  • Firstpage
    2422
  • Lastpage
    2427
  • Abstract
    Traditional approaches for classification require that the labeled data should have an identical distribution with the unlabeled data in order to build a reliable classifier. However, the identical distributed labeled data are often in short supply. In this situation, we may hope to borrow the labeled data in the relative domain to help the target task. To address this problem, we propose a transfer learning approach called Multi-step Bridged Refinement, which extends the Bridged Refinement algorithm. In the proposed method, we construct a series mixture models to bridge the source and target domain, through which the initial labels of the unlabeled data are refined towards the target distribution in a multi-step way. We empirically show that the proposed method can better discover the relatedness between domains and make better transfer. The result also shows the final accuracy is insensitive to the initial predicted labels as long as the refinement step is sufficient enough.
  • Keywords
    data handling; data mining; learning (artificial intelligence); pattern classification; cross-domain data classification; identical distributed labeled data; multistep bridged refinement; relatedness discovery; series mixture model; target distribution; transfer learning approach; Educational institutions; Horses; Support vector machines; Bridged Refinement; Classification; Cross-domain; Transfer learning;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Machine Learning and Cybernetics (ICMLC), 2010 International Conference on
  • Conference_Location
    Qingdao
  • Print_ISBN
    978-1-4244-6526-2
  • Type

    conf

  • DOI
    10.1109/ICMLC.2010.5580734
  • Filename
    5580734