{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T05:10:07Z","timestamp":1746594607788,"version":"3.40.5"},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12371515","62176225","62171391"],"award-info":[{"award-number":["12371515","62176225","62171391"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/access.2025.3564895","type":"journal-article","created":{"date-parts":[[2025,4,28]],"date-time":"2025-04-28T17:34:23Z","timestamp":1745861663000},"page":"75204-75219","source":"Crossref","is-referenced-by-count":0,"title":["Feature Reweighting-Based Factorization Machine for Effective Learning Latent Representation"],"prefix":"10.1109","volume":"13","author":[{"given":"Xiebing","family":"Chen","sequence":"first","affiliation":[{"name":"Department of Automation, Xiamen University, Xiamen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5805-072X","authenticated-orcid":false,"given":"Bilian","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Automation, Xiamen University, Xiamen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Automation, Xiamen University, Xiamen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6388-1413","authenticated-orcid":false,"given":"Langcai","family":"Cao","sequence":"additional","affiliation":[{"name":"Department of Automation, Xiamen University, Xiamen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3539618.3591681"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403314"},{"key":"ref3","first-page":"1","article-title":"Learning to attend and to rank with word-entity duets","volume-title":"Proc. Annu. Int. ACM SIGIR Conf. Res. Develop. Inf.","author":"Xiong"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539238"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.119615"},{"key":"ref6","first-page":"1","article-title":"Visual classification via description from large language models","volume-title":"Proc. 11th Int. Conf. Learn. Represent.","author":"Menon"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-16-4016-2_16"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00803"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2988450.2988454"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2010002"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939704"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441727"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.127"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449930"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-020-01921-y"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/564376.564419"},{"key":"ref17","first-page":"1","article-title":"Foundations of the parafac procedure: Models and conditions for an \u2018explanatory\u2019 multi-modal factor analysis","volume":"16","author":"Harshman","year":"1970","journal-title":"UCLA Work. Papers Phonetics"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401944"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718498"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772773"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080777"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i4.25577"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357925"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3583780.3615089"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/435"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/SKG.2014.26"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2556195.2556240"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2959100.2959134"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186040"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3539597.3570384"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3240323.3240356"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00125"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.105470"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.09.067"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.6119"},{"key":"ref36","first-page":"1","article-title":"Causal factorization machine for robust recommendation","volume-title":"Proc. ACM\/IEEE Joint Conf. Digit. Libraries (JCDL)","author":"Li"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.108326"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/239"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/545"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462941"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271759"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33013804"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/434"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/3523227.3546789"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2023.3279412"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0051"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974348.13"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098063"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331196"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103589"},{"key":"ref51","first-page":"3359","article-title":"Higher-order factorization machines","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"29","author":"Blondel"},{"issue":"1","key":"ref52","first-page":"6783","article-title":"Factorization machines with regularization for sparse feature interactions","volume":"22","author":"Atarashi","year":"2020","journal-title":"J. Mach. Learn. Res."},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450078"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220023"},{"key":"ref56","first-page":"1","article-title":"Multi-output polynomial networks and factorization machines","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Blondel"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2024.129181"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/10978851.pdf?arnumber=10978851","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T04:31:19Z","timestamp":1746592279000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10978851\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":57,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3564895","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2025]]}}}