Fetching the paper…
Reading the bibliography…
Unsupervised domain adaptation (UDA) aims to learn the unlabeled target domain by transferring the knowledge of the labeled source domain.
Bezdek, James C., Robert Ehrlich, and William Full. ”FCM: The fuzzy c-means clustering algorithm.” Computers & Geosciences. 1984, 10(2-3): 191-203
1984
Earlier work this paper cites.
Tseng P. Convergence of a block coordinate descent method for non-differentiable minimization. Journal of optimization theory and ap-plications, 2001, 109(3): 475-494
2001
Earlier work this paper cites.
Kanungo, Tapas et al. ¡°An Efficient k-Means Clustering Algorithm: Analysis and Implementation.¡± IEEE Trans. Pattern Anal. Mach. Intell. 24 (2002): 881-892
2002
Earlier work this paper cites.
Sim, Terence et al. ¡°The CMU Pose, Illumination, and Expression (PIE) Database.¡± FGR (2002)
2002
Earlier work this paper cites.
Xu, Linli, et al. ”Maximum margin clustering.” Advances in neural information processing systems. 2005: 1537-1544
2005
Earlier work this paper cites.
Blitzer, John, Ryan McDonald, and Fernando Pereira. ”Domain adaptation with structural correspondence learning.” Proceedings of the 2006 conference on empirical methods in natural language processing. Association for Computational Linguistics. 2006: 120-128
2006
Earlier work this paper cites.
Darouach, Mohamed. ”Solution to Sylvester equation associated to linear descriptor systems.” Systems & Control Letters 55 (2006): 835-838
2006
Earlier work this paper cites.
Huang, Jiayuan, et al. ”Correcting sample selection bias by unlabeled data.” Advances in neural information processing systems. 2007: 601-608
2007
Earlier work this paper cites.
Blitzer, John, Mark Dredze, and Fernando Pereira. ”Biographies, bollywood, boom-boxes and blenders: Domain adaptation for sentiment classification.” Proceedings of the 45th annual meeting of the association of computational linguistics. 2007: 440-447
2007
Earlier work this paper cites.
Gretton, Arthur, et al. ”A kernel method for the two-sample-problem.” Advances in neural information processing systems. 2007: 513-520
2007
Earlier work this paper cites.
Jiang, Jing. ”A literature survey on domain adaptation of statistical classifiers.” URL: http://sifaka. cs. uiuc. edu/jiang4/domainadaptation/survey 3 (2008): 1-12
2008
Earlier work this paper cites.
Sugiyama, Masashi, et al. ”Direct importance estimation with model selection and its application to covariate shift adaptation.” Advances in neural information processing systems. 2008: 1433-1440
2008
Earlier work this paper cites.
Dai, Wenyuan, et al. ”Self-taught clustering.” Proceedings of the 25th international conference on Machine learning. ACM, 2008: 200-207
2008
Earlier work this paper cites.
Pan, Sinno Jialin, and Qiang Yang. ”A survey on transfer learning.” IEEE Transactions on knowledge and data engineering. 2010, 22(10): 1345-1359
2010
Earlier work this paper cites.
Ben-David, Shai, et al. ”A theory of learning from different domains.” Machine learning. 2010, 79(1-2): 151-175
2010
Earlier work this paper cites.
Nie, Feiping et al. ¡°Efficient and Robust Feature Selection via Joint L 2 , 1 L_{2,1} -Norms Minimization.¡± NIPS (2010)
2010
Earlier work this paper cites.
Pan, Sinno Jialin, et al. ”Domain adaptation via transfer component analysis.” IEEE Transactions on Neural Networks. 2011, 22(2): 199-210
2011
Cited alongside, same era.
Xu, Yong, et al. ”Discriminative transfer subspace learning via low-rank and sparse representation.”?IEEE Transactions on Image Processing.?2011, 22(2): 199-210
2011
Cited alongside, same era.
Pan, Sinno Jialin, et al. ”Domain adaptation via transfer component analysis.” IEEE Transactions on Neural Networks. 2011, 22(2): 199-210
2011
Cited alongside, same era.
Sun, Qian, et al. ”A two-stage weighting framework for multi-source domain adaptation.” Advances in neural information processing systems. 2011: 505-513
2011
Cited alongside, same era.
Jiang, Wenhao, and Fu-lai Chung. ”Transfer spectral clustering.” Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Springer, Berlin, Heidelberg, 2012: 789-803
2016
Later among the works it cites.
Long, Mingsheng, et al. ”Unsupervised domain adaptation with residual transfer networks.” Advances in Neural Information Processing Systems. 2016: 136-144
2016
Later among the works it cites.
Scholkopf, Bernhard et al. ¡°Nonlinear Component Analysis as a Kernel Eigenvalue Problem.¡± Neural Computation 10 (1998): 1299-1319
2016
Later among the works it cites.
2017
Later among the works it cites.
Li, Shuang, Shiji Song, and Gao Huang. ”Prediction reweighting for domain adaptation.”?IEEE transactions on neural networks and learning systems. 2017, 28(7): 1682-1695
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2012
Cited alongside, same era.
Fernando, Basura, et al. ”Unsupervised visual domain adaptation using subspace alignment.” Proceedings of the IEEE international conference on computer vision. 2013: 2960-2967
2013
Cited alongside, same era.
Ni, Jie, Qiang Qiu, and Rama Chellappa. ”Subspace interpolation via dictionary learning for unsupervised domain adaptation.” Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 2013: 692-699
2013
Cited alongside, same era.
Gong, Boqing, Kristen Grauman, and Fei Sha. ”Reshaping visual datasets for domain adaptation.” Advances in Neural Information Processing Systems. 2013: 1286-1294
2013
Cited alongside, same era.
Wang, Yunyun, and Songcan Chen. ”Soft large margin clustering.” Information Sciences. 2013, 232: 116-129
2013
Cited alongside, same era.
Shao, Ming, Dmitry Kit, and Yun Fu. ”Generalized transfer subspace learning through low-rank constraint.” International Journal of Computer Vision. 2014, 109(1-2): 74-93
2014
Cited alongside, same era.
Long, Mingsheng, et al. ”Transfer joint matching for unsupervised domain adaptation.” Proceedings of the IEEE conference on computer vision and pattern recognition. 2014: 1410-1417
2014
Cited alongside, same era.
Xu, Yong et al. ¡°Discriminative Transfer Subspace Learning via Low-Rank and Sparse Representation.¡± IEEE Transactions on Image Processing 25 (2015): 850-863
2015
Cited alongside, same era.
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
Xu, Y., Pan, S.J., Xiong, H., Wu, Q., Luo, R., Min, H., Song, H.: A unified framework for metric transfer learning. IEEE Transactions on Knowledge and Data Engineering 29(6), 1158¨C1171 (2017)
2017
Later among the works it cites.
Carlucci, Fabio Maria, et al. ”AutoDIAL: Automatic Domain Alignment Layers.” ICCV. 2017: 5077-5085
2017
Later among the works it cites.
Tzeng, E., Ho?man, J., Saenko, K., Darrell, T.: Adversarial discriminative domain adaptation. In: Computer Vision and Pattern Recognition (CVPR). vol. 1, p. 4 (2017)
2017
Later among the works it cites.
2017
Later among the works it cites.
Ding, Zhengming, Ming Shao, and Yun Fu. ”Robust Multi-view Representation: A Unified Perspective from Multi-view Learning to Domain Adaption.” IJCAI. 2018: 5434-5440
2018
Closest in time.
Xu, Ruijia, et al. ”Deep Cocktail Network: Multi-source Unsupervised Domain Adaptation with Category Shift.” Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 2018: 3964-3973
2018
Closest in time.
Ding, Zhengming, Ming Shao, and Yun Fu. ”Incomplete multisource transfer learning.” IEEE transactions on neural networks and learning systems. 2018, 29(2): 310-323
2018
Closest in time.
Pei, Zhongyi, et al. ”Multi-adversarial domain adaptation.” AAAI Conference on Artificial Intelligence. 2018
2018
Closest in time.
Gong, Boqing, et al. ”Geodesic flow kernel for unsupervised domain adaptation.” Computer Vision and Pattern Recognition (CVPR), 2012 IEEE Conference on. IEEE, 2012: 2066-2073
2073
Closest in time.