{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T21:53:47Z","timestamp":1786398827457,"version":"build-2736575974"},"reference-count":81,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T00:00:00Z","timestamp":1664496000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T00:00:00Z","timestamp":1664496000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s10994-022-06231-7","type":"journal-article","created":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T20:02:39Z","timestamp":1664568159000},"page":"4159-4182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Hierarchical optimal transport for unsupervised domain adaptation"],"prefix":"10.1007","volume":"111","author":[{"given":"Mourad","family":"El\u00a0Hamri","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Youn\u00e8s","family":"Bennani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Issam","family":"Falih","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,9,30]]},"reference":[{"issue":"2","key":"6231_CR1","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1137\/100805741","volume":"43","author":"M Agueh","year":"2011","unstructured":"Agueh, M., & Carlier, G. (2011). Barycenters in the wasserstein space. SIAM Journal on Mathematical Analysis, 43(2), 904\u2013924.","journal-title":"SIAM Journal on Mathematical Analysis"},{"key":"6231_CR2","unstructured":"Altschuler, J., Weed, J., & Rigollet, P. (2017). Near-linear time approximation algorithms for optimal transport via sinkhorn iteration. NIPS\u201917, pp. 1961-1971."},{"key":"6231_CR3","first-page":"44","volume":"22","author":"JM Altschuler","year":"2021","unstructured":"Altschuler, J. M., & Boix-Adsera, E. (2021). Wasserstein barycenters can be computed in polynomial time in fixed dimension. Journal of Machine Learning Research, 22, 44\u20131.","journal-title":"Journal of Machine Learning Research"},{"key":"6231_CR4","unstructured":"Alvarez-Melis, D., Jaakkola, T., & Jegelka, S. (2018). Structured optimal transport. In International conference on artificial intelligence and statistics, (pp. 1771\u20131780). PMLR."},{"key":"6231_CR5","doi-asserted-by":"crossref","unstructured":"Ben-David, S., Blitzer, J., Crammer, K., & Pereira, F. (2006). Analysis of representations for domain adaptation. In: Advances in neural information processing systems 19 .","DOI":"10.7551\/mitpress\/7503.003.0022"},{"key":"6231_CR6","volume-title":"Introduction to linear optimization","author":"D Bertsimas","year":"1997","unstructured":"Bertsimas, D., & Tsitsiklis, J. N. (1997). Introduction to linear optimization (Vol. 6). Athena Scientific Belmont."},{"key":"6231_CR7","unstructured":"Blitzer, J., Dredze, M., & Pereira, F. (2007). Biographies, bollywood, boom-boxes and blenders: Domain adaptation for sentiment classification. In 45th annual meeting of the ACL."},{"issue":"2","key":"6231_CR8","first-page":"e1343","volume":"10","author":"RJ Campello","year":"2020","unstructured":"Campello, R. J., Kr\u00f6ger, P., Sander, J., & Zimek, A. (2020). Density-based clustering. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, 10(2), e1343.","journal-title":"Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery"},{"key":"6231_CR9","doi-asserted-by":"crossref","unstructured":"Campello, R.J., Moulavi, D., & Sander, J. (2013). Density-based clustering based on hierarchical density estimates. In Pacific-Asia conference on knowledge discovery and data mining, pp. 160\u2013172. Springer.","DOI":"10.1007\/978-3-642-37456-2_14"},{"key":"6231_CR10","unstructured":"Canas, G., & Rosasco, L. (2012). Learning probability measures with respect to optimal transport metrics. In Advances in neural information processing systems, (Vol.\u00a025)."},{"key":"6231_CR11","doi-asserted-by":"crossref","unstructured":"Chen, Q., Liu, Y., Wang, Z., Wassell, I., & Chetty, K. (2018). Re-weighted adversarial adaptation network for unsupervised domain adaptation. In Proceedings of the IEEE conference on computer vision and pattern recognition, (pp. 7976\u20137985).","DOI":"10.1109\/CVPR.2018.00832"},{"key":"6231_CR12","doi-asserted-by":"crossref","unstructured":"Courty, N., Flamary, R., Habrard, A., & Rakotomamonjy, A. (2017). Joint distribution optimal transportation for domain adaptation. In Advances in neural information processing systems.","DOI":"10.1109\/TPAMI.2016.2615921"},{"issue":"9","key":"6231_CR13","doi-asserted-by":"publisher","first-page":"1853","DOI":"10.1109\/TPAMI.2016.2615921","volume":"39","author":"N Courty","year":"2016","unstructured":"Courty, N., Flamary, R., Tuia, D., & Rakotomamonjy, A. (2016). Optimal transport for domain adaptation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 39(9), 1853\u20131865.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"6231_CR14","unstructured":"Cuturi, M. (2013). Sinkhorn distances: Lightspeed computation of optimal transport. In Advances in neural information processing systems\u00a026 ."},{"key":"6231_CR15","unstructured":"Cuturi, M., & Doucet, A. (2014). Fast computation of wasserstein barycenters. In International conference on machine learning, (pp. 685\u2013693). PMLR."},{"key":"6231_CR16","doi-asserted-by":"crossref","unstructured":"Damodaran, B.B., Kellenberger, B., Flamary, R., Tuia, D., & Courty, N. (2018). Deepjdot: Deep joint distribution optimal transport for unsupervised domain adaptation. In Proceedings of the European conference on computer vision (ECCV), (pp. 447\u2013463).","DOI":"10.1007\/978-3-030-01225-0_28"},{"key":"6231_CR17","doi-asserted-by":"crossref","unstructured":"Dhillon, I., Guan, Y., & Kulis, B. (2004). Kernel k-means: spectral clustering and normalized cuts. In Proceedings of the tenth international conference on Knowledge discovery and data mining.","DOI":"10.1145\/1014052.1014118"},{"key":"6231_CR18","unstructured":"Dhouib, S., Redko, I., & Lartizien, C. (2020). Margin-aware adversarial domain adaptation with optimal transport. In International conference on machine learning, (pp. 2514\u20132524). PMLR."},{"key":"6231_CR19","doi-asserted-by":"crossref","unstructured":"Ding, C., He, X., & Simon, H.D. (2005). On the equivalence of nonnegative matrix factorization and spectral clustering. In Proceedings of the SIAM international conference on data mining.","DOI":"10.1137\/1.9781611972757.70"},{"key":"6231_CR20","unstructured":"Donahue, J., Jia, Y., Vinyals, O., Hoffman, J., Zhang, N., Tzeng, E., & Darrell, T. (2014) Decaf: A deep convolutional activation feature for generic visual recognition. In ICML, (pp. 647\u2013655). PMLR."},{"key":"6231_CR21","first-page":"226","volume":"96","author":"M Ester","year":"1996","unstructured":"Ester, M., Kriegel, H. P., Sander, J., Xu, X., et al. (1996). A density-based algorithm for discovering clusters in large spatial databases with noise. In kdd, 96, 226\u2013231.","journal-title":"In kdd"},{"key":"6231_CR22","doi-asserted-by":"crossref","unstructured":"Fei-Fei, L., Fergus, R., & Perona, P. (2004). Learning generative visual models from few training examples: An incremental bayesian approach tested on 101 object categories. In 2004 conference on computer vision and pattern recognition workshop, (pp. 178\u2013178). IEEE.","DOI":"10.1109\/CVPR.2004.383"},{"key":"6231_CR23","doi-asserted-by":"crossref","unstructured":"Fernando, B., Habrard, A., Sebban, M., & Tuytelaars, T. (2013). Unsupervised visual domain adaptation using subspace alignment. In Proceedings of the IEEE ICCV, (pp. 2960\u20132967).","DOI":"10.1109\/ICCV.2013.368"},{"issue":"3","key":"6231_CR24","doi-asserted-by":"publisher","first-page":"1853","DOI":"10.1137\/130929886","volume":"7","author":"S Ferradans","year":"2014","unstructured":"Ferradans, S., Papadakis, N., Peyr\u00e9, G., & Aujol, J. F. (2014). Regularized discrete optimal transport. SIAM Journal on Imaging Sciences, 7(3), 1853\u20131882.","journal-title":"SIAM Journal on Imaging Sciences"},{"key":"6231_CR25","unstructured":"Ganin, Y., & Lempitsky, V. (2015). Unsupervised domain adaptation by backpropagation. In International conference on machine learning, (pp. 1180\u20131189). PMLR."},{"issue":"1","key":"6231_CR26","first-page":"2096","volume":"17","author":"Y Ganin","year":"2016","unstructured":"Ganin, Y., Ustinova, E., Ajakan, H., Germain, P., Larochelle, H., Laviolette, F., et al. (2016). Domain-adversarial training of neural networks. JMLR, 17(1), 2096\u20132030.","journal-title":"JMLR"},{"key":"6231_CR27","unstructured":"Germain, P., Habrard, A., Laviolette, F., & Morvant, E. (2013). A pac-bayesian approach for domain adaptation with specialization to linear classifiers. In International conference on machine learning, (pp. 738\u2013746). PMLR."},{"issue":"7","key":"6231_CR28","doi-asserted-by":"publisher","first-page":"1414","DOI":"10.1109\/TPAMI.2016.2599532","volume":"39","author":"M Ghifary","year":"2016","unstructured":"Ghifary, M., Balduzzi, D., Kleijn, W. B., & Zhang, M. (2016). Scatter component analysis: A unified framework for domain adaptation and domain generalization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 39(7), 1414\u20131430.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"6231_CR29","doi-asserted-by":"crossref","unstructured":"Gong, B., Shi, Y., Sha, F., & Grauman, K. (2012). Geodesic flow kernel for unsupervised domain adaptation. In 2012 IEEE conference on computer vision and pattern recognition, (pp. 2066\u20132073).","DOI":"10.1109\/CVPR.2012.6247911"},{"key":"6231_CR30","unstructured":"Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., & Bengio, Y. (2014). Generative adversarial nets. NIPS\u201914."},{"key":"6231_CR31","unstructured":"Gu, M., Zha, H., Ding, C., He, X., Simon, H., & Xia, J. (2001). Spectral relaxation models and structure analysis for k-way graph clustering and bi-clustering ."},{"key":"6231_CR32","doi-asserted-by":"crossref","unstructured":"He, K., Zhang, X., Ren, S., & Sun, J. (2016). Deep residual learning for image recognition. In Proceedings of the IEEE conference on computer vision and pattern recognition, (pp. 770\u2013778).","DOI":"10.1109\/CVPR.2016.90"},{"key":"6231_CR33","unstructured":"Ho, N., Nguyen, X., Yurochkin, M., Bui, H.H., Huynh, V., & Phung, D. (2017). Multilevel clustering via wasserstein means. In International conference on machine learning, (pp. 1501\u20131509)."},{"issue":"5","key":"6231_CR34","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1109\/34.291440","volume":"16","author":"JJ Hull","year":"1994","unstructured":"Hull, J. J. (1994). A database for handwritten text recognition research. IEEE Transactions on Pattern Analysis and Machine Intelligence, 16(5), 550\u2013554.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"6231_CR35","unstructured":"Izzo, Z., Silwal, S., & Zhou, S. (2021). Dimensionality reduction for wasserstein barycenter. In Advances in neural information processing systems\u00a034 ."},{"key":"6231_CR36","first-page":"199","volume":"37","author":"LV Kantorovich","year":"1942","unstructured":"Kantorovich, L. V. (1942). On the translocation of masses. In Doklady Akademii Nauk USSR (NS), 37, 199\u2013201.","journal-title":"In Doklady Akademii Nauk USSR (NS)"},{"key":"6231_CR37","doi-asserted-by":"crossref","unstructured":"Knight, P.A. (2008). The sinkhorn\u2013knopp algorithm: convergence and applications. SIAM Journal on Matrix Analysis and Applications\u00a030(1) .","DOI":"10.1137\/060659624"},{"key":"6231_CR38","doi-asserted-by":"crossref","unstructured":"Kotsiantis, S.B., Zaharakis, I., & Pintelas, P. et\u00a0al. (2007). Supervised machine learning: A review of classification techniques. Emerging Artificial Intelligence Applications in Computer Engineering 3\u201324.","DOI":"10.1007\/s10462-007-9052-3"},{"issue":"3","key":"6231_CR39","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1109\/TPAMI.2019.2945942","volume":"43","author":"WM Kouw","year":"2019","unstructured":"Kouw, W. M., & Loog, M. (2019). A review of domain adaptation without target labels. IEEE Transactions on Pattern Analysis and Machine Intelligence, 43(3), 766\u2013785.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"6231_CR40","unstructured":"Kroshnin, A., Tupitsa, N., Dvinskikh, D., Dvurechensky, P., Gasnikov, A., & Uribe, C. (2019). On the complexity of approximating wasserstein barycenters. In International conference on machine learning, (pp. 3530\u20133540). PMLR."},{"key":"6231_CR41","unstructured":"LeCun, Y. (1998). The mnist database of handwritten digits. http:\/\/yann.lecun.com\/exdb\/mnist\/ ."},{"key":"6231_CR42","unstructured":"Lee, J., Dabagia, M., Dyer, E., & Rozell, C. (2019). Hierarchical optimal transport for multimodal distribution alignment. In Advances in neural information processing systems, (Vol.\u00a032)."},{"key":"6231_CR43","doi-asserted-by":"crossref","unstructured":"Li, M., Zhai, Y.M., Luo, Y.W., Ge, P.F., & Ren, C.X. (2020). Enhanced transport distance for unsupervised domain adaptation. In Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition, (pp. 13936\u201313944).","DOI":"10.1109\/CVPR42600.2020.01395"},{"key":"6231_CR44","unstructured":"Long, M., Cao, Y., Wang, J., & Jordan, M. (2015). Learning transferable features with deep adaptation networks. In International conference on machine learning, (pp. 97\u2013105). PMLR."},{"key":"6231_CR45","doi-asserted-by":"crossref","unstructured":"Long, M., Wang, J., Ding, G., Sun, J., & Yu, P.S. (2013). Transfer feature learning with joint distribution adaptation. In Proceedings of the IEEE international conference on computer vision.","DOI":"10.1109\/ICCV.2013.274"},{"key":"6231_CR46","unstructured":"Long, M., Zhu, H., Wang, J., & Jordan, M.I. (2017). Deep transfer learning with joint adaptation networks. In International conference on machine learning, (pp. 2208\u20132217). PMLR."},{"key":"6231_CR47","unstructured":"MacQueen, J. et\u00a0al. (1967). Some methods for classification and analysis of multivariate observations. In Proceedings of the fifth Berkeley symposium on mathematical statistics and probability."},{"key":"6231_CR48","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s10208-011-9093-5","volume":"11","author":"F M\u00e9moli","year":"2011","unstructured":"M\u00e9moli, F. (2011). Gromov-wasserstein distances and the metric approach to object matching. Foundations of Computational Mathematics, 11, 417\u2013487.","journal-title":"Foundations of Computational Mathematics"},{"key":"6231_CR49","unstructured":"Monge, G. (1781). M\u00e9moire sur la th\u00e9orie des d\u00e9blais et des remblais. Histoire de l\u2019Acad\u00e9mie Royale des Sciences de Paris ."},{"issue":"2","key":"6231_CR50","first-page":"380","volume":"7","author":"A Musdholifah","year":"2013","unstructured":"Musdholifah, A., Hashim, S. Z. M., & Zaiton, S. (2013). Cluster analysis on high-dimensional data: A comparison of density-based clustering algorithms. Australian Journal of Basic and Applied Sciences, 7(2), 380\u2013389.","journal-title":"Australian Journal of Basic and Applied Sciences"},{"key":"6231_CR51","unstructured":"Ng, A.Y., Jordan, M.I., & Weiss, Y. (2002). On spectral clustering: Analysis and an algorithm. In Advances in neural information processing systems, (pp. 849\u2013856)."},{"issue":"2","key":"6231_CR52","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1109\/TNN.2010.2091281","volume":"22","author":"SJ Pan","year":"2010","unstructured":"Pan, S. J., Tsang, I. W., Kwok, J. T., & Yang, Q. (2010). Domain adaptation via transfer component analysis. IEEE Transactions on Neural Networks, 22(2), 199\u2013210.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"6231_CR53","doi-asserted-by":"crossref","unstructured":"Pan, S.J., & Yang, Q. (2009). A survey on transfer learning. IEEE Transactions on Knowledge and Data Engineering\u00a022(10) .","DOI":"10.1109\/TKDE.2009.191"},{"key":"6231_CR54","doi-asserted-by":"crossref","unstructured":"Parthasarathy, K.R. (2005). Probability measures on metric spaces, (Vol 352). American Mathematical Society.","DOI":"10.1090\/chel\/352"},{"key":"6231_CR55","doi-asserted-by":"crossref","unstructured":"Pele, O., & Werman, M. (2009). Fast and robust earth mover\u2019s distances. In 2009 IEEE 12th international conference on computer vision, (pp. 460\u2013467). IEEE.","DOI":"10.1109\/ICCV.2009.5459199"},{"key":"6231_CR56","doi-asserted-by":"crossref","unstructured":"Peyr\u00e9, G., Cuturi, M. et\u00a0al. (2019). Computational optimal transport: With applications to data science. Foundations and Trends\u00ae in Machine Learning\u00a011(5-6): 355\u2013607 .","DOI":"10.1561\/2200000073"},{"issue":"2","key":"6231_CR57","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1109\/TIT.1982.1056481","volume":"28","author":"D Pollard","year":"1982","unstructured":"Pollard, D. (1982). Quantization and the method of k-means. IEEE Transactions on Information Theory, 28(2), 199\u2013205.","journal-title":"IEEE Transactions on Information Theory"},{"key":"6231_CR58","unstructured":"Redko, I., Courty, N., Flamary, R., & Tuia, D. (2019). Optimal transport for multi-source domain adaptation under target shift. In The 22nd AISTATS, (pp. 849\u2013858). PMLR."},{"key":"6231_CR59","volume-title":"Advances in domain adaptation theory","author":"I Redko","year":"2019","unstructured":"Redko, I., Morvant, E., Habrard, A., Sebban, M., & Bennani, Y. (2019). Advances in domain adaptation theory. Elsevier."},{"issue":"4","key":"6231_CR60","doi-asserted-by":"publisher","first-page":"A2013","DOI":"10.1137\/130907367","volume":"35","author":"S Reich","year":"2013","unstructured":"Reich, S. (2013). A nonparametric ensemble transform method for bayesian inference. SIAM Journal on Scientific Computing, 35(4), A2013\u2013A2024.","journal-title":"SIAM Journal on Scientific Computing"},{"key":"6231_CR61","doi-asserted-by":"crossref","unstructured":"Saenko, K., Kulis, B., Fritz, M., & Darrell, T. (2010). Adapting visual category models to new domains. In European conference on computer vision, (pp. 213\u2013226). Springer.","DOI":"10.1007\/978-3-642-15561-1_16"},{"key":"6231_CR62","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-319-20828-2","volume-title":"Optimal transport for applied mathematicians","author":"F Santambrogio","year":"2015","unstructured":"Santambrogio, F. (2015). Optimal transport for applied mathematicians (pp. 55\u201358-63). Birk\u00e4user."},{"key":"6231_CR63","doi-asserted-by":"crossref","unstructured":"Schmitzer, B., & Schn\u00f6rr, C. (2013). A hierarchical approach to optimal transport. In International conference on scale space and variational methods in computer vision, (pp. 452\u2013464). Springer.","DOI":"10.1007\/978-3-642-38267-3_38"},{"issue":"5","key":"6231_CR64","doi-asserted-by":"publisher","first-page":"1299","DOI":"10.1162\/089976698300017467","volume":"10","author":"B Sch\u00f6lkopf","year":"1998","unstructured":"Sch\u00f6lkopf, B., Smola, A., & M\u00fcller, K. R. (1998). Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation, 10(5), 1299\u20131319.","journal-title":"Neural Computation"},{"key":"6231_CR65","doi-asserted-by":"crossref","unstructured":"Shen, J., Qu, Y., Zhang, W., & Yu, Y. (2018). Wasserstein distance guided representation learning for domain adaptation. In Thirty-second AAAI conference on artificial intelligence.","DOI":"10.1609\/aaai.v32i1.11784"},{"issue":"8","key":"6231_CR66","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi, J., & Malik, J. (2000). Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8), 888\u2013905.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"2","key":"6231_CR67","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/S0378-3758(00)00115-4","volume":"90","author":"H Shimodaira","year":"2000","unstructured":"Shimodaira, H. (2000). Improving predictive inference under covariate shift by weighting the log-likelihood function. Journal of Statistical Planning and Inference, 90(2), 227\u2013244.","journal-title":"Journal of Statistical Planning and Inference"},{"key":"6231_CR68","unstructured":"Stella, X.Y., & Shi, J. (2003). Multiclass spectral clustering. In Computer vision, IEEE international conference on, (Vol\u00a02, pp. 313\u2013313). IEEE Computer Society."},{"issue":"1","key":"6231_CR69","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s11511-006-0002-8","volume":"196","author":"KT Sturm","year":"2006","unstructured":"Sturm, K. T. (2006). On the geometry of metric measure spaces. Acta Mathematica, 196(1), 65\u2013131.","journal-title":"Acta Mathematica"},{"key":"6231_CR70","unstructured":"Sugiyama, M., Nakajima, S., Kashima, H., Von\u00a0Buenau, P., & Kawanabe, M. (2007). Direct importance estimation with model selection and its application to covariate shift adaptation. In NIPS."},{"key":"6231_CR71","doi-asserted-by":"crossref","unstructured":"Taherkhani, F., Dabouei, A., Soleymani, S., Dawson, J., & Nasrabadi, N.M. (2020). Transporting labels via hierarchical optimal transport for semi-supervised learning. In ECCV, (pp. 509\u2013526).","DOI":"10.1007\/978-3-030-58548-8_30"},{"key":"6231_CR72","unstructured":"Tsironis, S., Sozio, M., Vazirgiannis, M., & Poltechnique, L. (2013). Accurate spectral clustering for community detection in mapreduce. In Advances in neural information processing systems (NIPS) workshops, (p. 8). Citeseer."},{"key":"6231_CR73","volume-title":"The nature of statistical learning theory","author":"V Vapnik","year":"2013","unstructured":"Vapnik, V. (2013). The nature of statistical learning theory. Springer."},{"key":"6231_CR74","doi-asserted-by":"crossref","unstructured":"Venkateswara, H., Eusebio, J., Chakraborty, S., & Panchanathan, S. (2017). Deep hashing network for unsupervised domain adaptation. In Proceedings of the IEEE conference on computer vision and pattern recognition, (pp. 5018\u20135027).","DOI":"10.1109\/CVPR.2017.572"},{"key":"6231_CR75","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71050-9","volume-title":"Optimal transport: old and new","author":"C Villani","year":"2009","unstructured":"Villani, C. (2009). Optimal transport: old and new. Springer."},{"issue":"5","key":"6231_CR76","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3400066","volume":"11","author":"G Wilson","year":"2020","unstructured":"Wilson, G., & Cook, D. J. (2020). A survey of unsupervised deep domain adaptation. ACM Transactions on Intelligent Systems and Technology (TIST), 11(5), 1\u201346.","journal-title":"ACM Transactions on Intelligent Systems and Technology (TIST)"},{"key":"6231_CR77","doi-asserted-by":"crossref","unstructured":"Xu, R., Liu, P., Wang, L., Chen, C., & Wang, J. (2020). Reliable weighted optimal transport for unsupervised domain adaptation. In Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition, (pp. 4394\u20134403).","DOI":"10.1109\/CVPR42600.2020.00445"},{"key":"6231_CR78","doi-asserted-by":"crossref","unstructured":"Yan, D., Huang, L., & Jordan, M.I. (2009). Fast approximate spectral clustering. In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, (pp. 907\u2013916).","DOI":"10.1145\/1557019.1557118"},{"key":"6231_CR79","unstructured":"Yurochkin, M., Claici, S., Chien, E., Mirzazadeh, F., & Solomon, J.M. (2019). Hierarchical optimal transport for document representation. In Advances in neural information processing systems."},{"key":"6231_CR80","unstructured":"Zha, H., He, X., Ding, C., Gu, M., & Simon, H.D. (2001). Spectral relaxation for k-means clustering. In Advances in neural information processing systems, (pp. 1057\u20131064)."},{"key":"6231_CR81","unstructured":"Zhang, Y., Liu, T., Long, M., & Jordan, M. (2019). Bridging theory and algorithm for domain adaptation. In International conference on machine learning, (pp. 7404\u20137413). PMLR."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-022-06231-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-022-06231-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-022-06231-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T00:02:55Z","timestamp":1696032175000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-022-06231-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,30]]},"references-count":81,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["6231"],"URL":"https:\/\/doi.org\/10.1007\/s10994-022-06231-7","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,30]]},"assertion":[{"value":"21 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not Applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not Applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not Applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not Applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}