{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:48:47Z","timestamp":1742975327788,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030787424"},{"type":"electronic","value":"9783030787431"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-78743-1_36","type":"book-chapter","created":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T23:07:50Z","timestamp":1625612870000},"page":"399-411","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Biased Random-Key Genetic Algorithm for Structure Learning"],"prefix":"10.1007","author":[{"given":"Baodan","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yun","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,7]]},"reference":[{"key":"36_CR1","first-page":"2273","volume":"16","author":"B Aragam","year":"2015","unstructured":"Aragam, B., Qing, Z.: Concave penalized estimation of sparse Gaussian Bayesian networks. J. Mach. Learn. Res. 16, 2273\u20132328 (2015)","journal-title":"J. Mach. Learn. Res."},{"key":"36_CR2","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 6, 154\u2013160 (1994)","journal-title":"ORSA J. Comput."},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"de Campos, C.P., Zeng, Z., Ji, Q.: Structure learning of Bayesian networks using constraints. In: Proceedings of the 26th Annual International Conference on Machine Learning, ICML 2009, pp. 113\u2013120. Association for Computing Machinery (2009)","DOI":"10.1145\/1553374.1553389"},{"issue":"5","key":"36_CR4","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1177\/0165551519857590","volume":"46","author":"X Chen","year":"2020","unstructured":"Chen, X., Yuan, Y., Orgun, M.A.: Using Bayesian networks with hidden variables for identifying trustworthy users in social networks. J. Inf. Sci. 46(5), 600\u2013615 (2020)","journal-title":"J. Inf. Sci."},{"issue":"4","key":"36_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3385655","volume":"14","author":"AC Constantinou","year":"2020","unstructured":"Constantinou, A.C.: Learning Bayesian networks with the Saiyan algorithm. ACM Trans. Knowl. Discov. Data 14(4), 1\u201321 (2020)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"issue":"1","key":"36_CR6","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10462-018-9615-5","volume":"52","author":"C Contaldi","year":"2018","unstructured":"Contaldi, C., Vafaee, F., Nelson, P.C.: Bayesian network hybrid learning using an elite-guided genetic algorithm. Artif. Intell. Rev. 52(1), 245\u2013272 (2018). https:\/\/doi.org\/10.1007\/s10462-018-9615-5","journal-title":"Artif. Intell. Rev."},{"key":"36_CR7","unstructured":"Correia, A.H.C., Cussens, J.: On pruning for score-based Bayesian network structure learning. In: Proceedings of the Twenty Third International Conference on Artificial Intelligence and Statistics (AISTATS 2020), vol. 108, pp. 2709\u20132718 (2020)"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Costa, P.C., Yu, B., Atiahetchi, M., Myers, D.: High-level information fusion of cyber-security expert knowledge and experimental data. In: 2018 21st International Conference on Information Fusion, pp. 2322\u20132329 (2018)","DOI":"10.23919\/ICIF.2018.8455638"},{"issue":"1999","key":"36_CR9","first-page":"1287","volume":"5","author":"DM Chickering","year":"2004","unstructured":"Chickering, D.M., Heckerman, D., Meek, C.: Large-sample learning of Bayesian networks is NP-hard. J. Mach. Learn. Res. 5(1999), 1287\u20131330 (2004)","journal-title":"J. Mach. Learn. Res."},{"issue":"5","key":"36_CR10","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10732-010-9143-1","volume":"17","author":"J Fernando","year":"2011","unstructured":"Fernando, J., Mauricio, G.: Biased random-key genetic algorithms for combinatorial optimization. J. Heuristics 17(5), 487\u2013525 (2011)","journal-title":"J. Heuristics"},{"key":"36_CR11","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/j.ins.2016.01.090","volume":"348","author":"S Gheisari","year":"2016","unstructured":"Gheisari, S., Meybodi, M.R.: BNC-PSO: structure learning of Bayesian networks by Particle Swarm Optimization. Inf. Sci. 348, 272\u2013289 (2016)","journal-title":"Inf. Sci."},{"key":"36_CR12","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1023\/A:1020377910258","volume":"8","author":"J Gon\u00e7alves","year":"2002","unstructured":"Gon\u00e7alves, J., Almeida, J.: A hybrid genetic algorithm for assembly line balancing. J. Heuristics 8, 629\u2013642 (2002)","journal-title":"J. Heuristics"},{"issue":"1","key":"36_CR13","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s11222-018-9801-y","volume":"29","author":"J Gu","year":"2018","unstructured":"Gu, J., Fu, F., Zhou, Q.: Penalized estimation of directed acyclic graphs from discrete data. Stat. Comput. 29(1), 161\u2013176 (2018). https:\/\/doi.org\/10.1007\/s11222-018-9801-y","journal-title":"Stat. Comput."},{"key":"36_CR14","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.psep.2018.06.029","volume":"118","author":"R He","year":"2018","unstructured":"He, R., Li, X., Chen, G., Wang, Y., Jiang, S., Zhi, C.: A quantitative risk analysis model considering uncertain information. Process Saf. Environ. Prot. 118, 361\u2013370 (2018)","journal-title":"Process Saf. Environ. Prot."},{"key":"36_CR15","first-page":"358","volume":"9","author":"T Jaakkola","year":"2010","unstructured":"Jaakkola, T., Sontag, D., Globerson, A., Meila, M.: Learning Bayesian network structure using LP relaxations. J. Mach. Learn. Res. Proc. Track 9, 358\u2013365 (2010)","journal-title":"J. Mach. Learn. Res. Proc. Track"},{"issue":"6","key":"36_CR16","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1109\/TKDE.2019.2899096","volume":"32","author":"S Lee","year":"2020","unstructured":"Lee, S., Kim, S.: Parallel simulated annealing with a greedy algorithm for Bayesian network structure learning. IEEE Trans. Knowl. Data Eng. 32(6), 1157\u20131166 (2020)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"36_CR17","unstructured":"Schmidt, M., Niculescu-Mizil, A., Murphy, K.: Learning graphical model structure using L1-regularization paths. In: Proceedings of the National Conference on Artificial Intelligence, vol. 2, pp. 1278\u20131283 (2007)"},{"key":"36_CR18","unstructured":"Silander, T., Myllym\u00e4ki, P.: A simple approach for finding the globally optimal Bayesian network structure. In: Proceedings of the 22nd Conference on Uncertainty in Artificial Intelligence, UAI 2006, pp. 445\u2013452 (2006)"},{"key":"36_CR19","unstructured":"Spears, W.M., DeJong, K.A.: On the virtues of parameterised uniform crossover. In: International Conference on Genetic Algorithms, pp. 230\u2013236 (1991)"},{"key":"36_CR20","unstructured":"Wei, D., Gao, T., Yu, Y.: DAGs with no fears: a closer look at continuous optimization for learning Bayesian networks (2020)"},{"key":"36_CR21","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2020.2990820","author":"Q Ye","year":"2020","unstructured":"Ye, Q., Amini, A., Zhou, Q.: Optimizing regularized Cholesky score for order-based learning of Bayesian networks. IEEE Trans. Pattern Anal. Mach. Intell. (2020). https:\/\/doi.org\/10.1109\/TPAMI.2020.2990820","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"36_CR22","unstructured":"Zheng, X., Aragam, B., Ravikumar, P., Xing, E.P.: DAGs with no tears: continuous optimization for structure learning. In: Advances in Neural Information Processing Systems, vol. 2018-Decem, pp. 9472\u20139483 (2018)"}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-78743-1_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T23:19:39Z","timestamp":1625613579000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-78743-1_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030787424","9783030787431"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-78743-1_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"7 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Swarm Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Qingdao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"swarm2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iasei.org\/icsi2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"177","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"104","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4-5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}