{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T13:27:29Z","timestamp":1767706049077,"version":"3.37.3"},"reference-count":60,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"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":["62176005"],"award-info":[{"award-number":["62176005"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Social Science Fund of China","award":["2022CC02195"],"award-info":[{"award-number":["2022CC02195"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1109\/tkde.2024.3374373","type":"journal-article","created":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:52:15Z","timestamp":1710269535000},"page":"4398-4410","source":"Crossref","is-referenced-by-count":5,"title":["Agree to Disagree: Personalized Temporal Embedding and Routing for Stock Forecast"],"prefix":"10.1109","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5716-4565","authenticated-orcid":false,"given":"Heyuan","family":"Wang","sequence":"first","affiliation":[{"name":"School of Computer Science, National Engineering Laboratory for Big Data Analysis and Applications, Peking University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7395-5567","authenticated-orcid":false,"given":"Tengjiao","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science, National Engineering Laboratory for Big Data Analysis and Applications, Peking University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1299-4933","authenticated-orcid":false,"given":"Shun","family":"Li","sequence":"additional","affiliation":[{"name":"University of International Relations, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-9136-8122","authenticated-orcid":false,"given":"Jiayi","family":"Zheng","sequence":"additional","affiliation":[{"name":"School of Computer Science, National Engineering Laboratory for Big Data Analysis and Applications, Peking University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0206-3246","authenticated-orcid":false,"given":"Weijun","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Computer Science, National Engineering Laboratory for Big Data Analysis and Applications, Peking University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4069-6423","authenticated-orcid":false,"given":"Wei","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Computer Science, National Engineering Laboratory for Big Data Analysis and Applications, Peking University, Beijing, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1257\/089533003321164958"},{"issue":"6","key":"ref2","first-page":"500","article-title":"Stock market forecasting techniques: Literature survey","volume":"5","author":"Rajput","year":"2016","journal-title":"Int. J. Comput. Sci. Mobile Comput."},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3269269"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.eacl-main.185"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098117"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i1.16127"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/366"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/640"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/810"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467358"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-6261.2010.01628.x"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfineco.2012.05.011"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.3905\/jpm.2007.698034"},{"article-title":"Investment clock special report 1: Making money from macro","year":"2004","author":"Greetham","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219822"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3178128"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1142\/9781860949739_0006"},{"key":"ref18","first-page":"2327","article-title":"Deep learning for event-driven stock prediction","volume-title":"Proc. Int. Joint Conf. Artif. Intell.","author":"Ding","year":"2015"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3269286"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i01.5445"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.acl-long.526"},{"article-title":"Stock market trend analysis using hidden Markov models","year":"2013","author":"Kavitha","key":"ref22"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.06.040"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0180944"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/508"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i02.5587"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113820"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/641"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/551"},{"key":"ref30","first-page":"2292","article-title":"Sinkhorn distances: Lightspeed computation of optimal transport","volume-title":"Proc. 26th Int. Conf. Neural Inf. Process. Syst.","author":"Cuturi","year":"2013"},{"key":"ref31","first-page":"10","article-title":"Domain generalization via invariant feature representation","volume-title":"Proc. 30th Int. Conf. Mach. Learn.","author":"Muandet","year":"2013"},{"article-title":"Invariant risk minimization","year":"2019","author":"Arjovsky","key":"ref32"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11596"},{"key":"ref34","first-page":"1126","article-title":"Model-agnostic meta-learning for fast adaptation of deep networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Finn","year":"2017"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014739"},{"key":"ref36","article-title":"Robust and generalizable visual representation learning via random convolutions","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Xu","year":"2021"},{"key":"ref37","article-title":"Domain generalization with mixstyle","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Zhou","year":"2021"},{"article-title":"Self-tuning networks: Bilevel optimization of hyperparameters using structured best-response functions","year":"2019","author":"MacKay","key":"ref38"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330884"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3488560.3498479"},{"key":"ref41","first-page":"3267","article-title":"Language modeling with recurrent highway hypernetworks","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Suarez","year":"2017"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/WACV51458.2022.00205"},{"key":"ref43","first-page":"9489","article-title":"Personalized federated learning using hypernetworks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Shamsian","year":"2021"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450095"},{"key":"ref45","first-page":"13226","article-title":"On infinite-width hypernetworks","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Littwin","year":"2020"},{"key":"ref46","first-page":"10409","article-title":"On the modularity of hypernetworks","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Galanti","year":"2020"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jam.2240218"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3309547"},{"key":"ref49","first-page":"2177","article-title":"Neural word embedding as implicit matrix factorization","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Levy","year":"2014"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467415"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330877"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00745"},{"article-title":"Categorical reparameterization with Gumbel-Softmax","year":"2016","author":"Jang","key":"ref53"},{"key":"ref54","first-page":"4541","article-title":"Modeling the stock relation with graph network for overnight stock movement prediction","volume-title":"Proc. Int. Joint Conf. Artif. Intell.","author":"Li","year":"2021"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/DSC.2018.00114"},{"key":"ref56","first-page":"2160","article-title":"Stock market trend prediction using ARIMA-based neural networks","volume-title":"Proc. Int. Conf. Neural Netw.","author":"Wang","year":"1996"},{"article-title":"HATS: A hierarchical graph attention network for stock movement prediction","year":"2019","author":"Kim","key":"ref57"},{"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."},{"article-title":"Adam: A method for stochastic optimization","year":"2014","author":"Kingma","key":"ref59"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2010.09.022"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/10629652\/10462534.pdf?arnumber=10462534","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T05:53:27Z","timestamp":1723182807000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10462534\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9]]},"references-count":60,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2024.3374373","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":[[2024,9]]}}}