{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:11:08Z","timestamp":1767337868770,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031445040"},{"type":"electronic","value":"9783031445057"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-44505-7_22","type":"book-chapter","created":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T18:03:41Z","timestamp":1698170621000},"page":"318-331","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Bayesian Decision Trees Inspired from\u00a0Evolutionary Algorithms"],"prefix":"10.1007","author":[{"given":"Efthyvoulos","family":"Drousiotis","sequence":"first","affiliation":[]},{"given":"Alexander M.","family":"Phillips","sequence":"additional","affiliation":[]},{"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[]},{"given":"Simon","family":"Maskell","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,25]]},"reference":[{"key":"22_CR1","unstructured":"Basse, G., Smith, A., Pillai, N.: Parallel Markov chain Monte Carlo via spectral clustering. In: Gretton, A., Robert, C.C. (eds.) Proceedings of the 19th International Conference on Artificial Intelligence and Statistics. Proceedings of Machine Learning Research, Cadiz, Spain, 09\u201311 May 2016, vol. 51, pp. 1318\u20131327. PMLR (2016)"},{"issue":"2","key":"22_CR2","first-page":"137","volume":"2","author":"S Binitha","year":"2012","unstructured":"Binitha, S., Sathya, S.S., et al.: A survey of bio inspired optimization algorithms. Int. J. Soft Comput. Eng. 2(2), 137\u2013151 (2012)","journal-title":"Int. J. Soft Comput. Eng."},{"issue":"4","key":"22_CR3","doi-asserted-by":"publisher","first-page":"A1556","DOI":"10.1137\/130932740","volume":"36","author":"S Blanes","year":"2014","unstructured":"Blanes, S., Casas, F., Sanz-Serna, J.M.: Numerical integrators for the hybrid Monte Carlo method. SIAM J. Sci. Comput. 36(4), A1556\u2013A1580 (2014)","journal-title":"SIAM J. Sci. Comput."},{"issue":"443","key":"22_CR4","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1080\/01621459.1998.10473750","volume":"93","author":"HA Chipman","year":"1998","unstructured":"Chipman, H.A., George, E.I., McCulloch, R.E.: Bayesian cart model search. J. Am. Stat. Assoc. 93(443), 935\u2013948 (1998)","journal-title":"J. Am. Stat. Assoc."},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Chipman, H.A., George, E.I., McCulloch, R.E.: BART: Bayesian additive regression trees. Ann. Appl. Stat. (2010)","DOI":"10.1214\/09-AOAS285"},{"issue":"3","key":"22_CR6","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1111\/j.1467-9868.2006.00553.x","volume":"68","author":"P Del Moral","year":"2006","unstructured":"Del Moral, P., Doucet, A., Jasra, A.: Sequential Monte Carlo samplers. J. Roy. Stat. Soc.: Ser. B (Stat. Methodol.) 68(3), 411\u2013436 (2006)","journal-title":"J. Roy. Stat. Soc.: Ser. B (Stat. Methodol.)"},{"key":"22_CR7","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-319-91086-4_10","volume-title":"Handbook of Metaheuristics","author":"M Dorigo","year":"2019","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant colony optimization: overview and recent advances. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 272, pp. 311\u2013351. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-91086-4_10"},{"issue":"1","key":"22_CR8","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1214\/009053606000001154","volume":"35","author":"R Douc","year":"2007","unstructured":"Douc, R., Guillin, A., Marin, J.-M., Robert, C.P.: Convergence of adaptive mixtures of importance sampling schemes. Ann. Stat. 35(1), 420\u2013448 (2007)","journal-title":"Ann. Stat."},{"key":"22_CR9","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/978-3-031-34111-3_40","volume-title":"Artificial Intelligence Applications and Innovations","author":"E Drousiotis","year":"2023","unstructured":"Drousiotis, E., et al.: Probabilistic decision trees for predicting 12-month university students likely to experience suicidal ideation. In: Maglogiannis, I., Iliadis, L., MacIntyre, J., Dominguez, M. (eds.) AIAI 2023. IFIP Advances in Information and Communication Technology, vol. 675, pp. 475\u2013487. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-34111-3_40"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-030-78270-2_25","volume-title":"Artificial Intelligence in Education","author":"E Drousiotis","year":"2021","unstructured":"Drousiotis, E., Pentaliotis, P., Shi, L., Cristea, A.I.: Capturing fairness and uncertainty in student dropout prediction \u2013 a comparison study. In: Roll, I., McNamara, D., Sosnovsky, S., Luckin, R., Dimitrova, V. (eds.) AIED 2021, Part II. LNCS (LNAI), vol. 12749, pp. 139\u2013144. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-78270-2_25"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-030-80421-3_19","volume-title":"Intelligent Tutoring Systems","author":"E Drousiotis","year":"2021","unstructured":"Drousiotis, E., Shi, L., Maskell, S.: Early predictor for student success based on behavioural and demographical indicators. In: Cristea, A.I., Troussas, C. (eds.) ITS 2021. LNCS, vol. 12677, pp. 161\u2013172. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-80421-3_19"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-031-24866-5_15","volume-title":"Learning and Intelligent Optimization","author":"E Drousiotis","year":"2023","unstructured":"Drousiotis, E., Spirakis, P.G.: Single MCMC chain parallelisation on decision trees. In: Simos, D.E., Rasskazova, V.A., Archetti, F., Kotsireas, I.S., Pardalos, P.M. (eds.) LION 2022. LNCS, vol. 13621, pp. 191\u2013204. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-24866-5_15"},{"key":"22_CR13","unstructured":"Drousiotis, E., Spirakis, P.G., Maskell, S.: Parallel approaches to accelerate Bayesian decision trees. arXiv preprint arXiv:2301.09090 (2023)"},{"issue":"2","key":"22_CR14","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/0370-2693(87)91197-X","volume":"195","author":"S Duane","year":"1987","unstructured":"Duane, S., Kennedy, A.D., Pendleton, B.J., Roweth, D.: Hybrid Monte Carlo. Phys. Lett. B 195(2), 216\u2013222 (1987)","journal-title":"Phys. Lett. B"},{"key":"22_CR15","doi-asserted-by":"publisher","first-page":"13247","DOI":"10.5194\/acp-21-13247-2021","volume":"21","author":"JD Le Brazidec","year":"2021","unstructured":"Le Brazidec, J.D., Bocquet, M., Saunier, O., Roustan, Y.: Quantification of uncertainties in the assessment of an atmospheric release source applied to the autumn 2017. Atmos. Chem. Phys. 21, 13247\u201313267 (2021)","journal-title":"Atmos. Chem. Phys."},{"issue":"4","key":"22_CR16","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s00158-008-0240-9","volume":"37","author":"V Kalivarapu","year":"2009","unstructured":"Kalivarapu, V., Foo, J.-L., Winer, E.: Improving solution characteristics of particle swarm optimization using digital pheromones. Struct. Multidiscip. Optim. 37(4), 415\u2013427 (2009)","journal-title":"Struct. Multidiscip. Optim."},{"issue":"449","key":"22_CR17","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1080\/01621459.2000.10473908","volume":"95","author":"JS Liu","year":"2000","unstructured":"Liu, J.S., Liang, F., Wong, W.H.: The multiple-try method and local optimization in metropolis sampling. J. Ame. Stat. Assoc. 95(449), 121\u2013134 (2000)","journal-title":"J. Ame. Stat. Assoc."},{"issue":"6","key":"22_CR18","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1209\/0295-5075\/19\/6\/002","volume":"19","author":"E Marinari","year":"1992","unstructured":"Marinari, E., Parisi, G.: Simulated tempering: a new Monte Carlo scheme. EPL (Europhys. Lett. ) 19(6), 451 (1992)","journal-title":"EPL (Europhys. Lett. )"},{"issue":"429","key":"22_CR19","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1080\/01621459.1995.10476507","volume":"90","author":"P Mykland","year":"1995","unstructured":"Mykland, P., Tierney, L., Bin, Yu.: Regeneration in Markov chain samplers. J. Am. Stat. Assoc. 90(429), 233\u2013241 (1995)","journal-title":"J. Am. Stat. Assoc."},{"issue":"5","key":"22_CR20","doi-asserted-by":"publisher","first-page":"e1435","DOI":"10.1002\/wics.1435","volume":"10","author":"CP Robert","year":"2018","unstructured":"Robert, C.P., Elvira, V., Tawn, N., Wu, C.: Accelerating MCMC algorithms. Wiley Interdisc. Rev.: Comput. Stat. 10(5), e1435 (2018)","journal-title":"Wiley Interdisc. Rev.: Comput. Stat."},{"key":"22_CR21","unstructured":"Ro\u010dkov\u00e1, V., Saha, E.: On theory for BART. In: The 22nd International Conference on Artificial Intelligence and Statistics. PMLR (2019)"},{"key":"22_CR22","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.engappai.2016.08.013","volume":"56","author":"UP Shukla","year":"2016","unstructured":"Shukla, U.P., Nanda, S.J.: Parallel social spider clustering algorithm for high dimensional datasets. Eng. Appl. Artif. Intell. 56, 75\u201390 (2016)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"493","key":"22_CR23","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1198\/jasa.2011.ap09769","volume":"106","author":"MA Taddy","year":"2011","unstructured":"Taddy, M.A., Gramacy, R.B., Polson, N.G.: Dynamic trees for learning and design. J. Am. Stat. Assoc. 106(493), 109\u2013123 (2011)","journal-title":"J. Am. Stat. Assoc."},{"key":"22_CR24","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.fsigen.2014.08.014","volume":"13","author":"D Taylor","year":"2014","unstructured":"Taylor, D., Bright, J.-A., Buckleton, J.: Interpreting forensic DNA profiling evidence without specifying the number of contributors. Forensic Sci. Int. Genet. 13, 269\u2013280 (2014)","journal-title":"Forensic Sci. Int. Genet."},{"issue":"12","key":"22_CR25","doi-asserted-by":"publisher","first-page":"342","DOI":"10.3390\/a14120342","volume":"14","author":"A Varsi","year":"2021","unstructured":"Varsi, A., Maskell, S., Spirakis, P.G.: An o (logn) fully-balanced resampling algorithm for particle filters on distributed memory architectures. Algorithms 14(12), 342 (2021)","journal-title":"Algorithms"},{"key":"22_CR26","doi-asserted-by":"publisher","first-page":"1570","DOI":"10.1109\/LSP.2020.3014035","volume":"27","author":"A Varsi","year":"2020","unstructured":"Varsi, A., Taylor, J., Kekempanos, L., Knapp, E.P., Maskell, S.: A fast parallel particle filter for shared memory systems. IEEE Signal Process. Lett. 27, 1570\u20131574 (2020)","journal-title":"IEEE Signal Process. Lett."},{"issue":"1","key":"22_CR27","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1198\/106186007X180426","volume":"16","author":"W Yuhong","year":"2007","unstructured":"Yuhong, W., Tjelmeland, H., West, M.: Bayesian cart: prior specification and posterior simulation. J. Comput. Graph. Stat. 16(1), 44\u201366 (2007)","journal-title":"J. Comput. Graph. Stat."}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-44505-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T18:05:56Z","timestamp":1698170756000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-44505-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031445040","9783031445057"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-44505-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"25 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nice","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lion17.org\/","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":"83","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":"40","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":"48% - 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":"4.7","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.4","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}