Multiview sample classification algorithm based on L1-graph domain adaptation learning (Q1665387)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Multiview sample classification algorithm based on L1-graph domain adaptation learning |
scientific article; zbMATH DE number 6926081
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multiview sample classification algorithm based on L1-graph domain adaptation learning |
scientific article; zbMATH DE number 6926081 |
Statements
Multiview sample classification algorithm based on L1-graph domain adaptation learning (English)
0 references
27 August 2018
0 references
Summary: 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.
0 references
0 references
0 references
0.7231654524803162
0 references
0.7193056344985962
0 references
0.7161270976066589
0 references
0.7152186036109924
0 references
0.7087406516075134
0 references