{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T19:09:14Z","timestamp":1771268954379,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,25]],"date-time":"2019-07-25T00:00:00Z","timestamp":1564012800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"China Hebei Provincial Department of Human Resources","award":["CL201723"],"award-info":[{"award-number":["CL201723"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,25]]},"DOI":"10.1145\/3292500.3330983","type":"proceedings-article","created":{"date-parts":[[2019,7,26]],"date-time":"2019-07-26T13:17:26Z","timestamp":1564147046000},"page":"1141-1151","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":47,"title":["Multi-task Recurrent Neural Networks and Higher-order Markov Random Fields for Stock Price Movement Prediction"],"prefix":"10.1145","author":[{"given":"Chang","family":"Li","sequence":"first","affiliation":[{"name":"UBTECH Sydney AI Centre, SCS, University of Sydney & Capital Markets CRC, Australia, Sydney, NB, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongjin","family":"Song","sequence":"additional","affiliation":[{"name":"NEC Laboratories America, Inc., Princeton, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dacheng","family":"Tao","sequence":"additional","affiliation":[{"name":"UBTECH Sydney AI Centre, SCS, University of Sydney, Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1093\/rfs\/8.2.401"},{"key":"e_1_3_2_1_2_1","volume-title":"Neural machine translation by jointly learning to align and translate. arXiv preprint arXiv:1409.0473","author":"Bahdanau Dzmitry","year":"2014","unstructured":"Dzmitry Bahdanau , Kyunghyun Cho , and Yoshua Bengio . 2014. Neural machine translation by jointly learning to align and translate. arXiv preprint arXiv:1409.0473 ( 2014 ). Dzmitry Bahdanau, Kyunghyun Cho, and Yoshua Bengio. 2014. Neural machine translation by jointly learning to align and translate. arXiv preprint arXiv:1409.0473 (2014)."},{"key":"e_1_3_2_1_3_1","volume-title":"Pattern Recognition and Machine Learning","author":"Bishop Christopher M.","unstructured":"Christopher M. Bishop . 2006. Pattern Recognition and Machine Learning . Springer . Christopher M. Bishop. 2006. Pattern Recognition and Machine Learning .Springer."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00341-9"},{"key":"e_1_3_2_1_5_1","volume-title":"Boykov and Marie-Pierre Jolly","author":"Yuri","year":"2001","unstructured":"Yuri Y. Boykov and Marie-Pierre Jolly . 2001 . Interactive Graph Cuts for Optimal Boundary and Region Segmentation of Objects in N-D Images. In ICCV . Yuri Y. Boykov and Marie-Pierre Jolly. 2001. Interactive Graph Cuts for Optimal Boundary and Region Segmentation of Objects in N-D Images. In ICCV ."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1093\/rfs\/6.4.799"},{"key":"e_1_3_2_1_7_1","volume-title":"In Proceedings of the 1993 Connectionist Models Summer School. Citeseer.","author":"Caruana Richard A","year":"1993","unstructured":"Richard A Caruana . 1993 . Multitask connectionist learning . In In Proceedings of the 1993 Connectionist Models Summer School. Citeseer. Richard A Caruana. 1993. Multitask connectionist learning. In In Proceedings of the 1993 Connectionist Models Summer School. Citeseer."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1111\/0022-1082.00231"},{"key":"e_1_3_2_1_9_1","volume-title":"Time-variation in expected returns. Journal of business","author":"Conrad Jennifer","year":"1988","unstructured":"Jennifer Conrad and Gautam Kaul . 1988. Time-variation in expected returns. Journal of business ( 1988 ), 409--425. Jennifer Conrad and Gautam Kaul. 1988. Time-variation in expected returns. Journal of business (1988), 409--425."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1086\/294849"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.143"},{"key":"e_1_3_2_1_12_1","unstructured":"Stephen Gould. 2011. Max-margin Learning for Lower Linear Envelope Potentials in Binary Markov Random Fields. In ICML .   Stephen Gould. 2011. Max-margin Learning for Lower Linear Envelope Potentials in Binary Markov Random Fields. In ICML ."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2366760"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1475-6803.1997.tb00259.x"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.13.3.388"},{"key":"e_1_3_2_1_16_1","volume-title":"A joint many-task model: Growing a neural network for multiple NLP tasks. arXiv preprint arXiv:1611.01587","author":"Hashimoto Kazuma","year":"2016","unstructured":"Kazuma Hashimoto , Caiming Xiong , Yoshimasa Tsuruoka , and Richard Socher . 2016. A joint many-task model: Growing a neural network for multiple NLP tasks. arXiv preprint arXiv:1611.01587 ( 2016 ). Kazuma Hashimoto, Caiming Xiong, Yoshimasa Tsuruoka, and Richard Socher. 2016. A joint many-task model: Growing a neural network for multiple NLP tasks. arXiv preprint arXiv:1611.01587 (2016)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1093\/revfin\/hhm003"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2003.1233908"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Hiroshi Ishikawa. 2009. Higher-Order Clique Reduction in Binary Graph Cut. In CVPR .  Hiroshi Ishikawa. 2009. Higher-Order Clique Reduction in Binary Graph Cut. In CVPR .","DOI":"10.1109\/CVPR.2009.5206689"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.2469\/faj.v23.n6.77"},{"key":"e_1_3_2_1_22_1","volume-title":"Technical analysis: the complete resource for financial market technicians","author":"Dahlquist Charles D","unstructured":"Charles D Kirkpatrick II and Julie A Dahlquist . 2010. Technical analysis: the complete resource for financial market technicians . FT press . Charles D Kirkpatrick II and Julie A Dahlquist. 2010. Technical analysis: the complete resource for financial market technicians .FT press."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Pushmeet Kohli and M. Pawan Kumar. 2010. Energy Minimization for Linear Envelope MRFs. In CVPR .  Pushmeet Kohli and M. Pawan Kumar. 2010. Energy Minimization for Linear Envelope MRFs. In CVPR .","DOI":"10.1109\/CVPR.2010.5539858"},{"key":"e_1_3_2_1_24_1","volume-title":"Torr","author":"Kohli Pushmeet","year":"2007","unstructured":"Pushmeet Kohli , M. Pawan Kumar , and Philip H. S . Torr . 2007 . P3 & Beyond: Solving Energies with Higher Order Cliques. In CVPR . Pushmeet Kohli, M. Pawan Kumar, and Philip H. S. Torr. 2007. P3 & Beyond: Solving Energies with Higher Order Cliques. In CVPR ."},{"key":"e_1_3_2_1_25_1","volume-title":"Torr","author":"Kohli Pushmeet","year":"2008","unstructured":"Pushmeet Kohli , Lubor Ladicky , and Philip H. S . Torr . 2008 . Graph Cuts for Minimizing Higher Order Potentials . Technical Report. Microsoft Research . Pushmeet Kohli, Lubor Ladicky, and Philip H. S. Torr. 2008. Graph Cuts for Minimizing Higher Order Potentials . Technical Report. Microsoft Research."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-008-0202-0"},{"key":"e_1_3_2_1_27_1","volume-title":"Neural architectures for named entity recognition. arXiv preprint arXiv:1603.01360","author":"Lample Guillaume","year":"2016","unstructured":"Guillaume Lample , Miguel Ballesteros , Sandeep Subramanian , Kazuya Kawakami , and Chris Dyer . 2016. Neural architectures for named entity recognition. arXiv preprint arXiv:1603.01360 ( 2016 ). Guillaume Lample, Miguel Ballesteros, Sandeep Subramanian, Kazuya Kawakami, and Chris Dyer. 2016. Neural architectures for named entity recognition. arXiv preprint arXiv:1603.01360 (2016)."},{"key":"e_1_3_2_1_28_1","volume-title":"When are contrarian profits due to stock market overreaction? The review of financial studies","author":"Lo Andrew W","year":"1990","unstructured":"Andrew W Lo and A Craig MacKinlay . 1990. When are contrarian profits due to stock market overreaction? The review of financial studies , Vol. 3 , 2 ( 1990 ), 175--205. Andrew W Lo and A Craig MacKinlay. 1990. When are contrarian profits due to stock market overreaction? The review of financial studies , Vol. 3, 2 (1990), 175--205."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-6261.1970.tb00518.x"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-6261.1996.tb02711.x"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-405X(93)90030-F"},{"key":"e_1_3_2_1_32_1","volume-title":"Characteristics of risk and return in risk arbitrage. the Journal of Finance","author":"Mitchell Mark","year":"2001","unstructured":"Mark Mitchell and Todd Pulvino . 2001. Characteristics of risk and return in risk arbitrage. the Journal of Finance , Vol. 56 , 6 ( 2001 ), 2135--2175. Mark Mitchell and Todd Pulvino. 2001. Characteristics of risk and return in risk arbitrage. the Journal of Finance , Vol. 56, 6 (2001), 2135--2175."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1561\/0600000033"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-6419.2007.00519.x"},{"key":"e_1_3_2_1_35_1","volume-title":"A Dual-Stage Attention-Based Recurrent Neural Network for Time Series Prediction. arXiv preprint arXiv:1704.02971","author":"Qin Yao","year":"2017","unstructured":"Yao Qin , Dongjin Song , Haifeng Cheng , Wei Cheng , Guofei Jiang , and Garrison Cottrell . 2017. A Dual-Stage Attention-Based Recurrent Neural Network for Time Series Prediction. arXiv preprint arXiv:1704.02971 ( 2017 ). Yao Qin, Dongjin Song, Haifeng Cheng, Wei Cheng, Guofei Jiang, and Garrison Cottrell. 2017. A Dual-Stage Attention-Based Recurrent Neural Network for Time Series Prediction. arXiv preprint arXiv:1704.02971 (2017)."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Carsten Rother Pushmeet Kohli Wei Feng and Jiaya Jia. 2009. Minimizing Sparse Higher Order Energy Functions of Discrete Variables. In CVPR .  Carsten Rother Pushmeet Kohli Wei Feng and Jiaya Jia. 2009. Minimizing Sparse Higher Order Energy Functions of Discrete Variables. In CVPR .","DOI":"10.1109\/CVPR.2009.5206739"},{"key":"e_1_3_2_1_37_1","volume-title":"An overview of multi-task learning in deep neural networks. arXiv preprint arXiv:1706.05098","author":"Ruder Sebastian","year":"2017","unstructured":"Sebastian Ruder . 2017. An overview of multi-task learning in deep neural networks. arXiv preprint arXiv:1706.05098 ( 2017 ). Sebastian Ruder. 2017. An overview of multi-task learning in deep neural networks. arXiv preprint arXiv:1706.05098 (2017)."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P16-2038"},{"key":"e_1_3_2_1_39_1","volume-title":"Meyer","author":"Song Dongjin","year":"2015","unstructured":"Dongjin Song , Wei Liu , Tianyi Zhou , Dacheng Tao , and David A . Meyer . 2015 . Efficient Robust Conditional Random Fields. IEEE Transactions on Image Processing (T-IP) ( 2015), 3124--3136. Dongjin Song, Wei Liu, Tianyi Zhou, Dacheng Tao, and David A. Meyer. 2015. Efficient Robust Conditional Random Fields. IEEE Transactions on Image Processing (T-IP) (2015), 3124--3136."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88688-4_43"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102464"},{"key":"e_1_3_2_1_42_1","unstructured":"Ioannis Tsochantaridis Thorsten Joachims Thomas Hofmann and Yasemin Altun. 2005. Large margin methods for structured and interdependent output variables. In Journal of Machine Learning Research. 1453--1484.   Ioannis Tsochantaridis Thorsten Joachims Thomas Hofmann and Yasemin Altun. 2005. Large margin methods for structured and interdependent output variables. In Journal of Machine Learning Research. 1453--1484."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2017.02.005"},{"key":"e_1_3_2_1_45_1","volume-title":"Graphrnn: Generating realistic graphs with deep auto-regressive models. In ICML . 5694--5703.","author":"You Jiaxuan","year":"2018","unstructured":"Jiaxuan You , Rex Ying , Xiang Ren , William Hamilton , and Jure Leskovec . 2018 . Graphrnn: Generating realistic graphs with deep auto-regressive models. In ICML . 5694--5703. Jiaxuan You, Rex Ying, Xiang Ren, William Hamilton, and Jure Leskovec. 2018. Graphrnn: Generating realistic graphs with deep auto-regressive models. In ICML . 5694--5703."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553523"},{"key":"e_1_3_2_1_47_1","first-page":"1033","article-title":"The concave-convex procedure (CCCP)","volume":"2","author":"Yuille Alan L","year":"2002","unstructured":"Alan L Yuille , Anand Rangarajan , and AL Yuille . 2002 . The concave-convex procedure (CCCP) . NIPS , Vol. 2 (2002), 1033 -- 1040 . Alan L Yuille, Anand Rangarajan, and AL Yuille. 2002. The concave-convex procedure (CCCP). NIPS , Vol. 2 (2002), 1033--1040.","journal-title":"NIPS"}],"event":{"name":"KDD '19: The 25th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Anchorage AK USA","acronym":"KDD '19","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3292500.3330983","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3292500.3330983","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:26:04Z","timestamp":1750206364000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3292500.3330983"}},"subtitle":["Multi-task RNN and Higer-order MRFs for Stock Price Classification"],"short-title":[],"issued":{"date-parts":[[2019,7,25]]},"references-count":46,"alternative-id":["10.1145\/3292500.3330983","10.1145\/3292500"],"URL":"https:\/\/doi.org\/10.1145\/3292500.3330983","relation":{},"subject":[],"published":{"date-parts":[[2019,7,25]]},"assertion":[{"value":"2019-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}