{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:15:04Z","timestamp":1740132904515,"version":"3.37.3"},"reference-count":54,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62172381"],"award-info":[{"award-number":["62172381"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Multimedia"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/tmm.2022.3193560","type":"journal-article","created":{"date-parts":[[2022,7,27]],"date-time":"2022-07-27T19:23:43Z","timestamp":1658949823000},"page":"5516-5526","source":"Crossref","is-referenced-by-count":2,"title":["Learning Fashion Compatibility With Context Conditioning Embedding"],"prefix":"10.1109","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6941-981X","authenticated-orcid":false,"given":"Zhi","family":"Lu","sequence":"first","affiliation":[{"name":"School of Information and Communication Engineering, University of Electronic Science and Technology of China, Chengdu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0379-1525","authenticated-orcid":false,"given":"Yang","family":"Hu","sequence":"additional","affiliation":[{"name":"School of Information Science and Technology, University of Science and Technology of China, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6744-021X","authenticated-orcid":false,"given":"Cong","family":"Yu","sequence":"additional","affiliation":[{"name":"School of Information and Communication Engineering, University of Electronic Science and Technology of China, Chengdu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3227-4562","authenticated-orcid":false,"given":"Yan","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Cyber Science and Technology, University of Science and Technology of China, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4491-7967","authenticated-orcid":false,"given":"Bing","family":"Zeng","sequence":"additional","affiliation":[{"name":"School of Information and Communication Engineering, University of Electronic Science and Technology of China, Chengdu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2021.3059514"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2020.3018021"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3054775"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2852750"},{"key":"ref53","article-title":"Rethinking infoNCE: How many negative samples do you need?","author":"wu","year":"2021","journal-title":"arXiv 2105 13003"},{"key":"ref52","first-page":"8024","article-title":"Pytorch: An imperative style, high-performance deep learning library","author":"paszke","year":"0","journal-title":"Proc Adv Int Conf Neural Inf Process Syst"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2021.3062736"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313444"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/3529466.3529472"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00337"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3132068"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298682"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2017.2785253"},{"key":"ref51","first-page":"1929","article-title":"Dropout: A simple way to prevent neural networks from overfitting","volume":"15","author":"srivastava","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"article-title":"Representation learning with contrastive predictive coding","year":"2018","author":"oord","key":"ref46"},{"key":"ref45","first-page":"1597","article-title":"A simple framework for contrastive learning of visual representations","author":"chen","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref48","first-page":"2787","article-title":"Translating embeddings for modeling multi-relational data","author":"bordes","year":"2013","journal-title":"Proc Adv Int Conf Neural Inf Process Syst"},{"key":"ref47","first-page":"5171","article-title":"On variational bounds of mutual information","author":"poole","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i01.5362"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139035613"},{"key":"ref43","first-page":"1","article-title":"Graph attention networks","author":"veli?kovi?","year":"2018","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref49","first-page":"1","article-title":"Gated graph sequence neural networks","author":"li","year":"0","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.01253"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3394171.3413936"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2017.2690144"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.01081"},{"key":"ref3","first-page":"403","article-title":"TransNCFM: Translation-based neural fashion compatibility modeling","author":"yang","year":"0","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3123266.3123394"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.01290"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401080"},{"key":"ref35","first-page":"5998","article-title":"Attention is all you need","author":"vaswani","year":"0","journal-title":"Proc Adv Int Conf Neural Inf Process Syst"},{"key":"ref34","first-page":"2275","article-title":"Recommending outfits from personal closet","author":"tangseng","year":"0","journal-title":"Proc IEEE Int Conf Comput Vis"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.aiopen.2021.01.001"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2019.2906603"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767755"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00914"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.193"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.527"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.01047"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01270-0_24"},{"article-title":"Learning color compatibility in fashion outfits","year":"2020","author":"zhang","key":"ref39"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/WACV45572.2020.9093555"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3447239"},{"key":"ref23","first-page":"18661","article-title":"Supervised Contrastive Learning","author":"khosla","year":"0","journal-title":"Proc Adv Int Conf Neural Inf Process Syst"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883037"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.5244\/C.29.51"},{"key":"ref20","first-page":"1857","article-title":"Improved deep metric learning with multi-class n-pair loss objective","author":"sohn","year":"2016","journal-title":"Proc Adv Int Conf Neural Inf Process Syst"},{"key":"ref22","first-page":"1","article-title":"On variational lower bounds of mutual information","author":"poole","year":"0","journal-title":"Proc Int Conf Adv Neural Inf Process Syst Workshop"},{"key":"ref21","first-page":"1473","article-title":"Distance metric learning for large margin nearest neighbor classification","volume":"18","author":"weinberger","year":"0","journal-title":"Proc Adv Int Conf Neural Inf Process Syst"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2020.3025062"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.163"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00050"}],"container-title":["IEEE Transactions on Multimedia"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6046\/10016790\/09843934.pdf?arnumber=9843934","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T20:00:54Z","timestamp":1701115254000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9843934\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":54,"URL":"https:\/\/doi.org\/10.1109\/tmm.2022.3193560","relation":{},"ISSN":["1520-9210","1941-0077"],"issn-type":[{"type":"print","value":"1520-9210"},{"type":"electronic","value":"1941-0077"}],"subject":[],"published":{"date-parts":[[2023]]}}}