IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/329753.html
   My bibliography  Save this article

Multiview Sample Classification Algorithm Based on L1-Graph Domain Adaptation Learning

Author

Listed:
  • Huibin Lu
  • Zhengping Hu
  • Hongxiao Gao

Abstract

In the case of multiview sample classification with different distribution, training and testing samples are from different domains. In order to improve the classification performance, a multiview sample classification algorithm based on L1-Graph domain adaptation learning is presented. First of all, a framework of nonnegative matrix trifactorization based on domain adaptation learning is formed, in which the unchanged information is regarded as the bridge of knowledge transformation from the source domain to the target domain; the second step is to construct L1-Graph on the basis of sparse representation, so as to search for the nearest neighbor data with self-adaptation and preserve the samples and the geometric structure; lastly, we integrate two complementary objective functions into the unified optimization issue and use the iterative algorithm to cope with it, and then the estimation of the testing sample classification is completed. Comparative experiments are conducted in USPS-Binary digital database, Three-Domain Object Benchmark database, and ALOI database; the experimental results verify the effectiveness of the proposed algorithm, which improves the recognition accuracy and ensures the robustness of algorithm.

Suggested Citation

  • Huibin Lu & Zhengping Hu & Hongxiao Gao, 2015. "Multiview Sample Classification Algorithm Based on L1-Graph Domain Adaptation Learning," Mathematical Problems in Engineering, Hindawi, vol. 2015, pages 1-8, June.
  • Handle: RePEc:hin:jnlmpe:329753
    DOI: 10.1155/2015/329753
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2015/329753.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2015/329753.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2015/329753?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:329753. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.