{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T00:16:02Z","timestamp":1771546562360,"version":"3.50.1"},"reference-count":73,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1109\/tkde.2024.3446581","type":"journal-article","created":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T18:42:11Z","timestamp":1726080131000},"page":"8758-8772","source":"Crossref","is-referenced-by-count":5,"title":["Mining User Consistent and Robust Preference for Unified Cross Domain Recommendation"],"prefix":"10.1109","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5483-0366","authenticated-orcid":false,"given":"Xiaolin","family":"Zheng","sequence":"first","affiliation":[{"name":"College of Computer Science, Zhejiang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4115-7667","authenticated-orcid":false,"given":"Weiming","family":"Liu","sequence":"additional","affiliation":[{"name":"College of Computer Science, Zhejiang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1419-964X","authenticated-orcid":false,"given":"Chaochao","family":"Chen","sequence":"additional","affiliation":[{"name":"College of Computer Science, Zhejiang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6899-4174","authenticated-orcid":false,"given":"Jiajie","family":"Su","sequence":"additional","affiliation":[{"name":"College of Computer Science, Zhejiang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinting","family":"Liao","sequence":"additional","affiliation":[{"name":"College of Computer Science, Zhejiang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mengling","family":"Hu","sequence":"additional","affiliation":[{"name":"College of Computer Science, Zhejiang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3526-6859","authenticated-orcid":false,"given":"Yanchao","family":"Tan","sequence":"additional","affiliation":[{"name":"College of Computer and Data Science, Fuzhou University, Fuzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/7503.003.0022"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557262"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531967"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00211"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3532073"},{"key":"ref6","first-page":"1542","article-title":"Graph optimal transport for cross-domain alignment","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3522762"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401043"},{"key":"ref9","first-page":"2292","article-title":"Sinkhorn distances: Lightspeed computation of optimal transport","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Cuturi"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-0716-2197-4_13"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.5555\/2946645.2946704"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052569"},{"key":"ref13","first-page":"1","article-title":"beta-VAE: Learning basic visual concepts with a constrained variational framework","volume":"3","author":"Higgins","year":"2017","journal-title":"Proc. Int. Conf. Learn. Representations (Poster)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271684"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01219-9_11"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/367"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3583780.3614945"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/273"},{"key":"ref19","article-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2014"},{"issue":"4","key":"ref20","first-page":"2052","article-title":"Can movies and books collaborate?: Cross-domain collaborative filtering for sparsity reduction","volume":"38","author":"Li","year":"2009","journal-title":"Sun Yat-sen Univ."},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553454"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3074395"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186150"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412012"},{"key":"ref25","first-page":"700","article-title":"Unsupervised image-to-image translation networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Liu"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/245"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531975"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3233789"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583366"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i8.28728"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645331"},{"key":"ref32","first-page":"19223","article-title":"Leveraging distribution alignment via stein path for cross-domain cold-start recommendation","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Liu"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512166"},{"key":"ref34","article-title":"Conditional adversarial domain adaptation","author":"Long","year":"2017"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403147"},{"key":"ref36","article-title":"Learning disentangled representations for recommendation","author":"Ma","year":"2019"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/343"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3340631.3394870"},{"key":"ref39","first-page":"7850","article-title":"Outlier-robust optimal transport","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Mukherjee"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1018"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2010.2091281"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2013.01.003"},{"key":"ref43","article-title":"Multisample flow matching: Straightening flows with minibatch couplings","author":"Pooladian","year":"2023"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371831"},{"key":"ref45","article-title":"A DIRT-T approach to unsupervised domain adaptation","author":"Shu","year":"2018"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49409-8_35"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49409-8_35"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01424-7_27"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00093"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00135"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441759"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.316"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.3390\/a13090212"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330989"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3290973"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3290973"},{"key":"ref57","first-page":"433","article-title":"A fast proximal point method for computing exact wasserstein distance","volume-title":"Proc. Uncertainty Artif. Intell. Conf.","author":"Xie"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403264"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/587"},{"key":"ref60","article-title":"Central moment discrepancy (CMD) for domain-invariant representation learning","author":"Zellinger","year":"2017"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33015773"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2875144"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3253168"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/355"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401169"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1145\/3583780.3615058"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583263"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3324912"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1145\/3583780.3614676"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357992"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/639"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3104873"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2020.3004555"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/69\/10750897\/10678864.pdf?arnumber=10678864","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T00:35:50Z","timestamp":1732667750000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10678864\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12]]},"references-count":73,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2024.3446581","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12]]}}}