• Login
    JavaScript is disabled for your browser. Some features of this site may not work without it.
    Optimal kernel choice for domain adaption learning 
    •   QMRO Home
    • School of Electronic Engineering and Computer Science
    • Computer Vision Group
    • Optimal kernel choice for domain adaption learning
    •   QMRO Home
    • School of Electronic Engineering and Computer Science
    • Computer Vision Group
    • Optimal kernel choice for domain adaption learning
    ‌
    ‌

    Browse

    All of QMROCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects
    ‌
    ‌

    Administrators only

    Login
    ‌
    ‌

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Optimal kernel choice for domain adaption learning

    View/Open
    Accepted version (875.2Kb)
    Volume
    51
    Pagination
    163 - 170
    DOI
    10.1016/j.engappai.2016.01.022
    Journal
    Engineering Applications of Artificial Intelligence
    ISSN
    0952-1976
    Metadata
    Show full item record
    Abstract
    © 2016 Elsevier Ltd. All rights reserved. In this paper, a kernel choice method is proposed for domain adaption, referred to as Optimal Kernel Choice Domain Adaption (OKCDA). It learns a robust classier and parameters associated with Multiple Kernel Learning side by side. Domain adaption kernel-based learning strategy has shown outstanding performance. It embeds two domains of different distributions, namely, the auxiliary and the target domains, into Hilbert Space, and exploits the labeled data from the source domain to train a robust kernel-based SVM classier for the target domain. We reduce the distributions mismatch by setting up a test statistic between the two domains based on the Maximum Mean Discrepancy (MMD) algorithm and minimize the Type II error, given an upper bound on error I. Simultaneously, we minimize the structural risk functional. In order to highlight the advantages of the proposed method, we tackle a text classification problem on 20 Newsgroups dataset and Email Spam dataset. The results demonstrate that our method exhibits outstanding performance.
    Authors
    Dong, L; Feng, N; Quan, P; Kong, G; Chen, X; Zhang, Q
    URI
    http://qmro.qmul.ac.uk/xmlui/handle/123456789/13516
    Collections
    • Computer Vision Group [43]
    Licence information
    10.1016/j.engappai.2016.01.022
    Twitter iconFollow QMUL on Twitter
    Twitter iconFollow QM Research
    Online on twitter
    Facebook iconLike us on Facebook
    • Site Map
    • Privacy and cookies
    • Disclaimer
    • Accessibility
    • Contacts
    • Intranet
    • Current students

    Modern Slavery Statement

    Queen Mary University of London
    Mile End Road
    London E1 4NS
    Tel: +44 (0)20 7882 5555

    © Queen Mary University of London.