{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T03:20:27Z","timestamp":1769916027453,"version":"3.49.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2022,10,23]],"date-time":"2022-10-23T00:00:00Z","timestamp":1666483200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,23]],"date-time":"2022-10-23T00:00:00Z","timestamp":1666483200000},"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":["Comp. Appl. Math."],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s40314-022-02071-2","type":"journal-article","created":{"date-parts":[[2022,10,23]],"date-time":"2022-10-23T11:03:31Z","timestamp":1666523011000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the theory of dynamic graph regression problem"],"prefix":"10.1007","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3436-0541","authenticated-orcid":false,"given":"Mostafa","family":"Haghir\u00a0Chehreghani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,23]]},"reference":[{"key":"2071_CR1","doi-asserted-by":"publisher","unstructured":"Borgwardt KM, Kriegel H, Wackersreuther P (2006) Pattern mining in frequent dynamic subgraphs. In: Proceedings of the 6th IEEE international conference on data mining (ICDM 2006), 18\u201322 December, Hong Kong, China. IEEE Computer Society, pp 818\u2013822. https:\/\/doi.org\/10.1109\/ICDM.2006.124","DOI":"10.1109\/ICDM.2006.124"},{"key":"2071_CR2","unstructured":"Calissano A, Feragen A, Vantini S (2021) Graph-valued regression: prediction of unlabelled networks in a non-Euclidean graph-space. MOX-Report No. 02\/2021, Dipartimento di Matematica, Politecnico di Milano, Via Bonardi 9, 20133 Milano, Italy"},{"key":"2071_CR3","doi-asserted-by":"publisher","unstructured":"Calissano A, Feragen A, Vantini S (2022) Graph-valued regression: prediction of unlabelled networks in a non-Euclidean graph space. J Multivar Anal 190:104950. https:\/\/doi.org\/10.1016\/j.jmva.2022.104950. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0047259X22000021","DOI":"10.1016\/j.jmva.2022.104950"},{"key":"2071_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s42256-022-00466-8","volume":"4","author":"M Chehreghani","year":"2022","unstructured":"Chehreghani M (2022) Half a decade of graph convolutional networks. Nat Mach Intell 4:1\u20132. https:\/\/doi.org\/10.1038\/s42256-022-00466-8","journal-title":"Nat Mach Intell"},{"issue":"5","key":"2071_CR5","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1007\/s10618-015-0439-5","volume":"30","author":"MH Chehreghani","year":"2016","unstructured":"Chehreghani MH, Bruynooghe M (2016) Mining rooted ordered trees under subtree homeomorphism. Data Min Knowl Discov 30(5):1249\u20131272. https:\/\/doi.org\/10.1007\/s10618-015-0439-5","journal-title":"Data Min Knowl Discov"},{"key":"2071_CR6","doi-asserted-by":"crossref","unstructured":"Chehreghani MH, Rahgozar M, Lucas C, Chehreghani MH (2007) A heuristic algorithm for clustering rooted ordered trees. Intell Data Anal 11(4):355\u2013376. http:\/\/content.iospress.com\/articles\/intelligent-data-analysis\/ida00292","DOI":"10.3233\/IDA-2007-11404"},{"issue":"1","key":"2071_CR7","doi-asserted-by":"publisher","first-page":"165","DOI":"10.3233\/IDA-2009-0361","volume":"13","author":"MH Chehreghani","year":"2009","unstructured":"Chehreghani MH, Chehreghani MH, Lucas C, Rahgozar M, Ghadimi E (2009) Efficient rule based structural algorithms for classification of tree structured data. Intell Data Anal 13(1):165\u2013188. https:\/\/doi.org\/10.3233\/IDA-2009-0361","journal-title":"Intell Data Anal"},{"issue":"5","key":"2071_CR8","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1109\/TSMCA.2010.2096808","volume":"41","author":"MH Chehreghani","year":"2011","unstructured":"Chehreghani MH, Chehreghani MH, Lucas C, Rahgozar M (2011) Oinduced: an efficient algorithm for mining induced patterns from rooted ordered trees. IEEE Trans Syst Man Cybern Part A 41(5):1013\u20131025. https:\/\/doi.org\/10.1109\/TSMCA.2010.2096808","journal-title":"IEEE Trans Syst Man Cybern Part A"},{"key":"2071_CR9","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1016\/j.future.2020.01.042","volume":"106","author":"MH Chehreghani","year":"2020","unstructured":"Chehreghani MH, Abdessalem T, Bifet A, Bouzbila M (2020) Sampling informative patterns from large single networks. Future Gener Comput Syst 106:653\u2013658. https:\/\/doi.org\/10.1016\/j.future.2020.01.042","journal-title":"Future Gener Comput Syst"},{"issue":"4","key":"2071_CR10","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1093\/imaiai\/iaz026","volume":"8","author":"S Chowdhury","year":"2019","unstructured":"Chowdhury S, Memoli F (2019) The Gromov\u2013Wasserstein distance between networks and stable network invariants. Inf Inference J IMA 8(4):757\u2013787. https:\/\/doi.org\/10.1093\/imaiai\/iaz026","journal-title":"Inf Inference J IMA"},{"key":"2071_CR11","first-page":"17","volume":"5","author":"P Erdos","year":"1960","unstructured":"Erdos P, Renyi A (1960) On the evolution of random graphs. Publ Math Inst Hung Acad Sci 5:17\u201361","journal-title":"Publ Math Inst Hung Acad Sci"},{"key":"2071_CR12","doi-asserted-by":"publisher","unstructured":"Gall FL (2014) Powers of tensors and fast matrix multiplication. In: Nabeshima K, Nagasaka K, Winkler F, Sz\u00e1nt\u00f3 \u00c1 (eds) International symposium on symbolic and algebraic computation, ISSAC \u201914, Kobe, Japan, July 23\u201325. ACM, pp 296\u2013303. https:\/\/doi.org\/10.1145\/2608628.2608664","DOI":"10.1145\/2608628.2608664"},{"key":"2071_CR13","unstructured":"Goyal P, Kamra N, He X, Liu Y (2018) Dyngem: deep embedding method for dynamic graphs. CoRR. arXiv:1805.11273"},{"key":"2071_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.06.024","author":"P Goyal","year":"2020","unstructured":"Goyal P, Chhetri SR, Canedo A (2020) dyngraph2vec: capturing network dynamics using dynamic graph representation learning. Knowl Based Syst. https:\/\/doi.org\/10.1016\/j.knosys.2019.06.024","journal-title":"Knowl Based Syst"},{"key":"2071_CR15","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. https:\/\/doi.org\/10.1137\/1002004","journal-title":"SIAM Rev"},{"key":"2071_CR16","doi-asserted-by":"publisher","unstructured":"Grover A, Leskovec J (2016) node2vec: scalable feature learning for networks. In: Krishnapuram B, Shah M, Smola AJ, Aggarwal CC, Shen D, Rastogi R (eds) Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, San Francisco, CA, USA, August 13\u201317, 2016. ACM, pp 855\u2013864. https:\/\/doi.org\/10.1145\/2939672.2939754","DOI":"10.1145\/2939672.2939754"},{"key":"2071_CR17","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1393","author":"M Haghir Chehreghani","year":"2021","unstructured":"Haghir Chehreghani M (2021) Dynamical algorithms for data mining and machine learning over dynamic graphs. WIREs Data Min Knowl Discov. https:\/\/doi.org\/10.1002\/widm.1393","journal-title":"WIREs Data Min Knowl Discov"},{"key":"2071_CR18","doi-asserted-by":"publisher","unstructured":"Han C, Zhang S, Ghalwash MF, Vucetic S, Obradovic Z (2016) Joint learning of representation and structure for sparse regression on graphs. In: Venkatasubramanian SC, Meira W Jr (eds) Proceedings of the 2016 SIAM international conference on data mining, Miami, Florida, USA, May 5\u20137, 2016. SIAM, pp 846\u2013854. https:\/\/doi.org\/10.1137\/1.9781611974348.95","DOI":"10.1137\/1.9781611974348.95"},{"key":"2071_CR19","doi-asserted-by":"publisher","unstructured":"Han C, Cao X.H, Stanojevic M, Ghalwash M.F, Obradovic Z (2019) Temporal graph regression via structure-aware intrinsic representation learning. In: Berger-Wolf TY, Chawla NV (eds) Proceedings of the 2019 SIAM international conference on data mining, SDM 2019, Calgary, Alberta, Canada, May 2\u20134, 2019. SIAM, pp 360\u2013368. https:\/\/doi.org\/10.1137\/1.9781611975673.41","DOI":"10.1137\/1.9781611975673.41"},{"key":"2071_CR20","doi-asserted-by":"publisher","unstructured":"Hayashi T, Akiba T, Yoshida Y(2015) Fully dynamic betweenness centrality maintenance on massive networks. In: Proceedings of the VLDB endowment (PVLDB), vol 9(2), pp 48\u201359. https:\/\/doi.org\/10.14778\/2850578.2850580. http:\/\/www.vldb.org\/pvldb\/vol9\/p48-hayashi.pdf","DOI":"10.14778\/2850578.2850580"},{"key":"2071_CR21","unstructured":"Herbster M, Pontil M (2006) Prediction on a graph with a perceptron. In: Sch\u00f6lkopf B, Platt JC, Hofmann T (eds) Advances in neural information processing systems 19, Proceedings of the twentieth annual conference on neural information processing systems, Vancouver, British Columbia, Canada, December 4\u20137, 2006. MIT Press, Cambridge, pp 577\u2013584. https:\/\/proceedings.neurips.cc\/paper\/2006\/hash\/cc3d69ed781b16bce06687822ae56e6d-Abstract.html"},{"key":"2071_CR22","unstructured":"Herbster M, Pasteris S, Pontil M (2015) Predicting a switching sequence of graph labelings. J Mach Learn Res 16:2003\u20132022. http:\/\/dl.acm.org\/citation.cfm?id=2886813"},{"issue":"5","key":"2071_CR23","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1145\/585265.585268","volume":"49","author":"JM Kleinberg","year":"2002","unstructured":"Kleinberg JM, Tardos \u00c9 (2002) Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields. J ACM 49(5):616\u2013639. https:\/\/doi.org\/10.1145\/585265.585268","journal-title":"J ACM"},{"issue":"2","key":"2071_CR24","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1198\/jcgs.2011.09203","volume":"20","author":"A Kovac","year":"2011","unstructured":"Kovac A, Smith AD (2011) Nonparametric regression on a graph. J Comput Graph Stat 20(2):432\u2013447. https:\/\/doi.org\/10.1198\/jcgs.2011.09203","journal-title":"J Comput Graph Stat"},{"key":"2071_CR25","doi-asserted-by":"publisher","unstructured":"Kumar S, Spezzano F, Subrahmanian VS, Faloutsos C (2016) Edge weight prediction in weighted signed networks. In: IEEE 16th international conference on data mining, ICDM 2016, December 12-15, 2016, Barcelona, Spain, pp 221\u2013230. https:\/\/doi.org\/10.1109\/ICDM.2016.0033","DOI":"10.1109\/ICDM.2016.0033"},{"key":"2071_CR26","doi-asserted-by":"publisher","unstructured":"Lee JB, Rossi RA, Kong X (2018) Graph classification using structural attention. In: Guo Y, Farooq F (eds) Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery and data mining, KDD 2018, London, UK, August 19\u201323, 2018. ACM, pp 1666\u20131674 (2018). https:\/\/doi.org\/10.1145\/3219819.3219980","DOI":"10.1145\/3219819.3219980"},{"key":"2071_CR27","doi-asserted-by":"publisher","unstructured":"Leskovec J, Huttenlocher DP, Kleinberg JM (2010) Predicting positive and negative links in online social networks. In: Rappa M, Jones P, Freire J, Chakrabarti S (eds) Proceedings of the 19th international conference on world wide web, WWW 2010, Raleigh, North Carolina, USA, April 26\u201330, 2010. ACM, pp 641\u2013650. https:\/\/doi.org\/10.1145\/1772690.1772756","DOI":"10.1145\/1772690.1772756"},{"key":"2071_CR28","doi-asserted-by":"crossref","unstructured":"Li J, Hu X, Jian L, Liu H (2016) Toward time-evolving feature selection on dynamic networks. In: IEEE 16th international conference on data mining, ICDM 2016, December 12\u201315, 2016, Barcelona, Spain, pp 1003\u20131008","DOI":"10.1109\/ICDM.2016.0127"},{"key":"2071_CR29","doi-asserted-by":"publisher","unstructured":"Makkar D, Bader DA, Green O (2017) Exact and parallel triangle counting in dynamic graphs. In: 24th IEEE international conference on high performance computing, HiPC 2017, Jaipur, India, December 18\u201321, 2017. IEEE Computer Society, pp 2\u201312. https:\/\/doi.org\/10.1109\/HiPC.2017.00011","DOI":"10.1109\/HiPC.2017.00011"},{"issue":"3","key":"2071_CR30","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1137\/0124033","volume":"24","author":"CD Meyer Jr","year":"1973","unstructured":"Meyer CD Jr (1973) Generalized inversion of modified matrices. SIAM J Appl Math 24(3):315\u2013323","journal-title":"SIAM J Appl Math"},{"key":"2071_CR31","unstructured":"Niepert M, Ahmed M, Kutzkov K (2016) Learning convolutional neural networks for graphs. In: Proceedings of the 33nd international conference on machine learning, ICML 2016, New York City, NY, USA, June 19-24, 2016. JMLR workshop and conference proceedings, vol 48, pp 2014\u20132023. http:\/\/jmlr.org\/proceedings\/papers\/v48\/niepert16.html"},{"key":"2071_CR32","doi-asserted-by":"crossref","unstructured":"Parsons T, Pisanski T (1989) Vector representations of graphs. Discret Math 78(1):143\u2013154. Special Double Issue in Memory of Tory Parsons","DOI":"10.1016\/0012-365X(89)90171-4"},{"key":"2071_CR33","unstructured":"Qin T, Liu T, Zhang X, Wang D, Li H (2008) Global ranking using continuous conditional random fields. In: Koller D, Schuurmans D, Bengio Y, Bottou L (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\u201311, 2008. Curran Associates, Inc., Red Hook, pp 1281\u20131288. https:\/\/proceedings.neurips.cc\/paper\/2008\/hash\/ebd9629fc3ae5e9f6611e2ee05a31cef-Abstract.html"},{"key":"2071_CR34","volume-title":"Generalized inverse of matrices and its applications","author":"CR Rao","year":"1971","unstructured":"Rao CR, Mitra SK (1971) Generalized inverse of matrices and its applications. Wiley, New York"},{"key":"2071_CR35","doi-asserted-by":"crossref","unstructured":"Rozemberczki B, Sarkar R (2020) Characteristic functions on graphs: birds of a feather, from statistical descriptors to parametric models. In: Proceedings of the 29th ACM international conference on information and knowledge management (CIKM \u201920). ACM, New York, pp 1325\u20131334","DOI":"10.1145\/3340531.3411866"},{"issue":"1","key":"2071_CR36","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10994-008-5089-z","volume":"75","author":"H Saigo","year":"2009","unstructured":"Saigo H, Nowozin S, Kadowaki T, Kudo T, Tsuda K (2009) gBoost: a mathematical programming approach to graph classification and regression. Mach Learn 75(1):69\u201389. https:\/\/doi.org\/10.1007\/s10994-008-5089-z","journal-title":"Mach Learn"},{"key":"2071_CR37","unstructured":"Sohn K, Kim S (2012) Joint estimation of structured sparsity and output structure in multiple-output regression via inverse-covariance regularization. In: Lawrence ND, Girolami MA (eds) Proceedings of the fifteenth international conference on artificial intelligence and statistics, AISTATS 2012, La Palma, Canary Islands, Spain, April 21\u201323, 2012, JMLR proceedings, vol\u00a022. JMLR.org, pp 1081\u20131089. http:\/\/proceedings.mlr.press\/v22\/sohn12.html"},{"issue":"1\u20132","key":"2071_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/0400000060","volume":"10","author":"DP Woodruff","year":"2014","unstructured":"Woodruff DP (2014) Sketching as a tool for numerical linear algebra. Found Trends Theor Comput Sci 10(1\u20132):1\u2013157. https:\/\/doi.org\/10.1561\/0400000060","journal-title":"Found Trends Theor Comput Sci"},{"key":"2071_CR39","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\u201321 June 2013. JMLR workshop and conference proceedings, vol\u00a028. JMLR.org, pp 1265\u20131273. http:\/\/proceedings.mlr.press\/v28\/wytock13.html"},{"key":"2071_CR40","unstructured":"Yang Z, Cohen WW, Salakhutdinov R (2016) Revisiting semi-supervised learning with graph embeddings. In: Proceedings of the 33nd international conference on machine learning, ICML 2016, New York City, NY, USA, June 19-24, 2016. JMLR workshop and conference proceedings, vol 48, pp 40\u201348. http:\/\/jmlr.org\/proceedings\/papers\/v48\/yanga16.html"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-022-02071-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-022-02071-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-022-02071-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,13]],"date-time":"2022-12-13T10:51:58Z","timestamp":1670928718000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-022-02071-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,23]]},"references-count":40,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["2071"],"URL":"https:\/\/doi.org\/10.1007\/s40314-022-02071-2","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,23]]},"assertion":[{"value":"12 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 October 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 October 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"362"}}