{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T07:02:34Z","timestamp":1780729354861,"version":"3.54.1"},"publisher-location":"Singapore","reference-count":17,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819214617","type":"print"},{"value":"9789819214624","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-981-92-1462-4_18","type":"book-chapter","created":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T06:46:28Z","timestamp":1780728388000},"page":"223-236","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Robust Volume Ratio: A Metric for\u00a0Fine-Grained Evaluation of\u00a0Tree Ensemble Robustness"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-1860-0173","authenticated-orcid":false,"given":"Saori","family":"Matsunaga","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-8327-9580","authenticated-orcid":false,"given":"Genta","family":"Yoshimura","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,7]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","unstructured":"Breiman, L.: Random forests. Mach. Learn. 45, 5\u201332 (2001). https:\/\/doi.org\/10.1023\/A:1010950718922","DOI":"10.1023\/A:1010950718922"},{"key":"18_CR2","unstructured":"Chen, H., Zhang, H., Si, S., Li, Y., Boning, D., Hsieh, C.J.: Robustness verification of tree-based models. In: Advances in Neural Information Processing Systems, vol. 32 (2019)"},{"key":"18_CR3","doi-asserted-by":"publisher","unstructured":"Chen, T., Guestrin, C.: XGBoost: a scalable tree boosting system. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 785\u2013794. KDD 2016, ACM (2016). https:\/\/doi.org\/10.1145\/2939672.2939785","DOI":"10.1145\/2939672.2939785"},{"key":"18_CR4","unstructured":"Devos, L., Meert, W., Davis, J.: Versatile verification of tree ensembles. In: Meila, M., Zhang, T. (eds.) Proceedings of the 38th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol.\u00a0139, pp. 2654\u20132664. PMLR (18\u201324 Jul 2021) (2021). https:\/\/proceedings.mlr.press\/v139\/devos21a.html"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Einziger, G., Goldstein, M., Sa\u2019ar, Y., Segall, I.: Verifying robustness of gradient boosted models. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a033, pp. 2446\u20132453 (2019)","DOI":"10.1609\/aaai.v33i01.33012446"},{"key":"18_CR6","unstructured":"Kantchelian, A., Tygar, J.D., Joseph, A.: Evasion and hardening of tree ensemble classifiers. In: International Conference on Machine Learning, pp. 2387\u20132396. PMLR (2016)"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-319-63387-9_5","volume-title":"Computer Aided Verification","author":"G Katz","year":"2017","unstructured":"Katz, G., Barrett, C., Dill, D.L., Julian, K., Kochenderfer, M.J.: Reluplex: an efficient SMT solver for verifying deep neural networks. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10426, pp. 97\u2013117. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63387-9_5"},{"key":"18_CR8","first-page":"3146","volume":"30","author":"G Ke","year":"2017","unstructured":"Ke, G., et al.: LightGBM: a highly efficient gradient boosting decision tree. Adv. Neural. Inf. Process. Syst. 30, 3146\u20133154 (2017)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Matsunaga, S., Yoshimura, G.: Efficient and high-quality formal verification for decision tree ensembles. In: 2024 IEEE International Conference on Data Mining Workshops (ICDMW), pp. 51\u201358. IEEE (2024)","DOI":"10.1109\/ICDMW65004.2024.00013"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Mothilal, R.K., Sharma, A., Tan, C.: Explaining machine learning classifiers through diverse counterfactual explanations. In: Proceedings of the 2020 Conference on Fairness, Accountability, and Transparency, pp. 607\u2013617 (2020)","DOI":"10.1145\/3351095.3372850"},{"key":"18_CR11","unstructured":"Olivier, R., Raj, B.: How many perturbations break this model? Evaluating robustness beyond adversarial accuracy. In: International Conference on Machine Learning, pp. 26583\u201326598. PMLR (2023)"},{"key":"18_CR12","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"18_CR13","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1587\/transinf.2019EDP7120","volume":"103","author":"N Sato","year":"2020","unstructured":"Sato, N., Kuruma, H., Nakagawa, Y., Ogawa, H.: Formal verification of a decision-tree ensemble model and detection of its violation ranges. IEICE Trans. Inf. Syst. 103(2), 363\u2013378 (2020)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"18_CR14","unstructured":"Tjeng, V., Xiao, K., Tedrake, R.: Evaluating robustness of neural networks with mixed integer programming (2017). arXiv:1711.07356 arXiv preprint"},{"key":"18_CR15","doi-asserted-by":"publisher","unstructured":"T\u00f6rnblom, J., Nadjm-Tehrani, S.: An abstraction-refinement approach to formal verification of tree ensembles. In: Computer Safety, Reliability, and Security, pp. 301\u2013313. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-26250-1_24","DOI":"10.1007\/978-3-030-26250-1_24"},{"key":"18_CR16","first-page":"841","volume":"31","author":"S Wachter","year":"2017","unstructured":"Wachter, S., Mittelstadt, B., Russell, C.: Counterfactual explanations without opening the black box: automated decisions and the GDPR. Harv. JL & Tech. 31, 841 (2017)","journal-title":"Harv. JL & Tech."},{"key":"18_CR17","first-page":"29909","volume":"34","author":"S Wang","year":"2021","unstructured":"Wang, S., et al.: Beta-crown: efficient bound propagation with per-neuron split constraints for neural network robustness verification. Adv. Neural. Inf. Process. Syst. 34, 29909\u201329921 (2021)","journal-title":"Adv. Neural. Inf. Process. Syst."}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-92-1462-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T06:46:31Z","timestamp":1780728391000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-92-1462-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819214617","9789819214624"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-981-92-1462-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"7 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.pakdd2026.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}