{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T05:23:54Z","timestamp":1755926634718},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,12,15]],"date-time":"2021-12-15T00:00:00Z","timestamp":1639526400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,12,15]],"date-time":"2021-12-15T00:00:00Z","timestamp":1639526400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,12,15]],"date-time":"2021-12-15T00:00:00Z","timestamp":1639526400000},"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":[],"published-print":{"date-parts":[[2021,12,15]]},"DOI":"10.1109\/bigdata52589.2021.9671557","type":"proceedings-article","created":{"date-parts":[[2022,1,13]],"date-time":"2022-01-13T20:39:16Z","timestamp":1642106356000},"source":"Crossref","is-referenced-by-count":5,"title":["Dynamic Length Factorization Machines for CTR Prediction"],"prefix":"10.1109","author":[{"given":"Yohay","family":"Kaplan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yair","family":"Koren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rina","family":"Leibovits","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oren","family":"Somekh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"ref11","article-title":"ExcUseMe: asking users to help in item cold-start recommendations","author":"drachsler-cohen","year":"0","journal-title":"Proc of RecSys"},{"key":"ref12","first-page":"2121","article-title":"Adaptive subgradient methods for online learning and stochastic optimization","author":"duchi","year":"2011","journal-title":"The Journal of Machine Learning Research"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1257\/aer.97.1.242"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2005.10.010"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052569"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2648584.2648589"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403288"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3041021.3054185"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2959100.2959134"},{"key":"ref28","article-title":"A practical incremental method to train deep ctr models","author":"wang","year":"2020"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187838"},{"key":"ref27","article-title":"F M2: Field-matrixed factorization machines for recommender systems","author":"sun","year":"0","journal-title":"Proc WWW’2011"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357801"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357821"},{"key":"ref29","article-title":"Autoemb: Automated embedding dimensionality search in streaming recommendations","author":"zhao","year":"2020"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741109"},{"key":"ref8","article-title":"Differentiable neural input search for recommender systems","author":"cheng","year":"2020"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1345448.1345465"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3041021.3054184"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3109859.3109880"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2507157.2507221"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2011.09.006"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2788582"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2488200"},{"key":"ref23","article-title":"Follow-the-regularized-leader and mirror descent: Equivalence theorems and l1 regularization","author":"mcmahan","year":"2011","journal-title":"Proc of the International Conference on Artificial Intelligence and Statistics"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.127"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186040"}],"event":{"name":"2021 IEEE International Conference on Big Data (Big Data)","location":"Orlando, FL, USA","start":{"date-parts":[[2021,12,15]]},"end":{"date-parts":[[2021,12,18]]}},"container-title":["2021 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9671263\/9671273\/09671557.pdf?arnumber=9671557","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:55:34Z","timestamp":1652201734000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9671557\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,15]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/bigdata52589.2021.9671557","relation":{},"subject":[],"published":{"date-parts":[[2021,12,15]]}}}