{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:26:13Z","timestamp":1772119573813,"version":"3.50.1"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,12,20]],"date-time":"2024-12-20T00:00:00Z","timestamp":1734652800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2024,12,20]],"date-time":"2024-12-20T00:00:00Z","timestamp":1734652800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Artif Intell Rev"],"DOI":"10.1007\/s10462-024-10971-4","type":"journal-article","created":{"date-parts":[[2024,12,20]],"date-time":"2024-12-20T13:08:04Z","timestamp":1734700084000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Graph reduction techniques for instance selection: comparative and empirical study"],"prefix":"10.1007","volume":"58","author":[{"given":"Zahiriddin","family":"Rustamov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nazar","family":"Zaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaloliddin","family":"Rustamov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ayham","family":"Zaitouny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafat","family":"Damseh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,20]]},"reference":[{"key":"10971_CR1","doi-asserted-by":"publisher","unstructured":"Akiba T, Sano S, Yanase T, Ohta T, Koyama M (2024) Optuna: A next-generation hyperparameter optimization framework. In: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining, pp. 2623\u20132631. ACM. https:\/\/doi.org\/10.1145\/3292500.3330701 . https:\/\/dl.acm.org\/doi\/10.1145\/3292500.3330701 Accessed 13 April 2024","DOI":"10.1145\/3292500.3330701"},{"key":"10971_CR2","doi-asserted-by":"publisher","unstructured":"Albelwi S, Mahmood A (2016) Analysis of instance selection algorithms on large datasets with deep convolutional neural networks. In: 2016 IEEE long Island systems, applications and technology conference (LISAT), pp. 1\u20135. IEEE. https:\/\/doi.org\/10.1109\/LISAT.2016.7494142 . http:\/\/ieeexplore.ieee.org\/document\/7494142\/ Accessed 19 March 2024","DOI":"10.1109\/LISAT.2016.7494142"},{"key":"10971_CR3","unstructured":"Asuncion A, Newman D et al (2007) UCI machine learning repository. Irvine, CA, USA"},{"key":"10971_CR4","unstructured":"Batagelj V, Zaversnik M (2003) An O(m) algorithm for cores decomposition of networks. arXiv. http:\/\/arxiv.org\/abs\/cs\/0310049 Accessed 12 April 2024"},{"issue":"8","key":"10971_CR5","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1145\/2492007.2492029","volume":"56","author":"J Batson","year":"2013","unstructured":"Batson J, Spielman DA, Srivastava N, Teng S-H (2013) Spectral sparsification of graphs: theory and algorithms. Commun ACM 56(8):87\u201394. https:\/\/doi.org\/10.1145\/2492007.2492029","journal-title":"Commun ACM"},{"issue":"1","key":"10971_CR6","doi-asserted-by":"publisher","first-page":"151","DOI":"10.2478\/amcs-2019-0012","volume":"29","author":"M Blachnik","year":"2019","unstructured":"Blachnik M (2019) Ensembles of instance selection methods: a comparative study. Int J Appl Math Comput Sci 29(1):151\u2013168. https:\/\/doi.org\/10.2478\/amcs-2019-0012","journal-title":"Int J Appl Math Comput Sci"},{"issue":"11","key":"10971_CR7","doi-asserted-by":"publisher","first-page":"3933","DOI":"10.3390\/app10113933","volume":"10","author":"M Blachnik","year":"2022","unstructured":"Blachnik M, Kordos M (2022) Comparison of instance selection and construction methods with various classifiers. Appl Sci 10(11):3933. https:\/\/doi.org\/10.3390\/app10113933","journal-title":"Appl Sci"},{"issue":"10","key":"10971_CR8","doi-asserted-by":"publisher","first-page":"10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume J-L, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech 2008(10):10008. https:\/\/doi.org\/10.1088\/1742-5468\/2008\/10\/P10008","journal-title":"J Stat Mech"},{"issue":"7","key":"10971_CR9","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1016\/S0031-3203(96)00142-2","volume":"30","author":"AP Bradley","year":"1997","unstructured":"Bradley AP (1997) The use of the area under the ROC curve in the evaluation of machine learning algorithms. Pattern Recogn 30(7):1145\u20131159. https:\/\/doi.org\/10.1016\/S0031-3203(96)00142-2","journal-title":"Pattern Recogn"},{"issue":"6","key":"10971_CR10","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1109\/TEVC.2003.819265","volume":"7","author":"JR Cano","year":"2003","unstructured":"Cano JR, Herrera F, Lozano M (2003) Using evolutionary algorithms as instance selection for data reduction in KDD: an experimental study. IEEE Trans. Evol. Computat. 7(6):561\u2013575. https:\/\/doi.org\/10.1109\/TEVC.2003.819265","journal-title":"IEEE Trans. Evol. Computat."},{"issue":"1","key":"10971_CR11","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s40324-021-00282-x","volume":"79","author":"J Chen","year":"2022","unstructured":"Chen J, Saad Y, Zhang Z (2022) Graph coarsening: from scientific computing to machine learning. SeMA J 79(1):187\u2013223. https:\/\/doi.org\/10.1007\/s40324-021-00282-x","journal-title":"SeMA J"},{"issue":"3","key":"10971_CR12","doi-asserted-by":"publisher","first-page":"427","DOI":"10.14778\/3632093.3632106","volume":"17","author":"Y Chen","year":"2023","unstructured":"Chen Y, Ye H, Vedula S, Bronstein A, Dreslinski R, Mudge T, Talati N (2023) Demystifying graph sparsification algorithms in graph properties preservation. Proc VLDB Endow 17(3):427\u2013440. https:\/\/doi.org\/10.14778\/3632093.3632106","journal-title":"Proc VLDB Endow"},{"key":"10971_CR13","doi-asserted-by":"publisher","unstructured":"Clauset A, Newman MEJ, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70(6):066111. https:\/\/doi.org\/10.1103\/PhysRevE.70.066111. Accessed 3 April 2024","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"10971_CR14","doi-asserted-by":"publisher","unstructured":"Coscia M, Rossetti G, Giannotti F, Pedreschi D (2014) Uncovering hierarchical and overlapping communities with a local-first approach. ACM Trans Knowl Discov Data 9(1):1\u201327. https:\/\/doi.org\/10.1145\/2629511. Accessed 3 April 2024","DOI":"10.1145\/2629511"},{"key":"10971_CR15","doi-asserted-by":"publisher","unstructured":"Coscia M, Rossetti G, Giannotti F, Pedreschi D (2024) DEMON: a local-first discovery method for overlapping communities. In: Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining, pp. 615\u2013623. ACM. https:\/\/doi.org\/10.1145\/2339530.2339630 . https:\/\/dl.acm.org\/doi\/10.1145\/2339530.2339630 Accessed 3 April 2024","DOI":"10.1145\/2339530.2339630"},{"issue":"13","key":"10971_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3582000","volume":"55","author":"W Cunha","year":"2023","unstructured":"Cunha W, Viegas F, Fran\u00e7a C, Rosa T, Rocha L, Gon\u00e7alves MA (2023) A comparative survey of instance selection methods applied to non-neural and transformer-based text classification. ACM Comput Surv 55(13):1\u201352. https:\/\/doi.org\/10.1145\/3582000","journal-title":"ACM Comput Surv"},{"key":"10971_CR17","first-page":"255","volume":"17","author":"J Derrac","year":"2015","unstructured":"Derrac J, Garcia S, Sanchez L, Herrera F (2015) Keel data-mining software tool: data set repository, integration of algorithms and experimental analysis framework. J Mult Valued Logic Soft Comput 17:255\u2013287","journal-title":"J Mult Valued Logic Soft Comput"},{"issue":"5","key":"10971_CR18","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1145\/265910.265914","volume":"44","author":"D Eppstein","year":"1997","unstructured":"Eppstein D, Galil Z, Italiano GF, Nissenzweig A (1997) Sparsification-a technique for speeding up dynamic graph algorithms. J ACM 44(5):669\u2013696. https:\/\/doi.org\/10.1145\/265910.265914","journal-title":"J ACM"},{"issue":"8","key":"10971_CR19","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1016\/j.patrec.2005.10.010","volume":"27","author":"T Fawcett","year":"2006","unstructured":"Fawcett T (2006) An introduction to ROC analysis. Pattern Recogn Lett 27(8):861\u2013874. https:\/\/doi.org\/10.1016\/j.patrec.2005.10.010","journal-title":"Pattern Recogn Lett"},{"issue":"5814","key":"10971_CR20","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1126\/science.1136800","volume":"315","author":"BJ Frey","year":"2007","unstructured":"Frey BJ, Dueck D (2007) Clustering by passing messages between data points. Science 315(5814):972\u2013976. https:\/\/doi.org\/10.1126\/science.1136800","journal-title":"Science"},{"key":"10971_CR21","unstructured":"Gao X, Yu J, Jiang W, Chen T, Zhang W, Yin H (2024) Graph condensation: a survey. arXiv. http:\/\/arxiv.org\/abs\/2401.11720 Accessed 19 March 2024"},{"issue":"3","key":"10971_CR22","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1109\/TPAMI.2011.142","volume":"34","author":"S Garcia","year":"2012","unstructured":"Garcia S, Derrac J, Cano JR, Herrera F (2012) Prototype selection for nearest neighbor classification: taxonomy and empirical study. IEEE Trans Pattern Anal Mach Intell 34(3):417\u2013435. https:\/\/doi.org\/10.1109\/TPAMI.2011.142","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"10971_CR23","doi-asserted-by":"crossref","unstructured":"Hashemi M, Gong S, Ni J, Fan W, Prakash BA, Jin W (2024) A comprehensive survey on graph reduction: sparsification, coarsening, and condensation. arXiv. http:\/\/arxiv.org\/abs\/2402.03358 Accessed 19 March 2024","DOI":"10.24963\/ijcai.2024\/891"},{"issue":"1","key":"10971_CR24","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1093\/biomet\/57.1.97","volume":"57","author":"WK Hastings","year":"1970","unstructured":"Hastings WK (1970) Monte Carlo sampling methods using Markov chains and their applications. Biometrika 57(1):97\u2013109. https:\/\/doi.org\/10.1093\/biomet\/57.1.97","journal-title":"Biometrika"},{"key":"10971_CR25","doi-asserted-by":"publisher","unstructured":"Leskovec J, Faloutsos C (2006) Sampling from large graphs. In: Proceedings of the 12th ACM SIGKDD international conference on knowledge discovery and data mining, pp. 631\u2013636. ACM. https:\/\/doi.org\/10.1145\/1150402.1150479 . https:\/\/dl.acm.org\/doi\/10.1145\/1150402.1150479 Accessed 10 April 2024","DOI":"10.1145\/1150402.1150479"},{"issue":"3","key":"10971_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3186727","volume":"51","author":"Y Liu","year":"2019","unstructured":"Liu Y, Safavi T, Dighe A, Koutra D (2019) Graph summarization methods and applications: a survey. ACM Comput Surv 51(3):1\u201334. https:\/\/doi.org\/10.1145\/3186727","journal-title":"ACM Comput Surv"},{"key":"10971_CR27","doi-asserted-by":"publisher","first-page":"115072","DOI":"10.1016\/j.eswa.2021.115072","volume":"179","author":"M Malekipirbazari","year":"2021","unstructured":"Malekipirbazari M, Aksakalli V, Shafqat W, Eberhard A (2021) Performance comparison of feature selection and extraction methods with random instance selection. Expert Syst Appl 179:115072. https:\/\/doi.org\/10.1016\/j.eswa.2021.115072","journal-title":"Expert Syst Appl"},{"key":"10971_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113297","volume":"149","author":"M Malhat","year":"2020","unstructured":"Malhat M, Menshawy ME, Mousa H, Sisi AE (2020) A new approach for instance selection: algorithms, evaluation, and comparisons. Expert Syst Appl 149:113297. https:\/\/doi.org\/10.1016\/j.eswa.2020.113297","journal-title":"Expert Syst Appl"},{"issue":"2","key":"10971_CR29","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1088\/0031-9155\/56\/2\/012","volume":"56","author":"MA Mazurowski","year":"2011","unstructured":"Mazurowski MA, Malof JM, Tourassi GD (2011) Comparative analysis of instance selection algorithms for instance-based classifiers in the context of medical decision support. Phys Med Biol 56(2):473\u2013489. https:\/\/doi.org\/10.1088\/0031-9155\/56\/2\/012","journal-title":"Phys Med Biol"},{"issue":"6","key":"10971_CR30","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis N, Rosenbluth AW, Rosenbluth MN, Teller AH, Teller E (1953) Equation of state calculations by fast computing machines. J Chem Phys 21(6):1087\u20131092. https:\/\/doi.org\/10.1063\/1.1699114","journal-title":"J Chem Phys"},{"key":"10971_CR31","volume-title":"Achieving business impact with data","author":"N Mohr","year":"2018","unstructured":"Mohr N, H\u00fcrtgen H (2018) Achieving business impact with data. Digital McKinsey, New York"},{"key":"10971_CR32","doi-asserted-by":"publisher","unstructured":"Newman MEJ (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74(3):036104. https:\/\/doi.org\/10.1103\/PhysRevE.74.036104. Accessed 3 April 2024","DOI":"10.1103\/PhysRevE.74.036104"},{"issue":"2","key":"10971_CR33","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10462-010-9165-y","volume":"34","author":"JA Olvera-L\u00f3pez","year":"2010","unstructured":"Olvera-L\u00f3pez JA, Carrasco-Ochoa JA, Mart\u00ednez-Trinidad JF, Kittler J (2010) A review of instance selection methods. Artif Intell Rev 34(2):133\u2013143. https:\/\/doi.org\/10.1007\/s10462-010-9165-y","journal-title":"Artif Intell Rev"},{"issue":"18","key":"10971_CR34","doi-asserted-by":"publisher","first-page":"3828","DOI":"10.3390\/electronics12183828","volume":"12","author":"E Ozturk Kiyak","year":"2023","unstructured":"Ozturk Kiyak E, Ghasemkhani B, Birant D (2023) High-level K-nearest Neighbors (HLKNN): a supervised machine learning model for classification analysis. Electronics 12(18):3828. https:\/\/doi.org\/10.3390\/electronics12183828","journal-title":"Electronics"},{"key":"10971_CR35","unstructured":"Page L, Brin S, Motwani R, Winograd T et al (1999) The pagerank citation ranking: bringing order to the web"},{"key":"10971_CR36","doi-asserted-by":"publisher","unstructured":"Pons P, Latapy M (2005) Computing communities in large networks using random walks. In: Yolum p, G\u00fcng\u00f6r T, G\u00fcrgen F, \u00d6zturan C (eds.) Computer and information sciences - ISCIS 2005 vol. 3733, pp. 284\u2013293. Springer. https:\/\/doi.org\/10.1007\/11569596_31. Series title: lecture notes in computer science. http:\/\/link.springer.com\/10.1007\/11569596_31 Accessed 3 April 2024","DOI":"10.1007\/11569596_31"},{"issue":"3","key":"10971_CR37","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.036106","volume":"76","author":"UN Raghavan","year":"2007","unstructured":"Raghavan UN, Albert R, Kumara S (2007) Near linear time algorithm to detect community structures in large-scale networks. Phys Rev E 76(3):036106. https:\/\/doi.org\/10.1103\/PhysRevE.76.036106","journal-title":"Phys Rev E"},{"key":"10971_CR38","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1023\/A:1007626913721","volume":"38","author":"D Randall","year":"2000","unstructured":"Randall D, Tony RM (2000) Reduction techniques for instance-based learning algorithms. Mach Learn 38:257\u2013286. https:\/\/doi.org\/10.1023\/A:1007626913721","journal-title":"Mach Learn"},{"key":"10971_CR39","doi-asserted-by":"publisher","unstructured":"Rehman SU, Khan AU, Fong S (2012) Graph mining: a survey of graph mining techniques. In: Seventh international conference on digital information management (ICDIM 2012), pp. 88\u201392. IEEE. https:\/\/doi.org\/10.1109\/ICDIM.2012.6360146 . http:\/\/ieeexplore.ieee.org\/document\/6360146\/","DOI":"10.1109\/ICDIM.2012.6360146"},{"key":"10971_CR40","doi-asserted-by":"publisher","unstructured":"Reichardt J, Bornholdt S (2006) Statistical mechanics of community detection. Phys Rev E 74(1):016110. https:\/\/doi.org\/10.1103\/PhysRevE.74.016110. Accessed 3 April 2024","DOI":"10.1103\/PhysRevE.74.016110"},{"issue":"4","key":"10971_CR41","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1073\/pnas.0706851105","volume":"105","author":"M Rosvall","year":"2008","unstructured":"Rosvall M, Bergstrom CT (2008) Maps of random walks on complex networks reveal community structure. Proc Natl Acad Sci USA 105(4):1118\u20131123. https:\/\/doi.org\/10.1073\/pnas.0706851105","journal-title":"Proc Natl Acad Sci USA"},{"issue":"1","key":"10971_CR42","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1140\/epjst\/e2010-01179-1","volume":"178","author":"M Rosvall","year":"2009","unstructured":"Rosvall M, Axelsson D, Bergstrom CT (2009) The map equation. Eur Phys J Spec Top 178(1):13\u201323. https:\/\/doi.org\/10.1140\/epjst\/e2010-01179-1","journal-title":"Eur Phys J Spec Top"},{"issue":"10","key":"10971_CR43","doi-asserted-by":"publisher","first-page":"7782","DOI":"10.3390\/su15107782","volume":"15","author":"J Rustamov","year":"2023","unstructured":"Rustamov J, Rustamov Z, Zaki N (2023) Green space quality analysis using machine learning approaches. Sustainability 15(10):7782. https:\/\/doi.org\/10.3390\/su15107782","journal-title":"Sustainability"},{"key":"10971_CR44","doi-asserted-by":"publisher","DOI":"10.1016\/j.technovation.2020.102173","volume":"98","author":"A Sestino","year":"2020","unstructured":"Sestino A, Prete MI, Piper L, Guido G (2020) Internet of things and big data as enablers for business digitalization strategies. Technovation 98:102173. https:\/\/doi.org\/10.1016\/j.technovation.2020.102173","journal-title":"Technovation"},{"key":"10971_CR45","doi-asserted-by":"publisher","unstructured":"Shabani N, Wu J, Beheshti A, Sheng QZ, Foo J, Haghighi V, Hanif A, Shahabikargar M (2024) A comprehensive survey on graph summarization with graph neural networks, pp. 1\u201321 https:\/\/doi.org\/10.1109\/TAI.2024.3350545. Accessed 19 March 2024","DOI":"10.1109\/TAI.2024.3350545"},{"issue":"2","key":"10971_CR46","first-page":"469","volume":"11","author":"S Shah","year":"2020","unstructured":"Shah S, Shabbir H, Rehman S, Waqas M (2020) A comparative study of feature selection approaches: 2016\u20132020. Int J Sci Eng Res 11(2):469","journal-title":"Int J Sci Eng Res"},{"issue":"4","key":"10971_CR47","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1137\/08074489X","volume":"40","author":"DA Spielman","year":"2011","unstructured":"Spielman DA, Teng S-H (2011) Spectral sparsification of graphs. SIAM J Comput 40(4):981\u20131025. https:\/\/doi.org\/10.1137\/08074489X","journal-title":"SIAM J Comput"},{"issue":"5","key":"10971_CR48","doi-asserted-by":"publisher","first-page":"980","DOI":"10.1177\/14614448211017887","volume":"25","author":"S Taffel","year":"2023","unstructured":"Taffel S (2023) Data and oil: metaphor, materiality and metabolic rifts. New Media Soc 25(5):980\u2013998. https:\/\/doi.org\/10.1177\/14614448211017887","journal-title":"New Media Soc"},{"key":"10971_CR49","doi-asserted-by":"publisher","unstructured":"Traag VA, Bruggeman J (2009) Community detection in networks with positive and negative links. Phys Rev E 80(3):036115. https:\/\/doi.org\/10.1103\/PhysRevE.80.036115. Accessed 3 April 2024","DOI":"10.1103\/PhysRevE.80.036115"},{"key":"10971_CR50","doi-asserted-by":"publisher","unstructured":"Traag VA, Waltman L, Van Eck NJ (2019) From louvain to leiden: guaranteeing well-connected communities. Sci Rep 9(1):5233. https:\/\/doi.org\/10.1038\/s41598-019-41695-z. Accessed 3 April 2024","DOI":"10.1038\/s41598-019-41695-z"},{"issue":"4","key":"10971_CR51","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1109\/TCSS.2018.2875626","volume":"5","author":"P Wagenseller","year":"2018","unstructured":"Wagenseller P, Wang F, Wu W (2018) Size matters: a comparative analysis of community detection algorithms. IEEE Trans Comput Soc Syst 5(4):951\u2013960. https:\/\/doi.org\/10.1109\/TCSS.2018.2875626","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"10971_CR52","volume-title":"TinyML: machine learning with Tensorflow lite on arduino, and ultra-low power micro-controllers","author":"P Warden","year":"2020","unstructured":"Warden P, Situnayake D (2020) TinyML: machine learning with Tensorflow lite on arduino, and ultra-low power micro-controllers. O\u2019Reilly, Sebastopol"},{"key":"10971_CR53","unstructured":"Xu H, Zhang L, Ma Y, Zhou S, Zheng Z, Jiajun B (2024) A survey on graph condensation. arXiv. http:\/\/arxiv.org\/abs\/2402.02000 Accessed 19 March 2024"},{"issue":"1","key":"10971_CR54","doi-asserted-by":"publisher","first-page":"30750","DOI":"10.1038\/srep30750","volume":"6","author":"Z Yang","year":"2016","unstructured":"Yang Z, Algesheimer R, Tessone CJ (2016) A comparative analysis of community detection algorithms on artificial networks. Sci Rep 6(1):30750. https:\/\/doi.org\/10.1038\/srep30750","journal-title":"Sci Rep"},{"issue":"24","key":"10971_CR55","doi-asserted-by":"publisher","first-page":"13235","DOI":"10.1007\/s00500-019-03865-z","volume":"23","author":"L Yang","year":"2019","unstructured":"Yang L, Zhu Q, Huang J, Wu Q, Cheng D, Hong X (2019) Constraint nearest neighbor for instance reduction. Soft Comput 23(24):13235\u201313245. https:\/\/doi.org\/10.1007\/s00500-019-03865-z","journal-title":"Soft Comput"},{"key":"10971_CR56","doi-asserted-by":"publisher","DOI":"10.1007\/s41060-024-00565-2","author":"N Zaki","year":"2024","unstructured":"Zaki N, Krishnan A, Turaev S, Rustamov Z, Rustamov J, Almusalami A, Ayyad F, Regasa T, Iriho BB (2024) Node embedding approach for accurate detection of fake reviews: a graph-based machine learning approach with explainable AI. Int J Data Sci Anal. https:\/\/doi.org\/10.1007\/s41060-024-00565-2","journal-title":"Int J Data Sci Anal"}],"container-title":["Artificial Intelligence Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-024-10971-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10462-024-10971-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-024-10971-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T22:44:57Z","timestamp":1738190697000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10462-024-10971-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,20]]},"references-count":56,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2025,2]]}},"alternative-id":["10971"],"URL":"https:\/\/doi.org\/10.1007\/s10462-024-10971-4","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-4523421\/v1","asserted-by":"object"}]},"ISSN":["1573-7462"],"issn-type":[{"value":"1573-7462","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,20]]},"assertion":[{"value":"24 September 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2024","order":2,"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 that they have no potential conflicts or Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"62"}}