Robust Two Stage Unsupervised Metric Learning for Domain Adaptation

Samaneh Azarbarzin, F. Afsari
{"title":"Robust Two Stage Unsupervised Metric Learning for Domain Adaptation","authors":"Samaneh Azarbarzin, F. Afsari","doi":"10.1109/ICCKE.2018.8566472","DOIUrl":null,"url":null,"abstract":"Most commonly used metric learning procedures suppose that the input feature space and domain of the training and test data are identical. In such cases these algorithms cannot improve target learning problems. This paper presents a robust distance metric for domain adaptation in two stages. At first stage both source and target features are transferred to a newly found latent feature space, which minimizes the difference between domains as well as the data properties are preserved. Then in the second stage, the desired metric is learned with a marginalized denoising strategy and the low-rank constraint. To show the superiority and power of the proposed method it is tested on distinct kinds of cross-domain image categorization datasets and the results prove that our approach remarkably exceeds other existing domain adaptation algorithms in the classification tasks.","PeriodicalId":283700,"journal":{"name":"2018 8th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 8th International Conference on Computer and Knowledge Engineering (ICCKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCKE.2018.8566472","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Most commonly used metric learning procedures suppose that the input feature space and domain of the training and test data are identical. In such cases these algorithms cannot improve target learning problems. This paper presents a robust distance metric for domain adaptation in two stages. At first stage both source and target features are transferred to a newly found latent feature space, which minimizes the difference between domains as well as the data properties are preserved. Then in the second stage, the desired metric is learned with a marginalized denoising strategy and the low-rank constraint. To show the superiority and power of the proposed method it is tested on distinct kinds of cross-domain image categorization datasets and the results prove that our approach remarkably exceeds other existing domain adaptation algorithms in the classification tasks.
领域自适应的鲁棒两阶段无监督度量学习
最常用的度量学习过程假设训练数据和测试数据的输入特征空间和域是相同的。在这种情况下,这些算法不能改善目标学习问题。本文提出了一种鲁棒距离度量,分两个阶段进行域适应。在第一阶段,源特征和目标特征都被转移到一个新发现的潜在特征空间中,这样可以最大限度地减少域之间的差异,并保持数据的属性。然后在第二阶段,使用边缘去噪策略和低秩约束来学习期望的度量。为了证明该方法的优越性和有效性,在不同类型的跨域图像分类数据集上进行了测试,结果证明我们的方法在分类任务上明显优于其他现有的域自适应算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信