{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T22:25:38Z","timestamp":1740176738541,"version":"3.37.3"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T00:00:00Z","timestamp":1729555200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T00:00:00Z","timestamp":1729555200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","award":["COFECUB 88887.191730\/2018-00, Grant PROAP 88887.842889\/2023-00","COFECUB 88887.191730\/2018-00, Grant PROAP 88887.842889\/2023-00","COFECUB 88887.191730\/2018-00, Grant PROAP 88887.842889\/2023-00","COFECUB 88887.191730\/2018-00, Grant PROAP 88887.842889\/2023-00","COFECUB 88887.191730\/2018-00, Grant PROAP 88887.842889\/2023-00"],"award-info":[{"award-number":["COFECUB 88887.191730\/2018-00, Grant PROAP 88887.842889\/2023-00","COFECUB 88887.191730\/2018-00, Grant PROAP 88887.842889\/2023-00","COFECUB 88887.191730\/2018-00, Grant PROAP 88887.842889\/2023-00","COFECUB 88887.191730\/2018-00, Grant PROAP 88887.842889\/2023-00","COFECUB 88887.191730\/2018-00, Grant PROAP 88887.842889\/2023-00"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100012950","name":"Institut national de recherche en informatique et en automatique","doi-asserted-by":"publisher","award":["Project LOGIC","Project LOGIC","Project LOGIC","Project LOGIC"],"award-info":[{"award-number":["Project LOGIC","Project LOGIC","Project LOGIC","Project LOGIC"]}],"id":[{"id":"10.13039\/100012950","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004901","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de Minas Gerais","doi-asserted-by":"publisher","award":["Grant APQ-01079-23","Grant APQ-01079-23"],"award-info":[{"award-number":["Grant APQ-01079-23","Grant APQ-01079-23"]}],"id":[{"id":"10.13039\/501100004901","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["Grants 407242\/2021-0, 306573\/2022-9"],"award-info":[{"award-number":["Grants 407242\/2021-0, 306573\/2022-9"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Data Sci Anal"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s41060-024-00632-8","type":"journal-article","created":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:02:06Z","timestamp":1729634526000},"page":"229-242","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Decreasing graph complexity with transitive reduction to improve temporal graph classification"],"prefix":"10.1007","volume":"19","author":[{"given":"Carolina","family":"Jer\u00f4nimo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zenilton K. G.","family":"Patroc\u00ednio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Malinowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillaume","family":"Gravier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silvio Jamil F.","family":"Guimar\u00e3es","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,22]]},"reference":[{"issue":"5","key":"632_CR1","doi-asserted-by":"publisher","first-page":"3052","DOI":"10.1007\/s10489-020-02033-3","volume":"51","author":"A Amara","year":"2021","unstructured":"Amara, A., Hadj Taieb, M.A., Ben Aouicha, M.: Multilingual topic modeling for tracking Covid-19 trends based on facebook data analysis. Appl. Intell. 51(5), 3052\u20133073 (2021)","journal-title":"Appl. Intell."},{"key":"632_CR2","doi-asserted-by":"crossref","unstructured":"Akhtar, N., Ahamad, M.V.: Graph tools for social network analysis. In: Research Anthology on Digital Transformation, Organizational Change, and the Impact of Remote Work, pp. 485\u2013500. IGI Global, (2021)","DOI":"10.4018\/978-1-7998-7297-9.ch025"},{"issue":"10","key":"632_CR3","doi-asserted-by":"publisher","first-page":"0240878","DOI":"10.1371\/journal.pone.0240878","volume":"15","author":"A Karaivanov","year":"2020","unstructured":"Karaivanov, A.: A social network model of covid-19. PLoS ONE 15(10), 0240878 (2020)","journal-title":"PLoS ONE"},{"key":"632_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.inffus.2021.07.013","volume":"77","author":"Y Zhu","year":"2022","unstructured":"Zhu, Y., Ma, J., Yuan, C., Zhu, X.: Interpretable learning based dynamic graph convolutional networks for Alzheimer\u2019s disease analysis. Inf. Fusion 77, 53\u201361 (2022)","journal-title":"Inf. Fusion"},{"issue":"1","key":"632_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41467-024-52768-7","volume":"12","author":"J Wang","year":"2021","unstructured":"Wang, J., Ma, A., Chang, Y., Gong, J., Jiang, Y., Qi, R., Wang, C., Fu, H., Ma, Q., Xu, D.: SCGNN is a novel graph neural network framework for single-cell RNA-SEQ analyses. Nat. Commun. 12(1), 1\u201311 (2021)","journal-title":"Nat. Commun."},{"key":"632_CR6","doi-asserted-by":"publisher","DOI":"10.3389\/fgene.2021.690049","volume":"12","author":"X-M Zhang","year":"2021","unstructured":"Zhang, X.-M., Liang, L., Liu, L., Tang, M.-J.: Graph neural networks and their current applications in bioinformatics. Front. Genet. 12, 690049 (2021)","journal-title":"Front. Genet."},{"key":"632_CR7","doi-asserted-by":"crossref","unstructured":"Pradhyumna, P., Shreya, G., et al.: Graph neural network (gnn) in image and video understanding using deep learning for computer vision applications. In: 2021 Second International Conference on Electronics and Sustainable Communication Systems (ICESC), pp. 1183\u20131189. IEEE (2021)","DOI":"10.1109\/ICESC51422.2021.9532631"},{"key":"632_CR8","unstructured":"Yang, S.: Networks: An Introduction by MEJ Newman: Oxford, UK: Oxford University Press. 720 pp., \\$85.00. Taylor & Francis (2013)"},{"issue":"7","key":"632_CR9","doi-asserted-by":"publisher","first-page":"2601","DOI":"10.1007\/s10994-022-06131-w","volume":"111","author":"TH Schulz","year":"2022","unstructured":"Schulz, T.H., Horv\u00e1th, T., Welke, P., Wrobel, S.: A generalized Weisfeiler-Lehman graph kernel. Mach. Learn. 111(7), 2601\u20132629 (2022)","journal-title":"Mach. Learn."},{"key":"632_CR10","unstructured":"Shervashidze, N., Vishwanathan, S., Petri, T., Mehlhorn, K., Borgwardt, K.: Efficient graphlet kernels for large graph comparison. In: Artificial Intelligence and Statistics, pp. 488\u2013495 (2009). PMLR"},{"issue":"7","key":"632_CR11","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0895-7177(97)00050-2","volume":"25","author":"F Harary","year":"1997","unstructured":"Harary, F., Gupta, G.: Dynamic graph models. Math. Comput. Model. 25(7), 79\u201387 (1997)","journal-title":"Math. Comput. Model."},{"issue":"1\u20132","key":"632_CR12","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0378-4371(01)00014-0","volume":"293","author":"B Tadi\u0107","year":"2001","unstructured":"Tadi\u0107, B.: Dynamics of directed graphs: the world-wide web. Phys. A 293(1\u20132), 273\u2013284 (2001)","journal-title":"Phys. A"},{"key":"632_CR13","doi-asserted-by":"crossref","unstructured":"Ozcan, S., Astekin, M., Shashidhar, N.K., Zhou, B.: Centrality and scalability analysis on distributed graph of large-scale e-mail dataset for digital forensics. In: 2020 IEEE International Conference on Big Data (Big Data), pp. 2318\u20132327 (2020). IEEE","DOI":"10.1109\/BigData50022.2020.9378152"},{"issue":"5","key":"632_CR14","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1089\/big.2020.0086","volume":"8","author":"L Oettershagen","year":"2020","unstructured":"Oettershagen, L., Kriege, N.M., Morris, C., Mutzel, P.: Classifying dissemination processes in temporal graphs. Big Data 8(5), 363\u2013378 (2020)","journal-title":"Big Data"},{"key":"632_CR15","first-page":"1","volume":"15","author":"X Meng","year":"2021","unstructured":"Meng, X., Li, W., Peng, X., Li, Y., Li, M.: Protein interaction networks: centrality, modularity, dynamics, and applications. Front. Comp. Sci. 15, 1\u201317 (2021)","journal-title":"Front. Comp. Sci."},{"issue":"1","key":"632_CR16","doi-asserted-by":"publisher","first-page":"4256","DOI":"10.1038\/s41467-020-18112-5","volume":"11","author":"L Paulev\u00e9","year":"2020","unstructured":"Paulev\u00e9, L., Kol\u010d\u00e1k, J., Chatain, T., Haar, S.: Reconciling qualitative, abstract, and scalable modeling of biological networks. Nat. Commun. 11(1), 4256 (2020)","journal-title":"Nat. Commun."},{"key":"632_CR17","doi-asserted-by":"crossref","unstructured":"Barunik, J., Ellington, M., et al.: Dynamic networks in large financial and economic systems. arXiv preprint arXiv:2007.07842 (2020)","DOI":"10.2139\/ssrn.3651134"},{"issue":"2","key":"632_CR18","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1111\/joes.12410","volume":"35","author":"N Nonejad","year":"2021","unstructured":"Nonejad, N.: An overview of dynamic model averaging techniques in time-series econometrics. J. Econ. Surv. 35(2), 566\u2013614 (2021)","journal-title":"J. Econ. Surv."},{"key":"632_CR19","doi-asserted-by":"crossref","unstructured":"Mesbahi, M.: On a dynamic extension of the theory of graphs. In: Proceedings of the 2002 American Control Conference (IEEE Cat. No. CH37301), vol. 2, pp. 1234\u20131239. IEEE (2002)","DOI":"10.1109\/ACC.2002.1023188"},{"issue":"5","key":"632_CR20","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1080\/17445760.2012.668546","volume":"27","author":"A Casteigts","year":"2012","unstructured":"Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. Int. J. Parallel Emergent Distrib. Syst. 27(5), 387\u2013408 (2012)","journal-title":"Int. J. Parallel Emergent Distrib. Syst."},{"issue":"9","key":"632_CR21","doi-asserted-by":"publisher","first-page":"721","DOI":"10.14778\/2732939.2732945","volume":"7","author":"H Wu","year":"2014","unstructured":"Wu, H., Cheng, J., Huang, S., Ke, Y., Lu, Y., Xu, Y.: Path problems in temporal graphs. Proc. VLDB Endowment 7(9), 721\u2013732 (2014)","journal-title":"Proc. VLDB Endowment"},{"key":"632_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2016.04.006","volume":"634","author":"O Michail","year":"2016","unstructured":"Michail, O., Spirakis, P.G.: Traveling salesman problems in temporal graphs. Theoret. Comput. Sci. 634, 1\u201323 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"632_CR23","doi-asserted-by":"crossref","unstructured":"Huang, S., Fu, A.W.-C., Liu, R.: Minimum spanning trees in temporal graphs. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 419\u2013430 (2015)","DOI":"10.1145\/2723372.2723717"},{"key":"632_CR24","doi-asserted-by":"crossref","unstructured":"Jer\u00f4nimo, C., Patroc\u00ednio, Z.K., Malinowski, S., Guimar\u00e3es, S.J.F., Gravier, G.: A novel method for temporal graph classification based on transitive reduction. In: 2023 IEEE 10th International Conference on Data Science and Advanced Analytics (DSAA), pp. 1\u201310 (2023). IEEE","DOI":"10.1109\/DSAA60987.2023.10302525"},{"issue":"2","key":"632_CR25","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1093\/comnet\/cnu039","volume":"3","author":"JR Clough","year":"2015","unstructured":"Clough, J.R., Gollings, J., Loach, T.V., Evans, T.S.: Transitive reduction of citation networks. J. Complex Netw. 3(2), 189\u2013203 (2015)","journal-title":"J. Complex Netw."},{"key":"632_CR26","unstructured":"Dubois, V., Bothorel, C.: Transitive reduction for social network analysis and visualization. In: The 2005 IEEE\/WIC\/ACM International Conference on Web Intelligence (WI\u201905), pp. 128\u2013131 (2005). IEEE"},{"key":"632_CR27","doi-asserted-by":"publisher","first-page":"38010","DOI":"10.1109\/ACCESS.2020.2975650","volume":"8","author":"X Tang","year":"2020","unstructured":"Tang, X., Zhou, J., Qiu, Y., Liu, X., Shi, Y., Zhao, J.: One edge at a time: a novel approach towards efficient transitive reduction computation on DAGS. IEEE Access 8, 38010\u201338022 (2020)","journal-title":"IEEE Access"},{"key":"632_CR28","unstructured":"Longa, A., Lachi, V., Santin, G., Bianchini, M., Lepri, B., Lio, P., Scarselli, F., Passerini, A.: Graph neural networks for temporal graphs: State of the art, open challenges, and opportunities. arXiv preprint arXiv:2302.01018 (2023)"},{"issue":"5\u20136","key":"632_CR29","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1561\/2200000076","volume":"13","author":"K Borgwardt","year":"2020","unstructured":"Borgwardt, K., Ghisu, E., Llinares-L\u00f3pez, F., O\u2019Bray, L., Rieck, B., et al.: Graph kernels: state-of-the-art and future challenges. Found. Trends\u00ae Machine Learn. 13(5\u20136), 531\u2013712 (2020)","journal-title":"Found. Trends\u00ae Machine Learn."},{"key":"632_CR30","unstructured":"Du, S.S., Hou, K., Salakhutdinov, R.R., Poczos, B.,Wang, R., Xu, K.: Graph neural tangent kernel: fusing graph neural networks with graph kernels. In: Proceedings of the 33rd International Conference on Neural Information Processing Systems, Article no. 514. Curran Associates Inc., Red Hook, NY"},{"key":"632_CR31","unstructured":"Kumar, S., Zhang, X., Leskovec, J.: Learning dynamic embeddings from temporal interactions. arXiv preprint arXiv:1812.02289 (2018)"},{"key":"632_CR32","doi-asserted-by":"crossref","unstructured":"Taheri, A., Gimpel, K., Berger-Wolf, T.: Learning to represent the evolution of dynamic graphs with recurrent models. In: Companion Proceedings of the 2019 World Wide Web Conference, pp. 301\u2013307 (2019)","DOI":"10.1145\/3308560.3316581"},{"issue":"2","key":"632_CR33","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S1286-4579(02)00058-8","volume":"5","author":"F Liljeros","year":"2003","unstructured":"Liljeros, F., Edling, C.R., Amaral, L.A.N.: Sexual networks: implications for the transmission of sexually transmitted infections. Microbes Infect. 5(2), 189\u2013196 (2003)","journal-title":"Microbes Infect."},{"key":"632_CR34","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-540-69311-6_21","volume":"5059","author":"K Okamoto","year":"2008","unstructured":"Okamoto, K., Chen, W., Li, X.-Y.: Ranking of closeness centrality for large-scale social networks. Lect. Notes Comput. Sci. 5059, 186\u2013195 (2008)","journal-title":"Lect. Notes Comput. Sci."},{"issue":"2","key":"632_CR35","first-page":"236","volume":"13","author":"G Khanna","year":"2020","unstructured":"Khanna, G., Chaturvedi, S.K., Soh, S.: Two-terminal reliability analysis for time-evolving and predictable delay-tolerant networks. Recent Adv. Electr. Electron. Eng. (Formerly Recent Patents on Electrical & Electronic Engineering) 13(2), 236\u2013250 (2020)","journal-title":"Recent Adv. Electr. Electron. Eng. (Formerly Recent Patents on Electrical & Electronic Engineering)"},{"issue":"4","key":"632_CR36","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1080\/15427951.2016.1177801","volume":"12","author":"O Michail","year":"2016","unstructured":"Michail, O.: An introduction to temporal graphs: an algorithmic perspective. Internet Math. 12(4), 239\u2013280 (2016)","journal-title":"Internet Math."},{"key":"632_CR37","doi-asserted-by":"crossref","unstructured":"Wu, B., Yuan, C., Hu, W.: Human action recognition based on context-dependent graph kernels. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 2609\u20132616 (2014)","DOI":"10.1109\/CVPR.2014.334"},{"issue":"6","key":"632_CR38","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1016\/j.physa.2008.11.021","volume":"388","author":"V Kostakos","year":"2009","unstructured":"Kostakos, V.: Temporal graphs. Phys. A 388(6), 1007\u20131023 (2009)","journal-title":"Phys. A"},{"key":"632_CR39","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1613\/jair.1.13225","volume":"72","author":"G Nikolentzos","year":"2021","unstructured":"Nikolentzos, G., Siglidis, G., Vazirgiannis, M.: Graph kernels: a survey. J. Artif. Intell. Res. 72, 943\u20131027 (2021)","journal-title":"J. Artif. Intell. Res."},{"key":"632_CR40","unstructured":"Srambical, F., Rieck, B.: Filtration surfaces for dynamic graph classification. arXiv preprint arXiv:2309.03616 (2023)"},{"issue":"8","key":"632_CR41","first-page":"2883","volume":"50","author":"H Wang","year":"2018","unstructured":"Wang, H., Wu, J., Zhu, X., Chen, Y., Zhang, C.: Time-variant graph classification. IEEE Trans. Actions Syst. Man Cybern. Syst. 50(8), 2883\u20132896 (2018)","journal-title":"IEEE Trans. Actions Syst. Man Cybern. Syst."},{"key":"632_CR42","unstructured":"Oettershagen, L.: Temporal graph algorithms. PhD thesis, Universit\u00e4ts-und Landesbibliothek Bonn (2022)"},{"key":"632_CR43","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106376","volume":"142","author":"A Apsemidis","year":"2020","unstructured":"Apsemidis, A., Psarakis, S., Moguerza, J.M.: A review of machine learning kernel methods in statistical process monitoring. Comput. Ind. Eng. 142, 106376 (2020)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"632_CR44","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.ajhg.2011.05.029","volume":"89","author":"MC Wu","year":"2011","unstructured":"Wu, M.C., Lee, S., Cai, T., Li, Y., Boehnke, M., Lin, X.: Rare-variant association testing for sequencing data with the sequence kernel association test. Am. J. Human Genet. 89(1), 82\u201393 (2011)","journal-title":"Am. J. Human Genet."},{"key":"632_CR45","doi-asserted-by":"crossref","unstructured":"Cao, C., Kwok, D., Edie, S., Li, Q., Ding, B., Kossinna, P., Campbell, S., Wu, J., Greenberg, M., Long, Q.: ktwas: integrating kernel machine with transcriptome-wide association studies improves statistical power and reveals novel genes. Brief. Bioinform. 22(4), 270 (2021)","DOI":"10.1093\/bib\/bbaa270"},{"issue":"2","key":"632_CR46","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1093\/genetics\/iyab216","volume":"220","author":"C Cao","year":"2022","unstructured":"Cao, C., Kossinna, P., Kwok, D., Li, Q., He, J., Su, L., Guo, X., Zhang, Q., Long, Q.: Disentangling genetic feature selection and aggregation in transcriptome-wide association studies. Genetics 220(2), 216 (2022)","journal-title":"Genetics"},{"key":"632_CR47","unstructured":"Borgwardt, K.M., Kriegel, H.-P.: Shortest-path kernels on graphs. In: Fifth IEEE International Conference on Data Mining (ICDM\u201905), p. 8 (2005). IEEE"},{"key":"632_CR48","unstructured":"Xu, K., Hu, W., Leskovec, J., Jegelka, S.: How powerful are graph neural networks? arXiv preprint arXiv:1810.00826 (2018)"},{"key":"632_CR49","doi-asserted-by":"crossref","unstructured":"Simonovsky, M., Komodakis, N.: Dynamic edge-conditioned filters in convolutional neural networks on graphs. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 3693\u20133702 (2017)","DOI":"10.1109\/CVPR.2017.11"},{"key":"632_CR50","unstructured":"Morris, C., Kriege, N.M., Bause, F., Kersting, K., Mutzel, P., Neumann, M.: Tudataset: A collection of benchmark datasets for learning with graphs. arXiv preprint arXiv:2007.08663 (2020)"},{"issue":"2","key":"632_CR51","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/0201008","volume":"1","author":"AV Aho","year":"1972","unstructured":"Aho, A.V., Garey, M.R., Ullman, J.D.: The transitive reduction of a directed graph. SIAM J. Comput. 1(2), 131\u2013137 (1972)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"632_CR52","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1961189.1961199","volume":"2","author":"C-C Chang","year":"2011","unstructured":"Chang, C.-C., Lin, C.-J.: Libsvm: a library for support vector machines. ACM Trans. Intell. Syst. Technol. (TIST) 2(3), 1\u201327 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol. (TIST)"},{"key":"632_CR53","unstructured":"Hagberg, A.A., Schult, D., Swart, P.: NetworkX. Accessed: May 8, 2023 (2008) https:\/\/networkx.github.io\/"},{"key":"632_CR54","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.aiopen.2021.01.001","volume":"1","author":"J Zhou","year":"2020","unstructured":"Zhou, J., Cui, G., Hu, S., Zhang, Z., Yang, C., Liu, Z., Wang, L., Li, C., Sun, M.: Graph neural networks: a review of methods and applications. AI Open 1, 57\u201381 (2020)","journal-title":"AI Open"},{"key":"632_CR55","unstructured":"Proch\u00e1zka, P., Mare\u0161, M., D\u011bdi\u010d, M.: Scalable graph size reduction for efficient GNN application (2022)"}],"container-title":["International Journal of Data Science and Analytics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-024-00632-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41060-024-00632-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-024-00632-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T09:15:17Z","timestamp":1738833317000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41060-024-00632-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,22]]},"references-count":55,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["632"],"URL":"https:\/\/doi.org\/10.1007\/s41060-024-00632-8","relation":{},"ISSN":["2364-415X","2364-4168"],"issn-type":[{"type":"print","value":"2364-415X"},{"type":"electronic","value":"2364-4168"}],"subject":[],"published":{"date-parts":[[2024,10,22]]},"assertion":[{"value":"21 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}