{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T11:05:08Z","timestamp":1761649508391,"version":"3.37.3"},"reference-count":30,"publisher":"Wiley","license":[{"start":{"date-parts":[[2020,7,18]],"date-time":"2020-07-18T00:00:00Z","timestamp":1595030400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61702310","ZR2019ZD03","ts20190924"],"award-info":[{"award-number":["61702310","ZR2019ZD03","ts20190924"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Major Fundamental Research Project of Shandong, China","award":["61702310","ZR2019ZD03","ts20190924"],"award-info":[{"award-number":["61702310","ZR2019ZD03","ts20190924"]}]},{"DOI":"10.13039\/501100010040","name":"Taishan Scholar Project of Shandong Province","doi-asserted-by":"publisher","award":["61702310","ZR2019ZD03","ts20190924"],"award-info":[{"award-number":["61702310","ZR2019ZD03","ts20190924"]}],"id":[{"id":"10.13039\/501100010040","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2020,7,18]]},"abstract":"<jats:p>Most cross-modal retrieval methods based on subspace learning just focus on learning the projection matrices that map different modalities to a common subspace and pay less attention to the retrieval task specificity and class information. To address the two limitations and make full use of unlabelled data, we propose a novel semi-supervised method for cross-modal retrieval named modal-related retrieval based on discriminative comapping (MRRDC). The projection matrices are obtained to map multimodal data into a common subspace for different tasks. In the process of projection matrix learning, a linear discriminant constraint is introduced to preserve the original class information in different modal spaces. An iterative optimization algorithm based on label propagation is presented to solve the proposed joint learning formulations. The experimental results on several datasets demonstrate the superiority of our method compared with state-of-the-art subspace methods.<\/jats:p>","DOI":"10.1155\/2020\/1462429","type":"journal-article","created":{"date-parts":[[2020,7,18]],"date-time":"2020-07-18T23:30:40Z","timestamp":1595115040000},"page":"1-13","source":"Crossref","is-referenced-by-count":0,"title":["Semi-Supervised Cross-Modal Retrieval Based on Discriminative Comapping"],"prefix":"10.1155","volume":"2020","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9121-5124","authenticated-orcid":true,"given":"Li","family":"Liu","sequence":"first","affiliation":[{"name":"School of Information Science and Engineering, Shandong Normal University, Jinan 250014, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9519-612X","authenticated-orcid":true,"given":"Xiao","family":"Dong","sequence":"additional","affiliation":[{"name":"School of Information Science and Engineering, Shandong Normal University, Jinan 250014, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8013-5188","authenticated-orcid":true,"given":"Tianshi","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Information Science and Engineering, Shandong Normal University, Jinan 250014, China"}]}],"member":"311","reference":[{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2015.2408348"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2016.2557878"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-018-7117-8"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/3291060"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2015.2505311"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-019-01746-y"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2018.2797248"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/tmm.2017.2729025"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/3365841"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2018.09.007"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.02.004"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2019.04.041"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/j.jvcir.2019.05.017"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2019.11.061"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1007\/11752790_2"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1162\/089976600300015349"},{"first-page":"918","volume-title":"Maximum covariance unfolding: manifold learning for bimodal data","year":"2011","key":"22"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1007\/11744085_2"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-013-0658-4"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-018-0541-x"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1109\/tcyb.2019.2928180"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1109\/tmm.2017.2742704"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1145\/3284750"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1109\/tmm.2015.2508146"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1145\/2775109"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1109\/tcyb.2017.2742705"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1016\/j.jvcir.2018.11.025"},{"key":"39","first-page":"993","volume":"3","year":"2003","journal-title":"Journal of Machine Learning Research"},{"key":"40","doi-asserted-by":"publisher","DOI":"10.1109\/tcyb.2016.2519449"},{"key":"41","doi-asserted-by":"publisher","DOI":"10.1145\/3065386"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/1462429.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/1462429.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/1462429.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,18]],"date-time":"2020-07-18T23:30:43Z","timestamp":1595115043000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/complexity\/2020\/1462429\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,18]]},"references-count":30,"alternative-id":["1462429","1462429"],"URL":"https:\/\/doi.org\/10.1155\/2020\/1462429","relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"type":"print","value":"1076-2787"},{"type":"electronic","value":"1099-0526"}],"subject":[],"published":{"date-parts":[[2020,7,18]]}}}