{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T12:14:31Z","timestamp":1768997671810,"version":"3.49.0"},"reference-count":56,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/access.2024.3351283","type":"journal-article","created":{"date-parts":[[2024,1,8]],"date-time":"2024-01-08T19:57:22Z","timestamp":1704743842000},"page":"6879-6899","source":"Crossref","is-referenced-by-count":10,"title":["BiLSTCAN: A Novel SRS-Based Bidirectional Long Short-Term Capsule Attention Network for Dynamic User Preference and Next-Item Recommendation"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-9966-3524","authenticated-orcid":false,"given":"Nikorn","family":"Kannikaklang","sequence":"first","affiliation":[{"name":"College of Computing, Khon Kaen University, Khon Kaen, Thailand"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8691-285X","authenticated-orcid":false,"given":"Wachirawut","family":"Thamviset","sequence":"additional","affiliation":[{"name":"College of Computing, Khon Kaen University, Khon Kaen, Thailand"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4689-3006","authenticated-orcid":false,"given":"Sartra","family":"Wongthanavasu","sequence":"additional","affiliation":[{"name":"College of Computing, Khon Kaen University, Khon Kaen, Thailand"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3004656"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/546"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3027380"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISPA-BDCloud-SustainCom-SocialCom48970.2019.00139"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2959100.2959190"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TASLP.2018.2851151"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2781233"},{"key":"ref8","first-page":"1","article-title":"Long short-term memory based recurrent neural network architectures for large vocabulary speech recognition","volume":"10","author":"Sak","year":"2014","journal-title":"Comput. Sci."},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICCIA49625.2020.00013"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21735-7_6"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2023.3236527"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3289751"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISRITI54043.2021.9702863"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3164982"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331216"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401243"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357814"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.108817"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/883"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3281981"},{"key":"ref21","first-page":"3859","article-title":"Dynamic routing between capsules","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Sabour"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00857"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/d19-1551"},{"key":"ref24","first-page":"1","article-title":"Capsule graph neural network","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Xinyi"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3219076"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2022.3200890"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2019.2918310"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/MLBDBI51377.2020.00102"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113452"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.118565"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2020.06.025"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2952099"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.11.010"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2993289"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2022.3148675"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3050407"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3151618"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.116036"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2019.2947174"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2021.02.015"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2023.110809"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.iswa.2022.200070"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/11550907_126"},{"key":"ref44","first-page":"1","article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. Conf. 3rd Int. Conf. for Learn. Represent.","author":"Kingma"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1017\/9781139051699.031"},{"key":"ref46","article-title":"An overview of gradient descent optimization algorithms","author":"Ruder","year":"2016","journal-title":"arXiv:1609.04747"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729586"},{"key":"ref48","first-page":"2121","article-title":"Adaptive subgradient methods for online learning and stochastic optimization","volume":"12","author":"Duchi","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref49","article-title":"ADADELTA: An adaptive learning rate method","author":"Zeiler","year":"2012","journal-title":"arXiv:1212.5701"},{"key":"ref50","first-page":"1","article-title":"Incorporating Nesterov momentum into Adam","volume-title":"Proc. 4th Int. Conf. Learn. Represent.","author":"Dozat"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2021.04.025"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/3339363.3339370"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772773"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2018.00035"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33015709"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330984"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10380310\/10384332.pdf?arnumber=10384332","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,18]],"date-time":"2024-01-18T02:01:00Z","timestamp":1705543260000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10384332\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":56,"URL":"https:\/\/doi.org\/10.1109\/access.2024.3351283","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}