{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T00:20:20Z","timestamp":1767831620314,"version":"3.49.0"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T00:00:00Z","timestamp":1651017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T00:00:00Z","timestamp":1651017600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000266","name":"engineering and physical sciences research council","doi-asserted-by":"publisher","award":["EP\/L015382\/1"],"award-info":[{"award-number":["EP\/L015382\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"published-print":{"date-parts":[[2022,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We investigate the optimisation capabilities of an algorithm inspired by the Evolutionary Transitions in Individuality. In these transitions, the natural evolutionary process is repeatedly rescaled through successive levels of biological organisation. Each transition creates new higher-level evolutionary units that combine multiple units from the level below. We call the algorithm Deep Optimisation (DO) to recognise both its use of deep learning methods and the multi-level rescaling of biological evolutionary processes. The evolutionary model used in DO is a simple hill-climber, but, as higher-level representations are learned, the hill-climbing process is repeatedly rescaled to operate in successively higher-level representations. The transition process is based on a deep learning neural network (NN), specifically a deep auto-encoder. Our experiments with DO start with a study using the NP-hard problem, multiple knapsack (MKP). Comparing with state-of-the-art model-building optimisation algorithms (MBOAs), we show that DO finds better solutions to MKP instances and does so without using a problem-specific repair operator. A second, much more in-depth investigation uses a class of configurable problems to understand more precisely the distinct problem characteristics that DO can solve that other MBOAs cannot. Specifically, we observe a polynomial vs exponential scaling distinction where DO is the only algorithm to show polynomial scaling for all problems. We also demonstrate that some problem characteristics need a deep network in DO. In sum, our findings suggest that the use of deep learning principles have significant untapped potential in combinatorial optimisation. Moreover, we argue that natural evolution could be implementing something like DO, and the evolutionary transitions in individuality are the observable result.<\/jats:p>","DOI":"10.1007\/s42979-022-01109-w","type":"journal-article","created":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T15:06:37Z","timestamp":1651071997000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Deep Optimisation: Transitioning the Scale of Evolutionary Search by Inducing and Searching in Deep Representations"],"prefix":"10.1007","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6531-2289","authenticated-orcid":false,"given":"Jamie","family":"Caldwell","sequence":"first","affiliation":[]},{"given":"Joshua","family":"Knowles","sequence":"additional","affiliation":[]},{"given":"Christoph","family":"Thies","sequence":"additional","affiliation":[]},{"given":"Filip","family":"Kubacki","sequence":"additional","affiliation":[]},{"given":"Richard","family":"Watson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,27]]},"reference":[{"issue":"12","key":"1109_CR1","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.1057\/palgrave.jors.2602308","volume":"58","author":"U Aickelin","year":"2007","unstructured":"Aickelin U, Burke EK, Li J. An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering. J Oper Res Soc. 2007;58(12):1574\u201385.","journal-title":"J Oper Res Soc"},{"key":"1109_CR2","unstructured":"Bello I, Pham H, Le QV, Norouzi M, Bengio S. Neural combinatorial optimization with reinforcement learning. 2016. arXiv:1611.09940"},{"key":"1109_CR3","unstructured":"Bosman PA, Thierens D. Linkage information processing in distribution estimation algorithms, vol. 1999. Information and Computing Sciences: Utrecht University; 1999."},{"issue":"Nov","key":"1109_CR4","first-page":"77","volume":"1","author":"J Boyan","year":"2000","unstructured":"Boyan J, Moore AW. Learning evaluation functions to improve optimization by local search. J Mach Learn Res. 2000;1(Nov):77\u2013112.","journal-title":"J Mach Learn Res"},{"key":"1109_CR5","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/978-3-030-72699-7_32","volume-title":"Applications of evolutionary computation","author":"J Caldwell","year":"2021","unstructured":"Caldwell J, Knowles J, Thies C, Kubacki F, Watson R. Deep optimisation: multi-scale evolution by inducing and searching in deep representations. In: Castillo PA, Jim\u00e9nez Laredo JL, editors. Applications of evolutionary computation. Cham: Springer International Publishing; 2021. p. 506\u201321."},{"key":"1109_CR6","unstructured":"Caldwell JR, Watson RA, Thies C, Knowles JD. Deep optimisation: solving combinatorial optimisation problems using deep neural networks. 2018. arXiv:1811.00784"},{"issue":"2","key":"1109_CR7","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1109\/TEVC.2013.2260548","volume":"18","author":"J Ceberio","year":"2013","unstructured":"Ceberio J, Irurozki E, Mendiburu A, Lozano JA. A distance-based ranking model estimation of distribution algorithm for the flowshop scheduling problem. IEEE Trans Evolut Comput. 2013;18(2):286\u2013300.","journal-title":"IEEE Trans Evolut Comput"},{"key":"1109_CR8","doi-asserted-by":"crossref","unstructured":"Chen PL, Peng CJ, Lu CY, Yu TL. Two-edge graphical linkage model for DSMGA-II. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp 745\u2013752. 2017","DOI":"10.1145\/3071178.3071236"},{"issue":"1","key":"1109_CR9","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"PC Chu","year":"1998","unstructured":"Chu PC, Beasley JE. A genetic algorithm for the multidimensional knapsack problem. J Heurist. 1998;4(1):63\u201386.","journal-title":"J Heurist"},{"key":"1109_CR10","unstructured":"Churchill AW, Sigtia S, Fernando C. A denoising autoencoder that guides stochastic search. 2014. arxiv.org\/abs\/1404.1614"},{"issue":"3","key":"1109_CR11","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1162\/artl_a_00030","volume":"17","author":"AP Davies","year":"2011","unstructured":"Davies AP, Watson RA, Mills R, Buckley CL, Noble J. \u201cif you can\u2019t be with the one you love, love the one you\u2019re with\u2019\u2019: how individual habituation of agent interactions improves global utility. Artif Life. 2011;17(3):167\u201381.","journal-title":"Artif Life"},{"issue":"1","key":"1109_CR12","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10479-005-5724-z","volume":"134","author":"PT De Boer","year":"2005","unstructured":"De Boer PT, Kroese DP, Mannor S, Rubinstein RY. A tutorial on the cross-entropy method. Ann Oper Res. 2005;134(1):19\u201367.","journal-title":"Ann Oper Res"},{"key":"1109_CR13","unstructured":"Goldberg DE (2006) Genetic algorithms. Pearson Education India"},{"issue":"2","key":"1109_CR14","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1023\/A:1022602019183","volume":"3","author":"DE Goldberg","year":"1988","unstructured":"Goldberg DE, Holland JH. Genetic algorithms and machine learning. Mach Learn. 1988;3(2):95\u20139.","journal-title":"Mach Learn"},{"key":"1109_CR15","doi-asserted-by":"publisher","unstructured":"Goldman BW, Punch WF (2014) Parameter-less population pyramid. In: Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation, Association for Computing Machinery, New York, NY, USA, GECCO 14, pp 785\u2013792. https:\/\/doi.org\/10.1145\/2576768.2598350,","DOI":"10.1145\/2576768.2598350"},{"issue":"3","key":"1109_CR16","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1162\/EVCO_a_00148","volume":"23","author":"BW Goldman","year":"2015","unstructured":"Goldman BW, Punch WF. Fast and efficient black box optimization using the parameter-less population pyramid. Evolut Comput. 2015;23(3):451\u201379.","journal-title":"Evolut Comput"},{"key":"1109_CR17","doi-asserted-by":"crossref","unstructured":"Hansen N. The CMA evolution strategy: a comparing review. In: Lozano J, Larra\u00f1aga P, Inza I, Bengoetxea E, editors. Towards a New Evolutionary Computation, Studies in Fuzziness and Soft Computing, vol. 192. Springer, p. 75\u2013102. 2006","DOI":"10.1007\/3-540-32494-1_4"},{"issue":"1","key":"1109_CR18","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen P, Mladenovi\u0107 N, P\u00e9rez JAM. Variable neighbourhood search: methods and applications. Ann Oper Res. 2010;175(1):367\u2013407.","journal-title":"Ann Oper Res"},{"key":"1109_CR19","unstructured":"Hern\u00e1ndez-Lobato JM, Gelbart M, Hoffman M, Adams R, Ghahramani Z. Predictive entropy search for Bayesian optimization with unknown constraints. In: International Conference on Machine Learning, PMLR, pp 1699\u20131707. 2015"},{"issue":"3","key":"1109_CR20","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF00339943","volume":"52","author":"JJ Hopfield","year":"1985","unstructured":"Hopfield JJ, Tank DW. Neural computation of decisions in optimization problems. Biol Cybern. 1985;52(3):141\u201352.","journal-title":"Biol Cybern"},{"key":"1109_CR21","doi-asserted-by":"crossref","unstructured":"Horn J, Goldberg DE, Deb K. Long path problems. In: International Conference on Parallel Problem Solving from Nature, Springer, pp 149\u2013158. 1994","DOI":"10.1007\/3-540-58484-6_259"},{"key":"1109_CR22","doi-asserted-by":"crossref","unstructured":"Hsu SH, Yu TL. Optimization by pairwise linkage detection, incremental linkage set, and restricted\/back mixing: DSMGA-II. In: Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, pp 519\u2013526. 2015","DOI":"10.1145\/2739480.2754737"},{"key":"1109_CR23","doi-asserted-by":"crossref","unstructured":"Iclanzan D, Dumitrescu D. Overcoming hierarchical difficulty by hill-climbing the building block structure. In: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, pp 1256\u20131263. 2007","DOI":"10.1145\/1276958.1277199"},{"key":"1109_CR24","unstructured":"Khalil E, Dai H, Zhang Y, Dilkina B, Song L. Learning combinatorial optimization algorithms over graphs. In: Advances in Neural Information Processing Systems, pp 6348\u20136358. 2017"},{"key":"1109_CR25","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.artint.2016.01.005","volume":"244","author":"M Lombardi","year":"2017","unstructured":"Lombardi M, Milano M, Bartolini A. Empirical decision model learning. Artif Intell. 2017;244:343\u201367.","journal-title":"Artif Intell"},{"key":"1109_CR26","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.swevo.2015.10.001","volume":"27","author":"JP Martins","year":"2016","unstructured":"Martins JP, Delbem AC. Pairwise independence and its impact on estimation of distribution algorithms. Swarm Evolut Comput. 2016;27:80\u201396.","journal-title":"Swarm Evolut Comput"},{"key":"1109_CR27","doi-asserted-by":"crossref","unstructured":"Martins JP, Neto CB, Crocomo MK, Vittori K, Delbem AC. A comparison of linkage-learning-based genetic algorithms in multidimensional knapsack problems. In: 2013 IEEE Congress on Evolutionary Computation, IEEE, pp 502\u2013509. 2013","DOI":"10.1109\/CEC.2013.6557610"},{"key":"1109_CR28","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.neucom.2014.04.069","volume":"146","author":"JP Martins","year":"2014","unstructured":"Martins JP, Fonseca CM, Delbem AC. On the performance of linkage-tree genetic algorithms for the multidimensional knapsack problem. Neurocomputing. 2014;146:17\u201329.","journal-title":"Neurocomputing"},{"key":"1109_CR29","doi-asserted-by":"crossref","unstructured":"Mazyavkina N, Sviridov S, Ivanov S, Burnaev E. Reinforcement learning for combinatorial optimization: a survey. 2020. arXiv: 2003.03600","DOI":"10.1016\/j.cor.2021.105400"},{"key":"1109_CR30","doi-asserted-by":"crossref","unstructured":"McCloskey M, Cohen NJ. Catastrophic interference in connectionist networks: The sequential learning problem. In: Psychology of learning and motivation, vol\u00a024, Elsevier, pp 109\u2013165. 1989","DOI":"10.1016\/S0079-7421(08)60536-8"},{"key":"1109_CR31","unstructured":"Mills R, Watson RA. Multi-scale search, modular variation, and adaptive neighbourhoods. Author\u2019s Original. 2011"},{"issue":"18","key":"1109_CR32","first-page":"1","volume":"18","author":"Y Ollivier","year":"2017","unstructured":"Ollivier Y, Arnold L, Auger A, Hansen N. Information-geometric optimization algorithms: A unifying picture via invariance principles. Journal of Machine Learning Research. 2017;18(18):1\u201365.","journal-title":"Journal of Machine Learning Research"},{"key":"1109_CR33","doi-asserted-by":"crossref","unstructured":"Pelikan M, Goldberg DE. Hierarchical BOA solves ising spin glasses and MAXSAT. In: Proceedings of the 2003 International Conference on Genetic and Evolutionary Computation: Part II, Springer-Verlag, Berlin, Heidelberg, GECCO\u201903, pp 1271\u20131282. 2003","DOI":"10.1007\/3-540-45110-2_3"},{"key":"1109_CR34","doi-asserted-by":"crossref","unstructured":"Pelikan M, Goldberg DE. Hierarchical Bayesian optimization algorithm. In: Scalable optimization via probabilistic modeling, Springer, pp 63\u201390. 2006","DOI":"10.1007\/978-3-540-34954-9_4"},{"key":"1109_CR35","unstructured":"Pelikan M, Goldberg DE, Cant\u00fa-Paz E, et\u00a0al. BOA: the bayesian optimization algorithm. In: Proceedings of the Genetic and Evolutionary Computation Conference GECCO-99, vol\u00a01, pp 525\u2013532. 1999"},{"key":"1109_CR36","unstructured":"Pelikan M, Goldberg DE, Tsutsui S. Hierarchical Bayesian optimization algorithm: toward a new generation of evolutionary algorithms. In: SICE 2003 Annual Conference (IEEE Cat. No. 03TH8734), IEEE, vol\u00a03, pp 2738\u20132743. 2003"},{"issue":"1","key":"1109_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13062-015-0094-1","volume":"10","author":"DA Power","year":"2015","unstructured":"Power DA, Watson RA, Szathm\u00e1ry E, Mills R, Powers ST, Doncaster CP, Czapp B. What can ecosystems learn? Expanding evolutionary ecology with learning theory. Biol Direct. 2015;10(1):1\u201324.","journal-title":"Biol Direct"},{"key":"1109_CR38","doi-asserted-by":"crossref","unstructured":"Probst M. Denoising autoencoders for fast combinatorial black box optimization 2015. arXiv:1503.01954","DOI":"10.1145\/2739482.2764691"},{"issue":"2","key":"1109_CR39","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/s10845-020-01587-w","volume":"32","author":"D Rodr\u00edguez Rueda","year":"2021","unstructured":"Rodr\u00edguez Rueda D, Cotta C, Fern\u00e1ndez-Leiva AJ. Metaheuristics for the template design problem: encoding, symmetry and hybridisation. J Intell Manuf. 2021;32(2):559\u201378.","journal-title":"J Intell Manuf"},{"key":"1109_CR40","unstructured":"Santana R. Gray-box optimization and factorized distribution algorithms: where two worlds collide. 2017. arXiv:1707.03093"},{"issue":"4","key":"1109_CR41","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1109\/TEVC.2007.906095","volume":"12","author":"R Santana","year":"2008","unstructured":"Santana R, Larra\u00f1aga P, Lozano JA. Protein folding in simplified models with estimation of distribution algorithms. IEEE Trans Evoluti Comput. 2008;12(4):418\u201338.","journal-title":"IEEE Trans Evoluti Comput"},{"key":"1109_CR42","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198502944.001.0001","volume-title":"The major transitions in evolution","author":"JM Smith","year":"1997","unstructured":"Smith JM, Szathm\u00e1ry E. The major transitions in evolution. Oxford: Oxford University Press; 1997."},{"key":"1109_CR43","unstructured":"Snoek J, Rippel O, Swersky K, Kiros R, Satish N, Sundaram N, Patwary M, Prabhat M, Adams R. Scalable bayesian optimization using deep neural networks. In: International Conference on Machine Learning, PMLR, pp 2171\u20132180. 2015"},{"issue":"2","key":"1109_CR44","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1162\/106365602320169811","volume":"10","author":"KO Stanley","year":"2002","unstructured":"Stanley KO, Miikkulainen R. Evolving neural networks through augmenting topologies. Evolut Comput. 2002;10(2):99\u2013127.","journal-title":"Evolut Comput"},{"issue":"1","key":"1109_CR45","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10479-008-0475-2","volume":"179","author":"H Terashima-Mar\u00edn","year":"2010","unstructured":"Terashima-Mar\u00edn H, Ross P, Far\u00edas-Z\u00e1rate C, L\u00f3pez-Camacho E, Valenzuela-Rend\u00f3n M. Generalized hyper-heuristics for solving 2d regular and irregular packing problems. Ann Oper Res. 2010;179(1):369\u201392.","journal-title":"Ann Oper Res"},{"key":"1109_CR46","doi-asserted-by":"crossref","unstructured":"Thierens D, Bosman PA. Hierarchical problem solving with the linkage tree genetic algorithm. In: Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, pp 877\u2013884. 2013","DOI":"10.1145\/2463372.2463477"},{"key":"1109_CR47","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.cor.2018.04.001","volume":"97","author":"N Vo-Thanh","year":"2018","unstructured":"Vo-Thanh N, Jans R, Schoen ED, Goos P. Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs. Comput Oper Res. 2018;97:96\u2013110.","journal-title":"Comput Oper Res"},{"key":"1109_CR48","unstructured":"Volpato R, Song G. Active learning to optimise time-expensive algorithm selection. 2019. arXiv:1909.03261"},{"issue":"3","key":"1109_CR49","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1111\/itor.12292","volume":"24","author":"KK Vu","year":"2017","unstructured":"Vu KK, D\u2019Ambrosio C, Hamadi Y, Liberti L. Surrogate-based methods for black-box optimization. Int Trans Oper Res. 2017;24(3):393\u2013424.","journal-title":"Int Trans Oper Res"},{"key":"1109_CR50","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1007\/11553090_90","volume-title":"Advances in artificial life","author":"RA Watson","year":"2005","unstructured":"Watson RA. On the unit of selection in sexual populations. In: Capcarr\u00e8re MS, Freitas AA, Bentley PJ, Johnson CG, Timmis J, editors. Advances in artificial life. Berlin, Heidelberg: Springer; 2005. p. 895\u2013905."},{"issue":"2","key":"1109_CR51","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.tree.2015.11.009","volume":"31","author":"RA Watson","year":"2016","unstructured":"Watson RA, Szathm\u00e1ry E. How can evolution learn? Trends Ecol Evolut. 2016;31(2):147\u201357.","journal-title":"Trends Ecol Evolut"},{"key":"1109_CR52","doi-asserted-by":"crossref","unstructured":"Watson RA, Hornby GS, Pollack JB. Modeling building-block interdependency. In: International Conference on Parallel Problem Solving from Nature, Springer, pp 97\u2013106. 1998","DOI":"10.1007\/BFb0056853"},{"issue":"5","key":"1109_CR53","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1002\/cplx.20346","volume":"16","author":"RA Watson","year":"2011","unstructured":"Watson RA, Buckley CL, Mills R. Optimization in self-modeling complex adaptive systems. Complexity. 2011;16(5):17\u201326.","journal-title":"Complexity"},{"issue":"4","key":"1109_CR54","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1177\/1059712311412797","volume":"19","author":"RA Watson","year":"2011","unstructured":"Watson RA, Mills R, Buckley CL. Transformations in the scale of behavior and the global optimization of constraints in adaptive networks. Adapt Behav. 2011;19(4):227\u201349.","journal-title":"Adapt Behav"},{"key":"1109_CR55","doi-asserted-by":"crossref","unstructured":"Watson RA, Levin M, Buckley CL. Design for an individual: connectionist approaches to the evolutionary transitions in individuality. Front Ecol Evolut Sect Soc Evolut. 2021","DOI":"10.3389\/fevo.2022.823588"},{"issue":"33","key":"1109_CR56","doi-asserted-by":"publisher","first-page":"10112","DOI":"10.1073\/pnas.1421402112","volume":"112","author":"SA West","year":"2015","unstructured":"West SA, Fisher RM, Gardner A, Kiers ET. Major evolutionary transitions in individuality. Proc Natl Acad Sci. 2015;112(33):10112\u20139.","journal-title":"Proc Natl Acad Sci"},{"key":"1109_CR57","doi-asserted-by":"crossref","unstructured":"Yi S, Wierstra D, Schaul T, Schmidhuber J. Stochastic search using the natural gradient. In: Proceedings of the 26th Annual International Conference on Machine Learning, pp 1161\u20131168. 2009","DOI":"10.1145\/1553374.1553522"},{"key":"1109_CR58","first-page":"1","volume":"1","author":"W Zhang","year":"2000","unstructured":"Zhang W, Dietterich TG. Solving combinatorial optimization tasks by reinforcement learning: a general methodology applied to resource-constrained scheduling. J Artif Intel Res. 2000;1:1\u201338.","journal-title":"J Artif Intel Res"},{"key":"1109_CR59","doi-asserted-by":"crossref","unstructured":"Zlochin M, Dorigo M. Model-based search for combinatorial optimization: A comparative study. In: International Conference on Parallel Problem Solving from Nature, Springer, pp 651\u2013661. 2002","DOI":"10.1007\/3-540-45712-7_63"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01109-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-022-01109-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01109-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,9]],"date-time":"2022-05-09T17:31:01Z","timestamp":1652117461000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-022-01109-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,27]]},"references-count":59,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["1109"],"URL":"https:\/\/doi.org\/10.1007\/s42979-022-01109-w","relation":{},"ISSN":["2662-995X","2661-8907"],"issn-type":[{"value":"2662-995X","type":"print"},{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,27]]},"assertion":[{"value":"21 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2022","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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"253"}}