{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:22:43Z","timestamp":1740169363488,"version":"3.37.3"},"reference-count":29,"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:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100017649","name":"Research Matching Grant Scheme from the Hong Kong Government","doi-asserted-by":"publisher","award":["RMGS2021_8_06"],"award-info":[{"award-number":["RMGS2021_8_06"]}],"id":[{"id":"10.13039\/501100017649","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001747","name":"Hong Kong Baptist University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001747","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/access.2023.3330779","type":"journal-article","created":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T19:14:58Z","timestamp":1699384498000},"page":"128633-128643","source":"Crossref","is-referenced-by-count":0,"title":["Toward Memory-Efficient and Interpretable Factorization Machines via Data and Model Binarization"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3729-5477","authenticated-orcid":false,"given":"Yu","family":"Geng","sequence":"first","affiliation":[{"name":"Department of Computer Science, Hong Kong Baptist University, Kowloon Tsai, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0427-977X","authenticated-orcid":false,"given":"Liang","family":"Lan","sequence":"additional","affiliation":[{"name":"Department of Interactive Media, Hong Kong Baptist University, Kowloon Tsai, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7428-2050","authenticated-orcid":false,"given":"William K.","family":"Cheung","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Hong Kong Baptist University, Kowloon Tsai, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.127"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00994018"},{"key":"ref3","first-page":"1425","article-title":"Scaling up kernel SVM on limited resources: A low-rank linearization approach","volume-title":"Proc. Artif. Intell. Statist.","author":"Zhang"},{"key":"ref4","first-page":"3103","article-title":"Breaking the curse of kernelization: Budgeted stochastic gradient descent for large-scale SVM training","volume":"13","author":"Wang","year":"2012","journal-title":"J. Mach. Learn. Res."},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080777"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/319"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014139"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2903403"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/435"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/239"},{"key":"ref11","first-page":"2223","article-title":"Nonlinear learning using local coordinate coding","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"22","author":"Yu"},{"article-title":"Optimizing locally linear classifiers with supervised anchor point learning","volume-title":"Proc. 24th Int. Joint Conf. Artif. Intell.","author":"Mao","key":"ref12"},{"key":"ref13","first-page":"4107","article-title":"Binarized neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hubara"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46493-0_32"},{"article-title":"An empirical study of binary neural networks\u2019 optimisation","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Alizadeh","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080767"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/479"},{"key":"ref18","article-title":"Estimating or propagating gradients through stochastic neurons for conditional computation","author":"Bengio","year":"2013","journal-title":"arXiv:1308.3432"},{"issue":"7","key":"ref19","first-page":"1","article-title":"Adaptive subgradient methods for online learning and stochastic optimization","volume":"12","author":"Duchi","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-2604-3_16"},{"issue":"4","key":"ref21","first-page":"1","article-title":"Training and testing low-degree polynomial data mappings via linear SVM","volume":"11","author":"Chang","year":"2010","journal-title":"J. Mach. Learn. Res."},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718498"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772773"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2168752.2168771"},{"issue":"184","key":"ref25","first-page":"1","article-title":"fastm: A library for factorization machines","volume":"17","author":"Bayer","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718881"},{"key":"ref27","article-title":"An overview of gradient descent optimization algorithms","author":"Ruder","year":"2016","journal-title":"arXiv:1609.04747"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-377-6.50032-3"},{"key":"ref29","first-page":"1871","article-title":"LIBLINEAR: A library for large linear classification","volume":"9","author":"Fan","year":"2008","journal-title":"J. Mach. Learn. Res."}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10005208\/10310141.pdf?arnumber=10310141","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,13]],"date-time":"2024-04-13T04:48:12Z","timestamp":1712983692000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10310141\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/access.2023.3330779","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2023]]}}}