{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T11:23:24Z","timestamp":1770290604073,"version":"3.49.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"36","license":[{"start":{"date-parts":[[2024,9,27]],"date-time":"2024-09-27T00:00:00Z","timestamp":1727395200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,9,27]],"date-time":"2024-09-27T00:00:00Z","timestamp":1727395200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s00521-024-10425-6","type":"journal-article","created":{"date-parts":[[2024,9,27]],"date-time":"2024-09-27T08:02:59Z","timestamp":1727424179000},"page":"22829-22844","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A benchmark for graph-based dynamic recommendation systems"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-8044-3919","authenticated-orcid":false,"given":"Tyler","family":"Wallett","sequence":"first","affiliation":[]},{"given":"Amir","family":"Jafari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,27]]},"reference":[{"issue":"43","key":"10425_CR1","first-page":"1","volume":"24","author":"VP Dwivedi","year":"2022","unstructured":"Dwivedi VP, Joshi CK, Laurent LuuATT, Bengio Y, Bresson X (2022) Benchmarking graph neural networks. J Mach Learn Res 24(43):1\u201348","journal-title":"J Mach Learn Res"},{"key":"10425_CR2","unstructured":"Cai D, Hu J, Zhao Q, Qian S, Fang Q, Xu C (2021) Grecx: An efficient and unified benchmark for GNN-based recommendation. arXiv preprint arXiv:2111.10342"},{"key":"10425_CR3","doi-asserted-by":"crossref","unstructured":"Zhu J, Dai Q, Su L, Ma R, Liu J, Cai G, Xiao X, Zhang R (2022) Bars: Towards open benchmarking for recommender systems","DOI":"10.1145\/3477495.3531723"},{"key":"10425_CR4","unstructured":"Fey M, Lenssen JE (2019) Fast graph representation learning with PyTorch Geometric. In: ICLR Workshop on Representation Learning on Graphs and Manifolds"},{"key":"10425_CR5","unstructured":"Hamilton W, Ying Z, Leskovec J (2017) Inductive representation learning on large graphs. Advances in neural information processing systems. 30"},{"issue":"1","key":"10425_CR6","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TPAMI.2010.57","volume":"33","author":"Herv\u00e9 J\u00e9gou","year":"2011","unstructured":"J\u00e9gou Herv\u00e9, Douze Matthijs, Schmid Cordelia (2011) Product quantization for nearest neighbor search. IEEE Trans Pattern Anal Mach Intell 33(1):117\u2013128","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"10425_CR7","unstructured":"Liu S, Lu H, Shao J (2015) Improved Residual Vector Quantization for High-dimensional Approximate Nearest Neighbor Search. arXiv preprint arXiv:1509.05195"},{"key":"10425_CR8","unstructured":"Wei D, Moses C, Li K (2011) Efficient k-nearest neighbor graph construction for generic similarity measures. In: Proceedings of the 20th International Conference on World Wide Web, pp 577\u2013586. ACM"},{"key":"10425_CR9","unstructured":"Zhu J, Dai Q, Su L, Ma R, Liu J, Cai G, Xiao X, Zhang R (2024) Bars: towards open benchmarking for recommender systems"},{"key":"10425_CR10","unstructured":"Hu W, Liu B, Gomes J, Zitnik M, Liang P, Pande V, Leskovec J (2020) Strategies for pre-training graph neural networks. arXiv preprint arXiv:1905.12265"},{"key":"10425_CR11","doi-asserted-by":"crossref","unstructured":"Monti F, Boscaini D, Masci J, Rodola E, Svoboda J, Bronstein MM (2016) Geometric deep learning on graphs and manifolds using mixture model CNNS. pp 5115-5124","DOI":"10.1109\/CVPR.2017.576"},{"key":"10425_CR12","doi-asserted-by":"crossref","unstructured":"Fey M, Lenssen JE, Weichert F, M\u00fcller H. Splinecnn (2018) Fast geometric deep learning with continuous b-spline kernels. pp 869-877","DOI":"10.1109\/CVPR.2018.00097"},{"key":"10425_CR13","unstructured":"Gilmer J, Schoenholz SS, Riley PF, Vinyals O, Dahl GE (2017) Neural message passing for quantum chemistry. pp 1263-1272"},{"key":"10425_CR14","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.120.145301","volume":"120","author":"Tian Xie","year":"2018","unstructured":"Xie Tian, Grossman Jeffrey C (2018) Crystal graph convolutional neural networks for an accurate and interpretable prediction of material properties. Phys Rev Lett 120:145301","journal-title":"Phys Rev Lett"},{"key":"10425_CR15","first-page":"17009","volume":"33","author":"J You","year":"2021","unstructured":"You J, Ying Z, Leskovec J (2021) Design space for graph neural networks. Adv Neural Inf Process Syst 33:17009\u201317021","journal-title":"Adv Neural Inf Process Syst"},{"key":"10425_CR16","unstructured":"Duvenaud DK, Maclaurin D, Iparraguirre J, Bombarell R, Hirzel T, Aspuru-Guzik A, Adams RP (2015) Convolutional networks on graphs for learning molecular fingerprints. Advances in neural information processing systems. 28"},{"key":"10425_CR17","doi-asserted-by":"crossref","unstructured":"Bo D, Wang X, Shi C, Shen H (2021) Beyond low-frequency information in graph convolutional networks","DOI":"10.1609\/aaai.v35i5.16514"},{"key":"10425_CR18","first-page":"19746","volume":"35","author":"D Buterez","year":"2022","unstructured":"Buterez D, Janet JP, Kiddle SJ, Oglic D, Li\u00f2 P (2022) Graph neural networks with adaptive readouts. Adv Neural Inf Process Syst 35:19746\u201358","journal-title":"Adv Neural Inf Process Syst"},{"key":"10425_CR19","unstructured":"Morris C, Ritzert M, Fey M, Hamilton WL, Lenssen JE, Rattan G, Grohe M (2021) Weisfeiler and leman go neural: Higher-order graph neural networks"},{"key":"10425_CR20","unstructured":"Bresson X, Laurent T (2018) Residual gated graph convnets"},{"key":"10425_CR21","unstructured":"Veli\u010dkovi\u0107 P, Cucurull G, Casanova A, Romero A, Li\u00f2 P, Bengio Y (2018) Graph attention networks"},{"key":"10425_CR22","unstructured":"Brody S, Alon U, Yahav E (2022) How attentive are graph attention networks?. arXiv preprint arXiv:2105.14491"},{"key":"10425_CR23","doi-asserted-by":"crossref","unstructured":"Shi Y, Huang Z, Feng S, Zhong H, Wang W, Sun Y (2020 ) Masked label prediction: Unified message passing model for semi-supervised classification. arXiv preprint arXiv:2009.03509","DOI":"10.24963\/ijcai.2021\/214"},{"key":"10425_CR24","unstructured":"Vaswani A, Shazeer N, Parmar N, Uszkoreit J, Llion J, Aidan NG, Lukasz K, Illia P (2023) Attention is all you need"},{"key":"10425_CR25","unstructured":"Xu K, Hu W, Leskovec J, Jegelka S(2019) How powerful are graph neural networks?"},{"issue":"5","key":"10425_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3326362","volume":"38","author":"Y Wang","year":"2019","unstructured":"Wang Y, Sun Y, Liu Z, Sarma SE, Bronstein MM, Solomon JM (2019) Dynamic graph CNN for learning on point clouds. ACM Transactions on Graphics (tog). 38(5):1\u20132","journal-title":"ACM Transactions on Graphics (tog)."},{"key":"10425_CR27","doi-asserted-by":"crossref","unstructured":"Verma N, Boyer E, Verbeek J (2018) Feastnet: Feature-steered graph convolutions for 3d shape analysis","DOI":"10.1109\/CVPR.2018.00275"},{"key":"10425_CR28","doi-asserted-by":"crossref","unstructured":"Ranjan E, Sanyal S, Talukdar P (2020) Asap: Adaptive structure aware pooling for learning hierarchical graph representations","DOI":"10.1609\/aaai.v34i04.5997"},{"key":"10425_CR29","unstructured":"Li G, Xiong C, Thabet A, Ghanem B (2020) Deepergcn: All you need to train deeper GCNS. arXiv preprint arXiv:2006.07739"},{"key":"10425_CR30","unstructured":"Togninalli M, Ghisu E, Llinares-L\u00f3pez F, Rieck B, Borgwardt K (2019) Wasserstein weisfeiler-lehman graph kernels. Advances in neural information processing systems. 32"},{"issue":"4","key":"10425_CR31","first-page":"1","volume":"5","author":"FM Harper","year":"2015","unstructured":"Harper FM, Konstan JA (2015) The movielens datasets: History and context. ACM Transactions on Interactive Intelligent Systems (TiiS) 5(4):1\u201319","journal-title":"ACM Transactions on Interactive Intelligent Systems (TiiS)"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-024-10425-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-024-10425-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-024-10425-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T20:04:25Z","timestamp":1732651465000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-024-10425-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,27]]},"references-count":31,"journal-issue":{"issue":"36","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["10425"],"URL":"https:\/\/doi.org\/10.1007\/s00521-024-10425-6","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,27]]},"assertion":[{"value":"16 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 August 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors affirm that there are no conflict of interest that could influence the objectivity or integrity of the research reported in this paper. We declare that we have no financial or personal relationships with individuals or organizations that could inappropriately influence our work. Neither have we received any financial support or compensation related to the subject matter of this paper. Additionally, we do not hold any patents or patent applications relevant to the content of the paper nor have we received funding from organizations that may have a vested interest in the outcome of this research. Furthermore, we have no professional or personal affiliations that may be perceived as a conflict of interest in connection with the work presented in this paper. By declaring no conflict of interest, we uphold the principles of integrity and transparency in scientific research, ensuring the credibility and ethical conduct of this study.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}