{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T04:04:53Z","timestamp":1769054693909,"version":"3.49.0"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,12,12]],"date-time":"2022-12-12T00:00:00Z","timestamp":1670803200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,12]],"date-time":"2022-12-12T00:00:00Z","timestamp":1670803200000},"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":["Front. Comput. Sci."],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s11704-022-2023-7","type":"journal-article","created":{"date-parts":[[2022,12,12]],"date-time":"2022-12-12T09:03:21Z","timestamp":1670835801000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["An improved master-apprentice evolutionary algorithm for minimum independent dominating set problem"],"prefix":"10.1007","volume":"17","author":[{"given":"Shiwei","family":"Pan","sequence":"first","affiliation":[]},{"given":"Yiming","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Yiyuan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Zhiguo","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Jinchao","family":"Ji","sequence":"additional","affiliation":[]},{"given":"Minghao","family":"Yin","sequence":"additional","affiliation":[]},{"given":"Shuli","family":"Hu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,12]]},"reference":[{"issue":"2","key":"2023_CR1","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/s11036-008-0131-8","volume":"14","author":"H Samuel","year":"2009","unstructured":"Samuel H, Zhuang W, Preiss B. DTN based dominating set routing for MANET in heterogeneous wireless networking. Mobile Networks and Applications, 2009, 14(2): 154\u2013164","journal-title":"Mobile Networks and Applications"},{"key":"2023_CR2","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1613\/jair.5312","volume":"58","author":"M Abseher","year":"2017","unstructured":"Abseher M, Musliu N, Woltran S. Improving the efficiency of dynamic programming on tree decompositions via machine learning. Journal of Artificial Intelligence Research, 2017, 58: 829\u2013858","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"11","key":"2023_CR3","doi-asserted-by":"publisher","first-page":"2127","DOI":"10.1109\/JSAC.2006.881606","volume":"24","author":"B Aoun","year":"2006","unstructured":"Aoun B, Boutaba R, Iraqi Y, Kenward G. Gateway placement optimization in wireless mesh networks with QoS constraints. IEEE Journal on Selected Areas in Communications, 2006, 24(11): 2127\u20132136","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"2023_CR4","doi-asserted-by":"crossref","unstructured":"Potluri A, Bhagvati C. Novel morphological algorithms for dominating sets on graphs with applications to image analysis. In: Proceedings of the 15th International Workshop on Combinatorial Image Analysis. 2012, 249\u2013262","DOI":"10.1007\/978-3-642-34732-0_19"},{"issue":"5","key":"2023_CR5","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1049\/syb2.12021","volume":"15","author":"A A Alofairi","year":"2021","unstructured":"Alofairi A A, Mabrouk E, Elsemman I E. Constraint-based models for dominating protein interaction networks. IET Systems Biology, 2021, 15(5): 148\u2013162","journal-title":"IET Systems Biology"},{"key":"2023_CR6","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.engappai.2014.08.007","volume":"37","author":"Y Jin","year":"2015","unstructured":"Jin Y, Hao J K. General swap-based multiple neighborhood tabu search for the maximum independent set problem. Engineering Applications of Artificial Intelligence, 2015, 37: 20\u201333","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"2","key":"2023_CR7","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/j.csda.2004.02.004","volume":"48","author":"V Boginski","year":"2005","unstructured":"Boginski V, Butenko S, Pardalos P M. Statistical analysis of financial networks. Computational Statistics & Data Analysis, 2005, 48(2): 431\u2013443","journal-title":"Computational Statistics & Data Analysis"},{"issue":"1","key":"2023_CR8","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1109\/18.651069","volume":"44","author":"T Etzion","year":"1998","unstructured":"Etzion T, Ostergard P R J. Greedy and heuristic algorithms for codes and colorings. IEEE Transactions on Information Theory, 1998, 44(1): 382\u2013388","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"2023_CR9","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/j.adhoc.2004.04.003","volume":"2","author":"I F Akyildiz","year":"2004","unstructured":"Akyildiz I F, Kasimoglu I H. Wireless sensor and actor networks: research challenges. Ad Hoc Networks, 2004, 2(4): 351\u2013367","journal-title":"Ad Hoc Networks"},{"key":"2023_CR10","doi-asserted-by":"crossref","unstructured":"McLaughlan B, Akkaya K. Coverage-based clustering of wireless sensor and actor networks. In: Proceedings of IEEE International Conference on Pervasive Services. 2007, 45\u201354","DOI":"10.1109\/PERSER.2007.4283888"},{"issue":"2","key":"2023_CR11","first-page":"162","volume":"6","author":"K Erciyes","year":"2007","unstructured":"Erciyes K, Dagdeviren O, Cokuslu D, Ozsoyeller D. Graph theoretic clustering algorithms in mobile ad hoc networks and wireless sensor networks. Applied and Computational Mathematics, 2007, 6(2): 162\u2013180","journal-title":"Applied and Computational Mathematics"},{"key":"2023_CR12","first-page":"76","volume":"28","author":"Y Chen","year":"2004","unstructured":"Chen Y, Liestman A, Liu J. Clustering algorithms for ad hoc wireless networks. Ad Hoc and Sensor Networks, 2004, 28: 76\u201390","journal-title":"Ad Hoc and Sensor Networks"},{"issue":"7","key":"2023_CR13","doi-asserted-by":"publisher","first-page":"1265","DOI":"10.1109\/49.622910","volume":"15","author":"C R Lin","year":"1997","unstructured":"Lin C R, Gerla M. Adaptive clustering for mobile wireless networks. IEEE Journal on Selected areas in Communications, 1997, 15(7): 1265\u20131275","journal-title":"IEEE Journal on Selected areas in Communications"},{"key":"2023_CR14","doi-asserted-by":"crossref","unstructured":"Basagni S. Distributed clustering for ad hoc networks. In: Proceedings of the 4th International Symposium on Parallel Architectures, Algorithms, and Networks. 1999, 310\u2013315","DOI":"10.1109\/ISPAN.1999.778957"},{"key":"2023_CR15","unstructured":"Chen G, Nocetti F G, Gonzalez J S, Stojmenovic I. Connectivity based k-hop clustering in wireless networks. In: Proceedings of the 35th Annual Hawaii International Conference on System Sciences. 2002, 2450\u20132459"},{"key":"2023_CR16","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M R Garey","year":"1979","unstructured":"Garey M R, Johnson D S. Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W. H. Freeman, 1979"},{"key":"2023_CR17","doi-asserted-by":"crossref","unstructured":"Gaspers S, Liedloff M. A branch-and-reduce algorithm for finding a minimum independent dominating set in graphs. In: Proceedings of the 32nd International Workshop on Graph-Theoretic Concepts in Computer Science. 2006, 78\u201389","DOI":"10.1007\/11917496_8"},{"key":"2023_CR18","doi-asserted-by":"crossref","unstructured":"Liu C, Song Y. Exact algorithms for finding the minimum independent dominating set in graphs. In: Proceedings of the 17th International Symposium on Algorithms and Computation. 2006, 439\u2013448","DOI":"10.1007\/11940128_45"},{"issue":"4\u20135","key":"2023_CR19","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1016\/j.dam.2012.01.003","volume":"161","author":"N Bourgeois","year":"2013","unstructured":"Bourgeois N, Croce F D, Escoffier B, Paschos V T. Fast algorithms for min independent dominating set. Discrete Applied Mathematics, 2013, 161(4\u20135): 558\u2013572","journal-title":"Discrete Applied Mathematics"},{"issue":"6","key":"2023_CR20","doi-asserted-by":"publisher","first-page":"146321","DOI":"10.1007\/s11704-019-8441-5","volume":"14","author":"Y Liang","year":"2020","unstructured":"Liang Y, Huang H, Cai Z. PSO-ACSC: a large-scale evolutionary algorithm for image matting. Frontiers of Computer Science, 2020, 14(6): 146321","journal-title":"Frontiers of Computer Science"},{"key":"2023_CR21","doi-asserted-by":"publisher","first-page":"103230","DOI":"10.1016\/j.artint.2019.103230","volume":"280","author":"Y Wang","year":"2020","unstructured":"Wang Y, Cai S, Chen J, Yin M. SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem. Artificial Intelligence, 2020, 280: 103230","journal-title":"Artificial Intelligence"},{"issue":"2","key":"2023_CR22","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/s11704-019-8364-1","volume":"14","author":"C Chen","year":"2020","unstructured":"Chen C, Gao L, Xie X, Wang Z. Enjoy the most beautiful scene now: a memetic algorithm to solve two-fold time-dependent arc orienteering problem. Frontiers of Computer Science, 2020, 14(2): 364\u2013377","journal-title":"Frontiers of Computer Science"},{"key":"2023_CR23","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/j.ins.2021.04.090","volume":"570","author":"P He","year":"2021","unstructured":"He P, Hao J K, Wu Q. Grouping memetic search for the colored traveling salesmen problem. Information Sciences, 2021, 570: 689\u2013707","journal-title":"Information Sciences"},{"key":"2023_CR24","doi-asserted-by":"publisher","unstructured":"Wang Y, Li X, Wong K C, Chang Y, Yang S. Evolutionary multiobjective clustering algorithms with ensemble for patient stratification. IEEE Transactions on Cybernetics, 2021, doi: https:\/\/doi.org\/10.1109\/TCYB.2021.3069434","DOI":"10.1109\/TCYB.2021.3069434"},{"issue":"5","key":"2023_CR25","doi-asserted-by":"publisher","first-page":"155503","DOI":"10.1007\/s11704-020-9346-z","volume":"15","author":"L Liu","year":"2021","unstructured":"Liu L, Du Y. An improved multi-objective evolutionary algorithm for computation offloading in the multi-cloudlet environment. Frontiers of Computer Science, 2021, 15(5): 155503","journal-title":"Frontiers of Computer Science"},{"issue":"S1","key":"2023_CR26","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s00521-016-2324-6","volume":"28","author":"Y Wang","year":"2017","unstructured":"Wang Y, Li R, Zhou Y, Yin M. A path cost-based grasp for minimum independent dominating set problem. Neural Computing and Applications, 2017, 28(S1): 143\u2013151","journal-title":"Neural Computing and Applications"},{"issue":"8","key":"2023_CR27","doi-asserted-by":"publisher","first-page":"2519","DOI":"10.1007\/s00521-016-2813-7","volume":"30","author":"Y Wang","year":"2018","unstructured":"Wang Y, Chen J, Sun H, Yin M. A memetic algorithm for minimum independent dominating set problem. Neural Computing and Applications, 2018, 30(8): 2519\u20132529","journal-title":"Neural Computing and Applications"},{"key":"2023_CR28","unstructured":"Haraguchi K. An efficient local search for the minimum independent dominating set problem. In: Proceedings of the 17th International Symposium on Experimental Algorithms. 2018, 13"},{"key":"2023_CR29","doi-asserted-by":"publisher","first-page":"105949","DOI":"10.1016\/j.asoc.2019.105949","volume":"88","author":"Y Wang","year":"2020","unstructured":"Wang Y, Li C, Yin M. A two phase removing algorithm for minimum independent dominating set problem. Applied Soft Computing, 2020, 88: 105949","journal-title":"Applied Soft Computing"},{"key":"2023_CR30","doi-asserted-by":"crossref","unstructured":"Ding J, L\u00fc Z, Li C M, Shen L, Xu L, Glover F. A two-individual based evolutionary algorithm for the flexible job shop scheduling problem. In: Proceedings of the AAAI Conference on Artificial Intelligence. 2019, 280","DOI":"10.1609\/aaai.v33i01.33012262"},{"issue":"1","key":"2023_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10732-017-9354-9","volume":"24","author":"L Moalic","year":"2018","unstructured":"Moalic L, Gondran A. Variations on memetic algorithms for graph coloring problems. Journal of Heuristics, 2018, 24(1): 1\u201324","journal-title":"Journal of Heuristics"},{"key":"2023_CR32","doi-asserted-by":"publisher","first-page":"105774","DOI":"10.1016\/j.knosys.2020.105774","volume":"196","author":"B Peng","year":"2020","unstructured":"Peng B, Zhang Y, Cheng T C E, L\u00fc Z, Punnen A P. A two-individual based path-relinking algorithm for the satellite broadcast scheduling problem. Knowledge-Based Systems, 2020, 196: 105774","journal-title":"Knowledge-Based Systems"},{"key":"2023_CR33","doi-asserted-by":"publisher","unstructured":"Zheng P, Zhang P, Wang J, Zhang J, Yang C, Jin Y. A data-driven robust optimization method for the assembly job-shop scheduling problem under uncertainty. International Journal of Computer Integrated Manufacturing, 2020, doi: https:\/\/doi.org\/10.1080\/0951192X.2020.1803506","DOI":"10.1080\/0951192X.2020.1803506"},{"key":"2023_CR34","doi-asserted-by":"crossref","unstructured":"Sun Q, Dou J, Zhang C. Robust optimization of flow shop scheduling with uncertain processing time. In: Proceedings of 2020 IEEE International Conference on Mechatronics and Automation. 2020, 512\u2013517","DOI":"10.1109\/ICMA49215.2020.9233523"},{"key":"2023_CR35","doi-asserted-by":"publisher","first-page":"31932","DOI":"10.1109\/ACCESS.2021.3051741","volume":"9","author":"Y Wang","year":"2021","unstructured":"Wang Y, L\u00fc Z, Punnen A P. A fast and robust heuristic algorithm for the minimum weight vertex cover problem. IEEE Access, 2021, 9: 31932\u201331945","journal-title":"IEEE Access"},{"key":"2023_CR36","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.cor.2018.12.005","volume":"104","author":"Z Xu","year":"2019","unstructured":"Xu Z, He K, Li C M. An iterative path-breaking approach with mutation and restart strategies for the max-sat problem. Computers & Operations Research, 2019, 104: 49\u201358","journal-title":"Computers & Operations Research"},{"issue":"3","key":"2023_CR37","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F. Tabu search\u2014part I. ORSA Journal on Computing, 1989, 1(3): 190\u2013206","journal-title":"ORSA Journal on Computing"},{"issue":"2","key":"2023_CR38","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T A Feo","year":"1995","unstructured":"Feo T A, Resende M G C. Greedy randomized adaptive search procedures. Journal of Global Optimization, 1995, 6(2): 109\u2013133","journal-title":"Journal of Global Optimization"},{"key":"2023_CR39","volume-title":"Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, October 11\u201313, 1993","author":"M A Trick","year":"1996","unstructured":"Trick M A, Johnson D S. Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, October 11\u201313, 1993. Boston: American Mathematical Society, 1996"},{"key":"2023_CR40","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1016\/j.eswa.2016.07.047","volume":"64","author":"Y Zhou","year":"2016","unstructured":"Zhou Y, Hao J K, Duval B. Reinforcement learning based local search for grouping problems: A case study on graph coloring. Expert Systems with Applications, 2016, 64: 412\u2013422","journal-title":"Expert Systems with Applications"},{"issue":"2","key":"2023_CR41","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s10878-016-9990-2","volume":"32","author":"Y Wang","year":"2016","unstructured":"Wang Y, Hao J K, Glover F, L\u00fc Z, Wu Q. Solving the maximum vertex weight clique problem via binary quadratic programming. Journal of Combinatorial Optimization, 2016, 32(2): 531\u2013549","journal-title":"Journal of Combinatorial Optimization"},{"issue":"8\u20139","key":"2023_CR42","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.artint.2007.04.001","volume":"171","author":"K Xu","year":"2007","unstructured":"Xu K, Boussemart F, Hemery F, Lecoutre C. Random constraint satisfaction: easy generation of hard (satisfiable) instances. Artificial Intelligence, 2007, 171(8\u20139): 514\u2013534","journal-title":"Artificial Intelligence"},{"key":"2023_CR43","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1613\/jair.3907","volume":"46","author":"S Cai","year":"2013","unstructured":"Cai S, Su K, Luo C, Sattar A. NuMVC: an efficient local search algorithm for minimum vertex cover. Journal of Artificial Intelligence Research, 2013, 46: 687\u2013716","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"3","key":"2023_CR44","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1016\/j.ejor.2014.09.064","volume":"242","author":"Q Wu","year":"2015","unstructured":"Wu Q, Hao J K. A review on algorithms for maximum clique problems. European Journal of Operational Research, 2015, 242(3): 693\u2013709","journal-title":"European Journal of Operational Research"},{"key":"2023_CR45","doi-asserted-by":"crossref","unstructured":"Rossi R A, Ahmed N K. The network data repository with interactive graph analytics and visualization. In: Proceedings of the 49th AAAI Conference on Artificial Intelligence. 2015, 4292\u20134293","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"2023_CR46","unstructured":"Cai S. Balance between complexity and quality: local search for minimum vertex cover in massive graphs. In: Proceedings of the 24th International Conference on Artificial Intelligence. 2015, 747\u2013753"},{"key":"2023_CR47","doi-asserted-by":"crossref","unstructured":"Wang Y, Cai S, Yin M. Two efficient local search algorithms for maximum weight clique problem. In: Proceedings of the 30th AAAI Conference on Artificial Intelligence. 2016, 805\u2013811","DOI":"10.1609\/aaai.v30i1.10067"},{"key":"2023_CR48","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez M, Dubois-Lacoste J, C\u00e1ceres L P, Birattari M, St\u00fctzle T. The irace package: iterated racing for automatic algorithm configuration. Operations Research Perspectives, 2016, 3: 43\u201358","journal-title":"Operations Research Perspectives"},{"issue":"200","key":"2023_CR49","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1080\/01621459.1937.10503522","volume":"32","author":"M Friedman","year":"1937","unstructured":"Friedman M. The use of ranks to avoid the assumption of normality implicit in the analysis of variance. Journal of the American Statistical Association, 1937, 32(200): 675\u2013701","journal-title":"Journal of the American Statistical Association"},{"issue":"12","key":"2023_CR50","first-page":"2677","volume":"9","author":"S Garcia","year":"2008","unstructured":"Garcia S, Herrera F. An extension on \u201cstatistical comparisons of classifiers over multiple data sets\u201d for all pairwise comparisons. Journal of Machine Learning Research, 2008, 9(12): 2677\u20132694","journal-title":"Journal of Machine Learning Research"},{"key":"2023_CR51","doi-asserted-by":"crossref","unstructured":"Luo C, Cai S, Wu W, Su K. Double configuration checking in stochastic local search for satisfiability. In: Proceedings of the 28th AAAI Conference on Artificial Intelligence. 2014, 2703\u20132709","DOI":"10.1609\/aaai.v28i1.9110"},{"issue":"7","key":"2023_CR52","doi-asserted-by":"publisher","first-page":"1830","DOI":"10.1109\/TC.2014.2346196","volume":"64","author":"C Luo","year":"2015","unstructured":"Luo C, Cai S, Wu W, Jie Z, Su K. CCLS: an efficient local search algorithm for weighted maximum satisfiability. IEEE Transactions on Computers, 2015, 64(7): 1830\u20131843","journal-title":"IEEE Transactions on Computers"},{"key":"2023_CR53","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.artint.2016.11.001","volume":"243","author":"C Luo","year":"2017","unstructured":"Luo C, Cai S, Su K, Huang W. CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability. Artificial Intelligence, 2017, 243: 26\u201344","journal-title":"Artificial Intelligence"},{"issue":"1","key":"2023_CR54","doi-asserted-by":"publisher","first-page":"161103","DOI":"10.1007\/s11704-021-0395-8","volume":"16","author":"X Liu","year":"2022","unstructured":"Liu X, Liang J, Liu D Y, Chen R, Yuan S M. Weapon-target assignment in unreliable peer-to-peer architecture based on adapted artificial bee colony algorithm. Frontiers of Computer Science, 2022, 16(1): 161103","journal-title":"Frontiers of Computer Science"},{"issue":"4","key":"2023_CR55","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1109\/TEVC.2017.2749263","volume":"22","author":"C Qian","year":"2018","unstructured":"Qian C, Shi J C, Tang K, Zhou Z H. Constrained monotone k-submodular function maximization using multiobjective evolutionary algorithms with theoretical guarantee. IEEE Transactions on Evolutionary Computation, 2018, 22(4): 595\u2013608","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"2023_CR56","doi-asserted-by":"crossref","unstructured":"Luo C, Hoos H H, Cai S, Lin Q, Zhang H, Zhang D. Local search with efficient automatic configuration for minimum vertex cover. In: Proceedings of the 28th International Joint Conference on Artificial Intelligence. 2019, 1297\u20131304","DOI":"10.24963\/ijcai.2019\/180"},{"key":"2023_CR57","doi-asserted-by":"crossref","unstructured":"Lei Z, Cai S, Luo C, Hoos H. Efficient local search for pseudo Boolean optimization. In: Proceedings of the 24th International Conference on Theory and Applications of Satisfiability Testing. 2021, 332\u2013348","DOI":"10.1007\/978-3-030-80223-3_23"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-022-2023-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-022-2023-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-022-2023-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T20:26:17Z","timestamp":1726691177000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-022-2023-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,12]]},"references-count":57,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["2023"],"URL":"https:\/\/doi.org\/10.1007\/s11704-022-2023-7","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,12]]},"assertion":[{"value":"13 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"174326"}}