Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/9262
Title: On minimum distribution discrepancy support vector machine for domain adaptation
Authors: Tao, J
Chung, FL 
Wang, S
Keywords: Domain adaptation learning
Maximum mean discrepancy
Maximum scatter discrepancy
Pattern classification
Support vector machine
Issue Date: 2012
Publisher: Elsevier Sci Ltd
Source: Pattern recognition, 2012, v. 45, no. 11, p. 3962-3984 How to cite?
Journal: Pattern Recognition 
Abstract: Domain adaptation learning (DAL) is a novel and effective technique to address pattern classification problems where the prior information for training is unavailable or insufficient. Its effectiveness depends on the discrepancy between the two distributions that respectively generate the training data for the source domain and the testing data for the target domain. However, DAL may not work so well when only the distribution mean discrepancy between source and target domains is considered and minimized. In this paper, we first construct a generalized projected maximum distribution discrepancy (GPMDD) metric for DAL on reproducing kernel Hilbert space (RKHS) based domain distributions by simultaneously considering both the projected maximum distribution mean and the projected maximum distribution scatter discrepancy between the source and the target domain. In the sequel, based on both the structure risk and the GPMDD minimization principle, we propose a novel domain adaptation kernelized support vector machine (DAKSVM) with respect to the classical SVM, and its two extensions called LS-DAKSVM and μ-DAKSVM with respect to the least-square SVM and the v-SVM, respectively. Moreover, our theoretical analysis justified that the proposed GPMDD metric could effectively measure the consistency not only between the RKHS embedding domain distributions but also between the scatter information of source and target domains. Hence, the proposed methods are distinctive in that the more consistency between the scatter information of source and target domains can be achieved by tuning the kernel bandwidth, the better the convergence of GPMDD metric minimization is and thus improving the scalability and generalization capability of the proposed methods for DAL. Experimental results on artificial and real-world problems indicate that the performance of the proposed methods is superior to or at least comparable with existing benchmarking methods.
URI: http://hdl.handle.net/10397/9262
DOI: 10.1016/j.patcog.2012.04.014
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

34
Last Week
0
Last month
0
Citations as of May 18, 2017

WEB OF SCIENCETM
Citations

26
Last Week
0
Last month
2
Citations as of May 20, 2017

Page view(s)

19
Last Week
0
Last month
Checked on May 21, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.