{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:53:21Z","timestamp":1772909601098,"version":"3.50.1"},"reference-count":61,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/tkde.2021.3100564","type":"journal-article","created":{"date-parts":[[2021,7,29]],"date-time":"2021-07-29T20:18:01Z","timestamp":1627589881000},"page":"1-1","source":"Crossref","is-referenced-by-count":17,"title":["Graph-Convolved Factorization Machines for Personalized Recommendation"],"prefix":"10.1109","author":[{"given":"Yongsen","family":"Zheng","sequence":"first","affiliation":[]},{"given":"Pengxu","family":"Wei","sequence":"additional","affiliation":[]},{"given":"Ziliang","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Liang","family":"Lin","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2015.03.008"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.elerap.2018.01.012"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2569096"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2607172"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.127"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/239"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/435"},{"key":"ref8","first-page":"3351","article-title":"Higher-order factorization machines","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Blondel"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2959100.2959134"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080777"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220023"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186040"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2013.6639346"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3158369"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/MMUL.2012.26"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCE.2019.2924177"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.11.003"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2620140"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-018-3857-7"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2789445"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2661760"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2593720"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1016\/j.compeleceng.2018.05.004","article-title":"Intelligent optimal route recommendation among heterogeneous objects with keywords","volume":"68","author":"Ashokkumar","year":"2018","journal-title":"Comput. Elect. Eng."},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10726"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2647868.2654940"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.573"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/DSC.2017.15"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3109453.3109462"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICGI.2017.17"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2647868.2654940"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CBMI.2018.8516495"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2988450.2988454"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3124749.3124754"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219823"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357925"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3298689.3347043"},{"key":"ref37","first-page":"850","article-title":"Polynomial networks and factorization machines: New insights and efficient training algorithms","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Blondel"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"ref39","first-page":"3844","article-title":"Convolutional neural networks on graphs with fast localized spectral filtering","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Defferrard"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1039\/C9SC01992H"},{"key":"ref41","article-title":"SociaLGCN: An efficient graph convolutional network based model for social recommendation","author":"Wu","year":"2018"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219890"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s11192-020-03561-y"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/667"},{"key":"ref45","article-title":"Graph convolutional matrix completion","author":"Berg","year":"2017"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331283"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2019.00165"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331267"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357951"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.01.023"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.3150\/bj\/1106314846"},{"key":"ref52","first-page":"1","article-title":"Foundations of the PARAFAC procedure: Models and conditions for an \u201cexplanatory","volume":"16","author":"Harshman","year":"1970","journal-title":"UCLA Working Papers Phonetics"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1175\/1520-0493(2001)129<0540:EDAASM>2.0.CO;2"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1115"},{"key":"ref55","article-title":"Bayesian optimization with exponential convergence","author":"Kawaguchi","year":"2016"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.30645\/ijistech.v1i1.4"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-16399-0_5"},{"issue":"1","key":"ref58","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":"ref59","first-page":"265","article-title":"Tensorflow: A system for large-scale machine learning","volume-title":"Proc. Symp. Oper. Syst. Des. Implement.","author":"Abadi"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-211-89836-9_1424"},{"key":"ref61","article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Diederik"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/4358933\/09501971.pdf?arnumber=9501971","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T23:39:04Z","timestamp":1705016344000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9501971\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":61,"URL":"https:\/\/doi.org\/10.1109\/tkde.2021.3100564","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}