{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T08:50:16Z","timestamp":1765356616120,"version":"3.37.3"},"reference-count":52,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":["61631005","61832017","61976198","U1605251"],"award-info":[{"award-number":["61631005","61832017","61976198","U1605251"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/tkde.2019.2951386","type":"journal-article","created":{"date-parts":[[2019,11,4]],"date-time":"2019-11-04T20:41:16Z","timestamp":1572900076000},"page":"1-1","source":"Crossref","is-referenced-by-count":16,"title":["Discrete Matrix Factorization and Extension for Fast Item Recommendation"],"prefix":"10.1109","author":[{"given":"Defu","family":"Lian","sequence":"first","affiliation":[]},{"given":"Xing","family":"Xie","sequence":"additional","affiliation":[]},{"given":"Enhong","family":"Chen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020480"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2911489"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2507157.2507168"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1080\/10556789808805690"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/0806020"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052694"},{"journal-title":"Matrix Analysis","year":"1990","author":"horn","key":"ref37"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s002110050432"},{"key":"ref35","first-page":"1","article-title":"A variational approach to Bayesian logistic regression models and their extensions","author":"jaakkola","year":"1997","journal-title":"Proc 6th Int Workshop Artif Intell Statistics"},{"key":"ref34","first-page":"1753","article-title":"Spectral hashing","author":"weiss","year":"2009","journal-title":"Proc 21st Int Conf Neural Inf Process Syst"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.22"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/479"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783346"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883049"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242610"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098008"},{"key":"ref22","first-page":"769","article-title":"A survey on learning to hash","volume":"40","author":"wang","year":"2017"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2487976"},{"key":"ref24","first-page":"389","article-title":"Collaborative filtering on a budget","author":"karatzoglou","year":"2010","journal-title":"Proc 13th Int Conf Artif Intell Statist"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2009937"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159688"},{"key":"ref25","first-page":"1669","article-title":"Discrete personalized ranking for fast collaborative filtering from implicit feedback","author":"zhang","year":"2017","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref50","first-page":"452","article-title":"BPR: Bayesian personalized ranking from implicit feedback","author":"rendle","year":"2009","journal-title":"Proc 25th Conf Uncertainty Artif Intell"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557029"},{"key":"ref52","first-page":"3619","article-title":"SVDFeature: A toolkit for feature-based collaborative filtering","volume":"13","author":"chen","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6248043"},{"key":"ref40","first-page":"720","article-title":"Weighted low-rank approximations","author":"srebro","year":"2003","journal-title":"Proc 20th Int Conf Int Conf Mach Learn"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.48"},{"key":"ref12","first-page":"331","article-title":"Fast approximate nearest neighbors with automatic algorithm configuration","author":"muja","year":"2009","journal-title":"Proc 4th Int Conf Comput Vision Theory Appl"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502098"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.275"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339611"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2600428.2609578"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2911502"},{"key":"ref18","first-page":"1","article-title":"Maximum margin matrix factorization for collaborative ranking","author":"weimer","year":"2007","journal-title":"Proc 20th Int Conf Neural Inf Process Syst"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2010.936019"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052569"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939863"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220023"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/504"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.99"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052639"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/549"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2699960"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186150"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939673"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783273"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783381"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.193"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080777"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/2168752.2168771"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/4358933\/08890891.pdf?arnumber=8890891","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:50:47Z","timestamp":1652194247000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8890891\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":52,"URL":"https:\/\/doi.org\/10.1109\/tkde.2019.2951386","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"type":"print","value":"1041-4347"},{"type":"electronic","value":"1558-2191"},{"type":"electronic","value":"2326-3865"}],"subject":[],"published":{"date-parts":[[2019]]}}}