{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:40:08Z","timestamp":1740123608535,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,10,12]],"date-time":"2022-10-12T00:00:00Z","timestamp":1665532800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,12]],"date-time":"2022-10-12T00:00:00Z","timestamp":1665532800000},"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":["J Supercomput"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s11227-022-04865-x","type":"journal-article","created":{"date-parts":[[2022,10,12]],"date-time":"2022-10-12T15:03:29Z","timestamp":1665587009000},"page":"5139-5153","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On using affine sketches for multiple-response dynamic graph regression"],"prefix":"10.1007","volume":"79","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3436-0541","authenticated-orcid":false,"given":"Mostafa","family":"Haghir Chehreghani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,12]]},"reference":[{"issue":"2","key":"4865_CR1","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1198\/jcgs.2011.09203","volume":"20","author":"Arne Kovac","year":"2011","unstructured":"Kovac Arne, Smith Andrew DAC (2011) Nonparametric regression on a graph. J Comput Gr Stat 20(2):432\u2013447","journal-title":"J Comput Gr Stat"},{"key":"4865_CR2","unstructured":"Chehreghani MH (2019) On the theory of dynamic graph regression problem. CoRR, abs\/1903.10699"},{"key":"4865_CR3","volume":"410","author":"Mostafa Haghir Chehreghani","year":"2021","unstructured":"Mostafa Haghir Chehreghani (2021) Sublinear update time randomized algorithms for dynamic graph regression. Appl Math Comput 410:126434","journal-title":"Appl Math Comput"},{"issue":"2","key":"4865_CR4","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s00211-010-0331-6","volume":"117","author":"Drineas Petros","year":"2011","unstructured":"Petros D, Mahoney Michael W, Muthukrishnan S, Tam\u00e1s Sarl\u00f3s (2011) Faster least squares approximation. Numerische Mathematik 117(2):219\u2013249","journal-title":"Numerische Mathematik"},{"issue":"6","key":"4865_CR5","first-page":"54","volume":"63","author":"L Clarkson Kenneth","year":"2017","unstructured":"Clarkson Kenneth L, Woodruff David P (2017) Low-rank approximation and regression in input sparsity time. J ACM 63(6):54","journal-title":"J ACM"},{"issue":"5","key":"4865_CR6","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1145\/585265.585268","volume":"49","author":"Jon M Kleinberg","year":"2002","unstructured":"Kleinberg Jon M, Tardos \u00c9va (2002) Approximation algorithms for classification problems with pairwise relationships: metric labeling and markov random fields. J ACM 49(5):616\u2013639","journal-title":"J ACM"},{"key":"4865_CR7","doi-asserted-by":"crossref","unstructured":"Herbster M, Pontil M, Wainer L (2005) Online learning over graphs. In: Luc\u00a0De Raedt and Stefan Wrobel, editors, Machine Learning, Proceedings of the Twenty-Second International Conference (ICML 2005), Bonn, Germany, August 7-11, 2005, volume 119 of ACM International Conference Proceeding Series, pages 305\u2013312. ACM","DOI":"10.1145\/1102351.1102390"},{"key":"4865_CR8","unstructured":"Herbster M, Lever G, Pontil M (2008) Online prediction on large diameter graphs. In: Daphne Koller, Dale Schuurmans, Yoshua Bengio, and L\u00e9on Bottou, editors, Advances in Neural Information Processing Systems 21, Proceedings of the Twenty-Second Annual Conference on Neural Information Processing Systems, Vancouver, British Columbia, Canada, December 8-11, 2008, pages 649\u2013656. Curran Associates, Inc.,"},{"key":"4865_CR9","unstructured":"Herbster Mark, Lever Guy (2009) Predicting the labelling of a graph via minimum $$p$$-seminorm interpolation. In: COLT 2009 - The 22nd Conference on Learning Theory, Montreal, Quebec, Canada, June 18-21, 2009"},{"key":"4865_CR10","first-page":"2003","volume":"16","author":"Mark Herbster","year":"2015","unstructured":"Herbster Mark, Pasteris Stephen, Pontil Massimiliano (2015) Predicting a switching sequence of graph labelings. J Mach Learn Res 16:2003\u20132022","journal-title":"J Mach Learn Res"},{"issue":"1","key":"4865_CR11","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1214\/08-AOAS202","volume":"3","author":"Mark Culp","year":"2009","unstructured":"Culp Mark, Michailidis George, Johnson Kjell (2009) On multi-view learning with additive models. Annals Appl Stat 3(1):292\u2013318","journal-title":"Annals Appl Stat"},{"key":"4865_CR12","unstructured":"Velickovic P, Cucurull G, Casanova A, Romero A, Li\u00f2 P, Bengio Y (2018) Graph attention networks. In: 6th International Conference on Learning Representations, ICLR 2018, Vancouver, BC, Canada, April 30 - May 3, 2018, Conference Track Proceedings. OpenReview.net"},{"issue":"3","key":"4865_CR13","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1038\/s42256-022-00466-8","volume":"4","author":"Mostafa Haghir Chehreghani","year":"2022","unstructured":"Mostafa Haghir Chehreghani (2022) Half a decade of graph convolutional networks. Nat Mach Intell 4(3):192\u2013193","journal-title":"Nat Mach Intell"},{"issue":"4","key":"4865_CR14","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/3490478","volume":"40","author":"H Wang","year":"2022","unstructured":"Wang H, Leskovec J (2022) Combining graph convolutional neural networks and label propagation. ACM Trans Inf Syst 40(4):73","journal-title":"ACM Trans Inf Syst"},{"issue":"2","key":"4865_CR15","volume":"11","author":"Chehreghani Mostafa Haghir","year":"2021","unstructured":"Chehreghani Mostafa Haghir (2021) Dynamical algorithms for data mining and machine learning over dynamic graphs. WIREs Data Mining Knowl Discov 11(2):e1393","journal-title":"WIREs Data Mining Knowl Discov"},{"key":"4865_CR16","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1016\/j.neucom.2013.11.015","volume":"131","author":"Charanpal Dhanjal","year":"2014","unstructured":"Dhanjal Charanpal, Gaudel Romaric, Cl\u00e9men\u00e7on St\u00e9phan (2014) Efficient eigen-updating for spectral graph clustering. Neurocomputing 131:440\u2013452","journal-title":"Neurocomputing"},{"key":"4865_CR17","doi-asserted-by":"crossref","unstructured":"Yao Y, Holder LB (2014) Scalable svm-based classification in dynamic graphs. In: Ravi Kumar, Hannu Toivonen, Jian Pei, Joshua\u00a0Zhexue Huang, and Xindong Wu, editors, 2014 IEEE International Conference on Data Mining, ICDM 2014, Shenzhen, China, December 14-17, 2014, pages 650\u2013659. IEEE Computer Society","DOI":"10.1109\/ICDM.2014.69"},{"key":"4865_CR18","doi-asserted-by":"crossref","unstructured":"Ailon N, Liberty E (2008) Fast dimension reduction using rademacher series on dual BCH codes. In: Shang-Hua Teng, editor. Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008","DOI":"10.21236\/ADA471857"},{"key":"4865_CR19","doi-asserted-by":"crossref","unstructured":"Pareja A, Domeniconi G, Chen J, Ma T, Suzumura T, Kanezashi H, Kaler T, Schardl TB, Leiserson CE (2020) Evolvegcn: Evolving graph convolutional networks for dynamic graphs. In: The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, The Thirty-Second Innovative Applications of Artificial Intelligence Conference, IAAI 2020, The Tenth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2020, New York, NY, USA, February 7-12, 2020, pages 5363\u20135370. AAAI Press","DOI":"10.1609\/aaai.v34i04.5984"},{"key":"4865_CR20","doi-asserted-by":"crossref","unstructured":"You J, Du T, Leskovec J (2022) ROLAND: graph learning framework for dynamic graphs. In: Aidong Zhang and Huzefa Rangwala, (eds.), KDD \u201922: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 14 - 18, 2022, pages 2358\u20132366. ACM","DOI":"10.1145\/3534678.3539300"},{"key":"4865_CR21","unstructured":"Qin T, Liu T-Y, Zhang X-D, Wang D-S, Li H (2008) Global ranking using continuous conditional random fields. In: Daphne Koller, Dale Schuurmans, Yoshua Bengio, and L\u00e9on Bottou, (eds.), Advances in Neural Information Processing Systems 21, Proceedings of the Twenty-Second Annual Conference on Neural Information Processing Systems, Vancouver, British Columbia, Canada, December 8-11, 2008, pages 1281\u20131288. Curran Associates, Inc"},{"key":"4865_CR22","unstructured":"Sohn K-A, Kim S (2012) Joint estimation of structured sparsity and output structure in multiple-output regression via inverse-covariance regularization. In: Neil\u00a0D. Lawrence and Mark\u00a0A. Girolami, (eds.), Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics, AISTATS 2012, La Palma, Canary Islands, Spain, April 21-23, 2012, volume\u00a022 of JMLR Proceedings, pages 1081\u20131089. JMLR.org,"},{"key":"4865_CR23","unstructured":"Wytock M, Kolter JZ (2013) Sparse gaussian conditional random fields: Algorithms, theory, and application to energy forecasting. In: Proceedings of the 30th International Conference on Machine Learning, ICML 2013, Atlanta, GA, USA, 16-21 June 2013"},{"key":"4865_CR24","doi-asserted-by":"crossref","unstructured":"Han C, Cao XH, Stanojevic M, Ghalwash MF, Obradovic Z (2019) Temporal graph regression via structure-aware intrinsic representation learning. In: Tanya\u00a0Y. Berger-Wolf and Nitesh\u00a0V. Chawla, (eds.), Proceedings of the 2019 SIAM International Conference on Data Mining, SDM 2019, Calgary, Alberta, Canada, May 2-4, 2019, pages 360\u2013368. SIAM","DOI":"10.1137\/1.9781611975673.41"},{"key":"4865_CR25","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.ins.2020.01.043","volume":"521","author":"Hao Peng","year":"2020","unstructured":"Peng Hao, Wang Hongfei, Bowen Du, Bhuiyan Md Zakirul Alam, Ma Hongyuan, Liu Jianwei, Wang Lihong, Yang Zeyu, Linfeng Du, Wang Senzhang, Philip SYu (2020) Spatial temporal incidence dynamic graph neural networks for traffic flow forecasting. Inf Sci 521:277\u2013290","journal-title":"Inf Sci"},{"issue":"5","key":"4865_CR26","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1007\/s10618-015-0439-5","volume":"30","author":"Mostafa Haghir Chehreghani and Maurice Bruynooghe","year":"2016","unstructured":"Mostafa Haghir Chehreghani and Maurice Bruynooghe (2016) Mining rooted ordered trees under subtree homeomorphism. Data Min Knowl Discov 30(5):1249\u20131272","journal-title":"Data Min Knowl Discov"},{"key":"4865_CR27","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1016\/j.future.2020.01.042","volume":"106","author":"Chehreghani Mostafa Haghir","year":"2020","unstructured":"Haghir Chehreghani Mostafa, Talel Abdessalem, Albert Bifet, Meriem Bouzbila (2020) Sampling informative patterns from large single networks. Future Gener Comput Syst 106:653\u2013658","journal-title":"Future Gener Comput Syst"},{"issue":"3","key":"4865_CR28","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1137\/120874540","volume":"34","author":"Christos Boutsidis","year":"2013","unstructured":"Boutsidis Christos, Gittens Alex (2013) Improved matrix algorithms via the subsampled randomized hadamard transform. SIAM J Matrix Anal Appl 34(3):1301\u20131340","journal-title":"SIAM J Matrix Anal Appl"},{"key":"4865_CR29","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1137\/1002004","volume":"2","author":"TNE Greville","year":"1960","unstructured":"Greville TNE (1960) Some applications of the pseudoinverse of a matrix. SIAM Rev 2:15\u201322","journal-title":"SIAM Rev"},{"issue":"3","key":"4865_CR30","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1137\/0124033","volume":"24","author":"D Meyer Jr Carl","year":"1973","unstructured":"Meyer Jr Carl D (1973) Generalized inversion of modified matrices. SIAM J Appl Math 24(3):315\u2013323","journal-title":"SIAM J Appl Math"},{"key":"4865_CR31","doi-asserted-by":"crossref","unstructured":"van\u00a0den Brand Jan (2020) Unifying matrix data structures: Simplifying and speeding up iterative algorithms. CoRR, arXiv:abs\/2010.13888","DOI":"10.1137\/1.9781611976496.1"},{"key":"4865_CR32","doi-asserted-by":"crossref","unstructured":"Meng X, Mahoney MW (2013) Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression. In: Dan Boneh, Tim Roughgarden, and Joan Feigenbaum, (eds.), Symposium on Theory of Computing Conference, STOC\u201913, Palo Alto, CA, USA, June 1-4, 2013, pages 91\u2013100. ACM","DOI":"10.1145\/2488608.2488621"},{"key":"4865_CR33","doi-asserted-by":"crossref","unstructured":"Nelson J, Nguyen HL (2013) OSNAP: faster numerical linear algebra algorithms via sparser subspace embeddings. In: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA, pages 117\u2013126. IEEE Computer Society","DOI":"10.1109\/FOCS.2013.21"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04865-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-04865-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04865-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,5]],"date-time":"2024-10-05T17:41:45Z","timestamp":1728150105000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-04865-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,12]]},"references-count":33,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["4865"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-04865-x","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2022,10,12]]},"assertion":[{"value":"24 September 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 October 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"None.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}