{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,21]],"date-time":"2026-06-21T00:50:00Z","timestamp":1782003000511,"version":"3.54.5"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031087509","type":"print"},{"value":"9783031087516","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-08751-6_39","type":"book-chapter","created":{"date-parts":[[2022,6,21]],"date-time":"2022-06-21T02:03:15Z","timestamp":1655776995000},"page":"541-553","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Stock Predictor with\u00a0Graph Laplacian-Based Multi-task Learning"],"prefix":"10.1007","author":[{"given":"Jiayu","family":"He","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nguyen H.","family":"Tran","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matloob","family":"Khushi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,6,15]]},"reference":[{"key":"39_CR1","unstructured":"Gics. https:\/\/www.msci.com\/our-solutions\/indexes\/gics. Accessed 7 Oct 2021"},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"Abadir, K.M., Magnus, J.R.: Matrix Algebra, vol. 1. Cambridge University Press, Cambridge (2005)","DOI":"10.1017\/CBO9780511810800"},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"Boyd, S., Boyd, S.P., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)","DOI":"10.1017\/CBO9780511804441"},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"Boyd, S., Parikh, N., Chu, E.: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers. Now Publishers Inc., Delft (2011)","DOI":"10.1561\/9781601984616"},{"key":"39_CR5","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.ijmedinf.2018.01.007","volume":"112","author":"TS Brisimi","year":"2018","unstructured":"Brisimi, T.S., Chen, R., Mela, T., Olshevsky, A., Paschalidis, I.C., Shi, W.: Federated learning of predictive models from federated electronic health records. Int. J. Med. Inform. 112, 59\u201367 (2018)","journal-title":"Int. J. Med. Inform."},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"Cardoso, J.V.d.M., Palomar, D.P.: Learning undirected graphs in financial markets. arXiv preprint arXiv:2005.09958 (2020)","DOI":"10.1109\/IEEECONF51394.2020.9443573"},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Cardoso, J.V.d.M., Ying, J., Palomar, D.P.: Algorithms for learning graphs in financial markets. arXiv preprint arXiv:2012.15410 (2020)","DOI":"10.1109\/IEEECONF51394.2020.9443573"},{"issue":"1","key":"39_CR8","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1109\/TWC.2020.3024629","volume":"20","author":"M Chen","year":"2020","unstructured":"Chen, M., Yang, Z., Saad, W., Yin, C., Poor, H.V., Cui, S.: A joint learning and communications framework for federated learning over wireless networks. IEEE Trans. Wirel. Commun. 20(1), 269\u2013283 (2020)","journal-title":"IEEE Trans. Wirel. Commun."},{"issue":"2","key":"39_CR9","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1080\/713665670","volume":"1","author":"R Cont","year":"2001","unstructured":"Cont, R.: Empirical properties of asset returns: stylized facts and statistical issues. Quanti. Financ. 1(2), 223 (2001)","journal-title":"Quanti. Financ."},{"issue":"83","key":"39_CR10","first-page":"1","volume":"17","author":"S Diamond","year":"2016","unstructured":"Diamond, S., Boyd, S.: CVXPY: a Python-embedded modeling language for convex optimization. J. Mach. Learn. Res. 17(83), 1\u20135 (2016)","journal-title":"J. Mach. Learn. Res."},{"key":"39_CR11","unstructured":"Dinh, C.T., Vu, T.T., Tran, N.H., Dao, M.N., Zhang, H.: Fedu: a unified framework for federated multi-task learning with Laplacian regularization. arXiv preprint arXiv:2102.07148 (2021)"},{"issue":"23","key":"39_CR12","doi-asserted-by":"publisher","first-page":"6160","DOI":"10.1109\/TSP.2016.2602809","volume":"64","author":"X Dong","year":"2016","unstructured":"Dong, X., Thanou, D., Frossard, P., Vandergheynst, P.: Learning Laplacian matrix in smooth graph signal representations. IEEE Trans. Sig. Process. 64(23), 6160\u20136173 (2016)","journal-title":"IEEE Trans. Sig. Process."},{"issue":"11","key":"39_CR13","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1073\/pnas.35.11.652","volume":"35","author":"K Fan","year":"1949","unstructured":"Fan, K.: On a theorem of Weyl concerning eigenvalues of linear transformations I. Proc. Natl. Acad. Sci. U.S.A. 35(11), 652 (1949)","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"key":"39_CR14","doi-asserted-by":"crossref","unstructured":"He, J., Khushi, M., Tran, N.H., Liu, T.: Robust dual recurrent neural networks for financial time series prediction. In: Proceedings of the 2021 SIAM International Conference on Data Mining (SDM), pp. 747\u2013755. SIAM (2021)","DOI":"10.1137\/1.9781611976700.84"},{"issue":"4","key":"39_CR15","doi-asserted-by":"publisher","first-page":"1113","DOI":"10.1093\/revfin\/hhm003","volume":"20","author":"K Hou","year":"2007","unstructured":"Hou, K.: Industry information diffusion and the lead-lag effect in stock returns. Rev. Financ. Stud. 20(4), 1113\u20131138 (2007)","journal-title":"Rev. Financ. Stud."},{"key":"39_CR16","unstructured":"Kalofolias, V.: How to learn a graph from smooth signals. In: Artificial Intelligence and Statistics, pp. 920\u2013929. PMLR (2016)"},{"key":"39_CR17","doi-asserted-by":"crossref","unstructured":"Li, C., Song, D., Tao, D.: Multi-task recurrent neural networks and higher-order Markov random fields for stock price movement prediction: Multi-task RNN and higer-order MRFs for stock price classification. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1141\u20131151 (2019)","DOI":"10.1145\/3292500.3330983"},{"issue":"1","key":"39_CR18","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s100510050929","volume":"11","author":"RN Mantegna","year":"1999","unstructured":"Mantegna, R.N.: Hierarchical structure in financial markets. Eur. Phys. J. B Condens. Matter Compl. Syst. 11(1), 193\u2013197 (1999)","journal-title":"Eur. Phys. J. B Condens. Matter Compl. Syst."},{"key":"39_CR19","unstructured":"Markowitz, H.M.: Portfolio Selection. Yale University Press, London (1968)"},{"key":"39_CR20","doi-asserted-by":"crossref","unstructured":"Marti, G., Nielsen, F., Bi\u0144kowski, M., Donnat, P.: A review of two decades of correlations, hierarchies, networks and clustering in financial markets. Prog. Inf. Geom. 245\u2013274 (2021)","DOI":"10.1007\/978-3-030-65459-7_10"},{"key":"39_CR21","doi-asserted-by":"crossref","unstructured":"Nie, F., Wang, X., Jordan, M.I., Huang, H.: The constrained Laplacian rank algorithm for graph-based clustering. In: Thirtieth AAAI Conference on Artificial Intelligence (2016)","DOI":"10.1609\/aaai.v30i1.10302"},{"key":"39_CR22","unstructured":"Oellermann, O.R., Schwenk, A.J.: The Laplacian spectrum of graphs (1991)"},{"key":"39_CR23","unstructured":"Paszke, A., et al.: Automatic differentiation in pytorch (2017)"},{"key":"39_CR24","doi-asserted-by":"crossref","unstructured":"Qin, Y., Song, D., Chen, H., Cheng, W., Jiang, G., Cottrell, G.: A dual-stage attention-based recurrent neural network for time series prediction. arXiv preprint arXiv:1704.02971 (2017)","DOI":"10.24963\/ijcai.2017\/366"},{"key":"39_CR25","unstructured":"Smith, V., Chiang, C.K., Sanjabi, M., Talwalkar, A.: Federated multi-task learning. In: Proceedings of the 31st International Conference on Neural Information Processing Systems, pp. 4427\u20134437. Curran Associates Inc. (2017)"},{"key":"39_CR26","doi-asserted-by":"crossref","unstructured":"Tuck, J., Barratt, S., Boyd, S.: A distributed method for fitting Laplacian regularized stratified models. arXiv preprint arXiv:1904.12017 (2019)","DOI":"10.2139\/ssrn.3608009"},{"key":"39_CR27","doi-asserted-by":"crossref","unstructured":"Yoo, J., Soun, Y., Park, Y.c., Kang, U.: Accurate multivariate stock movement prediction via data-axis transformer with multi-level contexts. In: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 2037\u20132045 (2021)","DOI":"10.1145\/3447548.3467297"},{"key":"39_CR28","unstructured":"Zhang, Y., Yeung, D.Y.: A convex formulation for learning task relationships in multi-task learning. arXiv preprint arXiv:1203.3536 (2012)"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08751-6_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,21]],"date-time":"2026-06-21T00:09:31Z","timestamp":1782000571000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08751-6_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031087509","9783031087516"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08751-6_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"474","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"175","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"78","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}