{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T18:27:00Z","timestamp":1780511220126,"version":"3.54.1"},"reference-count":73,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T00:00:00Z","timestamp":1739145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2025,2,10]]},"abstract":"<jats:p>Gaussian Process (GP)-based Bayesian optimization (BO), i.e., GP-BO, emerges as a prevailing model-based framework for DBMS (Database Management System) auto-tuning. However, recent work shows GP-BO-based DBMS auto-tuners are significantly outperformed by auto-tuners based on SMAC, which features random forest surrogate models; such results motivate us to rethink and investigate the limitations of GP-BO in auto-tuner design. We find that the fundamental assumptions of GP-BO are widely violated when modeling and optimizing DBMS performance, while tree-ensemble-BOs (e.g., SMAC) can avoid the assumption pitfalls and deliver improved tuning efficiency and effectiveness. Moreover, we argue that existing tree-ensemble-BOs restrict further advancement in DBMS auto-tuning. First, existing tree-ensemble-BOs can only achieve distribution-free point estimates, but still impose unrealistic distributional assumptions on uncertainty (interval) estimates, which can compromise surrogate modeling and distort the acquisition function. Second, recent advances in (ensemble) gradient boosting, which can further enhance surrogate modeling against vanilla GP and random forest counterparts, have rarely been applied in optimizing DBMS auto-tuners.<\/jats:p>\n                  <jats:p>\n                    To address these issues, we propose a novel model-based DBMS auto-tuner,\n                    <jats:bold>Centrum<\/jats:bold>\n                    . Centrum achieves and improves distribution-free point and interval estimation in surrogate modeling with a two-phase learning procedure of stochastic gradient boosting ensembles (SGBE). Moreover, Centrum adopts a generalized SGBE-estimated locally-adaptive conformal prediction to facilitate a distribution-free interval (uncertainty) estimation and acquisition function. To our knowledge, Centrum is the first auto-tuner that realizes distribution-freeness to stress and enhance BO's practicality in DBMS auto-tuning, and the first to seamlessly fuse gradient boosting ensembles and conformal inference in BO. Extensive physical and simulation experiments on two DBMSs and three workloads show that Centrum outperforms 21 state-of-the-art (SOTA) DBMS auto-tuners based on BO with GP, random forest, gradient boosting, OOB (Out-Of-Bag) conformal ensemble and other surrogates, as well as that based on reinforcement learning and genetic algorithms.\n                  <\/jats:p>","DOI":"10.1145\/3709671","type":"journal-article","created":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T15:45:06Z","timestamp":1739288706000},"page":"1-26","source":"Crossref","is-referenced-by-count":1,"title":["Centrum: Model-based Database Auto-tuning with Minimal Distributional Assumptions"],"prefix":"10.1145","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9154-5668","authenticated-orcid":false,"given":"Yuanhao","family":"Lai","sequence":"first","affiliation":[{"name":"Huawei, Shenzhen, Guangdong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-8498-2749","authenticated-orcid":false,"given":"Pengfei","family":"Zheng","sequence":"additional","affiliation":[{"name":"Huawei, Shenzhen, Guangdong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-1343-2097","authenticated-orcid":false,"given":"Chenpeng","family":"Ji","sequence":"additional","affiliation":[{"name":"Huawei, Shenzhen, Guangdong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-8154-0453","authenticated-orcid":false,"given":"Yan","family":"Li","sequence":"additional","affiliation":[{"name":"Huawei, Shenzhen, Guangdong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-0289-0338","authenticated-orcid":false,"given":"Songhan","family":"Zhang","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong-Shenzhen, Shenzhen, Guangdong, China, &amp; Huawei, Shenzhen, Guangdong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-8045-292X","authenticated-orcid":false,"given":"Rutao","family":"Zhang","sequence":"additional","affiliation":[{"name":"Huawei, Shenzhen, Guangdong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-8049-1552","authenticated-orcid":false,"given":"Zhengang","family":"Wang","sequence":"additional","affiliation":[{"name":"Huawei, Shenzhen, Guangdong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6541-2511","authenticated-orcid":false,"given":"Yunfei","family":"Du","sequence":"additional","affiliation":[{"name":"Huawei, Shenzhen, Guangdong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,2,11]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-021-01762-8"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.52202\/075280-0904"},{"key":"e_1_2_1_3_1","volume-title":"A gentle introduction to conformal prediction and distribution-free uncertainty quantification. arXiv preprint arXiv:2107.07511","author":"Angelopoulos Anastasios N","year":"2021","unstructured":"Anastasios N Angelopoulos and Stephen Bates. 2021. A gentle introduction to conformal prediction and distribution-free uncertainty quantification. arXiv preprint arXiv:2107.07511 (2021)."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3229161"},{"key":"e_1_2_1_5_1","volume-title":"Bagging predictors. Machine learning 24","author":"Breiman Leo","year":"1996","unstructured":"Leo Breiman. 1996. Bagging predictors. Machine learning 24 (1996), 123--140."},{"key":"e_1_2_1_6_1","volume-title":"Random forests. Machine learning 45","author":"Breiman Leo","year":"2001","unstructured":"Leo Breiman. 2001. Random forests. Machine learning 45 (2001), 5--32."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/3457390.3457404"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939785"},{"key":"e_1_2_1_9_1","unstructured":"Nicolo Colombo. 2023. On training locally adaptive CP. In Conformal and Probabilistic Prediction with Applications. PMLR 384--398."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.13643"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3399579.3399927"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1002\/0470016450"},{"key":"e_1_2_1_13_1","volume-title":"International Conference on Machine Learning. PMLR, 2632--2643","author":"Deshwal Aryan","year":"2021","unstructured":"Aryan Deshwal, Syrine Belakaria, and Janardhan Rao Doppa. 2021. Bayesian optimization over hybrid spaces. In International Conference on Machine Learning. PMLR, 2632--2643."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687767"},{"key":"e_1_2_1_15_1","volume-title":"International conference on machine learning. PMLR, 2690--2700","author":"Duan Tony","year":"2020","unstructured":"Tony Duan, Avati Anand, Daisy Yi Ding, Khanh K Thai, Sanjay Basu, Andrew Ng, and Alejandro Schuler. 2020. Ngboost: Natural gradient boosting for probabilistic prediction. In International conference on machine learning. PMLR, 2690--2700."},{"key":"e_1_2_1_16_1","volume-title":"Scalable global optimization via local Bayesian optimization. Advances in neural information processing systems 32","author":"Eriksson David","year":"2019","unstructured":"David Eriksson, Michael Pearce, Jacob Gardner, Ryan D Turner, and Matthias Poloczek. 2019. Scalable global optimization via local Bayesian optimization. Advances in neural information processing systems 32 (2019)."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403299"},{"key":"e_1_2_1_18_1","volume-title":"A tutorial on Bayesian optimization. arXiv preprint arXiv:1807.02811","author":"Frazier Peter I","year":"2018","unstructured":"Peter I Frazier. 2018. A tutorial on Bayesian optimization. arXiv preprint arXiv:1807.02811 (2018)."},{"key":"e_1_2_1_19_1","volume-title":"Greedy function approximation: a gradient boosting machine. Annals of statistics","author":"Friedman Jerome H","year":"2001","unstructured":"Jerome H Friedman. 2001. Greedy function approximation: a gradient boosting machine. Annals of statistics (2001), 1189--1232."},{"key":"e_1_2_1_20_1","volume-title":"Stochastic gradient boosting. Computational statistics & data analysis 38, 4","author":"Friedman Jerome H","year":"2002","unstructured":"Jerome H Friedman. 2002. Stochastic gradient boosting. Computational statistics & data analysis 38, 4 (2002), 367--378."},{"key":"e_1_2_1_21_1","unstructured":"Yarin Gal et al. 2016. Uncertainty in deep learning. (2016)."},{"key":"e_1_2_1_22_1","first-page":"18932","article-title":"Revisiting deep learning models for tabular data","volume":"34","author":"Gorishniy Yury","year":"2021","unstructured":"Yury Gorishniy, Ivan Rubachev, Valentin Khrulkov, and Artem Babenko. 2021. Revisiting deep learning models for tabular data. Advances in Neural Information Processing Systems 34 (2021), 18932--18943.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_1_23_1","volume-title":"Why do tree-based models still outperform deep learning on typical tabular data? Advances in neural information processing systems 35","author":"Grinsztajn L\u00e9o","year":"2022","unstructured":"L\u00e9o Grinsztajn, Edouard Oyallon, and Ga\u00ebl Varoquaux. 2022. Why do tree-based models still outperform deep learning on typical tabular data? Advances in neural information processing systems 35 (2022), 507--520."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2021.108496"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","unstructured":"Tim Head Manoj Kumar Holger Nahrstaedt Gilles Louppe and Iarosla Shcherbatyi. 2021. scikit-optimize\/scikit-optimize. https:\/\/doi.org\/10.5281\/zenodo.5565057","DOI":"10.5281\/zenodo.5565057"},{"key":"e_1_2_1_26_1","first-page":"2011","article-title":"Sequential model-based optimization for general algorithm configuration. In Learning and Intelligent Optimization: 5th International Conference","volume":"21","author":"Hutter Frank","year":"2011","unstructured":"Frank Hutter, Holger H Hoos, and Kevin Leyton-Brown. 2011. Sequential model-based optimization for general algorithm configuration. In Learning and Intelligent Optimization: 5th International Conference, LION 5, Rome, Italy, January 17--21, 2011. Selected Papers 5. Springer, 507--523.","journal-title":"LION 5, Rome, Italy"},{"key":"e_1_2_1_27_1","first-page":"1","article-title":"OpenBox: A Python Toolkit for Generalized Black-box Optimization","volume":"25","author":"Jiang Huaijun","year":"2024","unstructured":"Huaijun Jiang, Yu Shen, Yang Li, Beicheng Xu, Sixian Du, Wentao Zhang, Ce Zhang, and Bin Cui. 2024. OpenBox: A Python Toolkit for Generalized Black-box Optimization. Journal of Machine Learning Research 25, 120 (2024), 1--11. http:\/\/jmlr.org\/papers\/v25\/23-0537.html","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_2_1_28_1","volume-title":"Regression conformal prediction with random forests. Machine learning 97","author":"Johansson Ulf","year":"2014","unstructured":"Ulf Johansson, Henrik Bostr\u00f6m, Tuve L\u00f6fstr\u00f6m, and Henrik Linusson. 2014. Regression conformal prediction with random forests. Machine learning 97 (2014), 155--176."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008306431147"},{"key":"e_1_2_1_30_1","volume-title":"Carlo Curino, and Shivaram Venkataraman","author":"Kanellis Konstantinos","year":"2022","unstructured":"Konstantinos Kanellis, Cong Ding, Brian Kroth, Andreas M\u00fcller, Carlo Curino, and Shivaram Venkataraman. 2022. LlamaTune: sample-efficient DBMS configuration tuning. arXiv preprint arXiv:2203.05128 (2022)."},{"key":"e_1_2_1_31_1","volume-title":"Lightgbm: A highly efficient gradient boosting decision tree. Advances in neural information processing systems 30","author":"Ke Guolin","year":"2017","unstructured":"Guolin Ke, Qi Meng, Thomas Finley, Taifeng Wang, Wei Chen, Weidong Ma, Qiwei Ye, and Tie-Yan Liu. 2017. Lightgbm: A highly efficient gradient boosting decision tree. Advances in neural information processing systems 30 (2017)."},{"key":"e_1_2_1_32_1","first-page":"4138","article-title":"Predictive inference is free with the jackknife-after-bootstrap","volume":"33","author":"Kim Byol","year":"2020","unstructured":"Byol Kim, Chen Xu, and Rina Barber. 2020. Predictive inference is free with the jackknife-after-bootstrap. Advances in Neural Information Processing Systems 33 (2020), 4138--4149.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380591"},{"key":"e_1_2_1_34_1","volume-title":"Simple and scalable predictive uncertainty estimation using deep ensembles. Advances in neural information processing systems 30","author":"Lakshminarayanan Balaji","year":"2017","unstructured":"Balaji Lakshminarayanan, Alexander Pritzel, and Charles Blundell. 2017. Simple and scalable predictive uncertainty estimation using deep ensembles. Advances in neural information processing systems 30 (2017)."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2017.1307116"},{"key":"e_1_2_1_36_1","first-page":"82","article-title":"Optimizing hyperparameters of support vector machines by genetic algorithms","volume":"74","author":"Lessmann Stefan","year":"2005","unstructured":"Stefan Lessmann, Robert Stahlbock, and Sven F Crone. 2005. Optimizing hyperparameters of support vector machines by genetic algorithms. In IC-AI, Vol. 74. 82.","journal-title":"IC-AI"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.14778\/3352063.3352129"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467061"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/3586589.3586643"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2019.07.113"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijforecast.2021.11.013"},{"key":"e_1_2_1_42_1","volume-title":"International Conference on Learning Representations. https:\/\/openreview.net\/forum?id=1Jv6b0Zq3qi","author":"Malinin Andrey","year":"2021","unstructured":"Andrey Malinin, Liudmila Prokhorenkova, and Aleksei Ustimenko. 2021. Uncertainty in Gradient Boosting via Ensembles. In International Conference on Learning Representations. https:\/\/openreview.net\/forum?id=1Jv6b0Zq3qi"},{"key":"e_1_2_1_43_1","volume-title":"When do neural nets outperform boosted trees on tabular data? Advances in Neural Information Processing Systems 36","author":"McElfresh Duncan","year":"2024","unstructured":"Duncan McElfresh, Sujay Khandagale, Jonathan Valverde, Vishak Prasad C, Ganesh Ramakrishnan, Micah Goldblum, and Colin White. 2024. When do neural nets outperform boosted trees on tabular data? Advances in Neural Information Processing Systems 36 (2024)."},{"key":"e_1_2_1_44_1","volume-title":"Proceedings of the IASTED International Conference on Artificial Intelligence and Applications (AIA","author":"Papadopoulos Harris","year":"2008","unstructured":"Harris Papadopoulos, Alex Gammerman, and Volodya Vovk. 2008. Normalized nonconformity measures for regression conformal prediction. In Proceedings of the IASTED International Conference on Artificial Intelligence and Applications (AIA 2008). 64--69."},{"key":"e_1_2_1_45_1","volume-title":"PyTorch: An Imperative Style","author":"Paszke Adam","unstructured":"Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor Killeen, Zeming Lin, Natalia Gimelshein, Luca Antiga, Alban Desmaison, Andreas Kopf, Edward Yang, Zachary DeVito, Martin Raison, Alykhan Tejani, Sasank Chilamkurthy, Benoit Steiner, Lu Fang, Junjie Bai, and Soumith Chintala. 2019. PyTorch: An Imperative Style, High-Performance Deep Learning Library. In Advances in Neural Information Processing Systems 32. Curran Associates, Inc., 8024--8035. http:\/\/papers.neurips.cc\/paper\/9015-pytorch-an-imperative-style-high-performance-deep-learning-library.pdf"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2078195"},{"key":"e_1_2_1_47_1","volume-title":"Monte-Carlo simulation, and machine learning.","author":"Rubinstein Reuven Y","unstructured":"Reuven Y Rubinstein and Dirk P Kroese. 2004. The cross-entropy method: a unified approach to combinatorial optimization, Monte-Carlo simulation, and machine learning. Vol. 133. Springer."},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129065704001899"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1968.10480934"},{"key":"e_1_2_1_50_1","article-title":"A tutorial on conformal prediction","volume":"9","author":"Shafer Glenn","year":"2008","unstructured":"Glenn Shafer and Vladimir Vovk. 2008. A tutorial on conformal prediction. Journal of Machine Learning Research 9, 3 (2008).","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2494218"},{"key":"e_1_2_1_52_1","volume-title":"Random: Probability, Mathematical Statistics, Stochastic Processes","author":"Siegrist Kyle","year":"1997","unstructured":"Kyle Siegrist. 1997. Random: Probability, Mathematical Statistics, Stochastic Processes. http:\/\/www.randomservices.org\/random\/."},{"key":"e_1_2_1_53_1","volume-title":"Practical Bayesian optimization of machine learning algorithms. Advances in neural information processing systems 25","author":"Snoek Jasper","year":"2012","unstructured":"Jasper Snoek, Hugo Larochelle, and Ryan P Adams. 2012. Practical Bayesian optimization of machine learning algorithms. Advances in neural information processing systems 25 (2012)."},{"key":"e_1_2_1_54_1","volume-title":"International conference on machine learning. PMLR, 1674--1682","author":"Snoek Jasper","year":"2014","unstructured":"Jasper Snoek, Kevin Swersky, Rich Zemel, and Ryan Adams. 2014. Input warping for Bayesian optimization of non-stationary functions. In International conference on machine learning. PMLR, 1674--1682."},{"key":"e_1_2_1_55_1","volume-title":"Saint: Improved neural networks for tabular data via row attention and contrastive pre-training. arXiv preprint arXiv:2106.01342","author":"Somepalli Gowthami","year":"2021","unstructured":"Gowthami Somepalli, Micah Goldblum, Avi Schwarzschild, C Bayan Bruss, and Tom Goldstein. 2021. Saint: Improved neural networks for tabular data via row attention and contrastive pre-training. arXiv preprint arXiv:2106.01342 (2021)."},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357925"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467278"},{"key":"e_1_2_1_58_1","volume-title":"Gaussian process optimization in the bandit setting: No regret and experimental design. arXiv preprint arXiv:0912.3995","author":"Srinivas Niranjan","year":"2009","unstructured":"Niranjan Srinivas, Andreas Krause, Sham M Kakade, and Matthias Seeger. 2009. Gaussian process optimization in the bandit setting: No regret and experimental design. arXiv preprint arXiv:0912.3995 (2009)."},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00274"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487629"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064029"},{"key":"e_1_2_1_62_1","first-page":"19511","article-title":"Learning search space partition for black-box optimization using monte carlo tree search","volume":"33","author":"Wang Linnan","year":"2020","unstructured":"Linnan Wang, Rodrigo Fonseca, and Yuandong Tian. 2020. Learning search space partition for black-box optimization using monte carlo tree search. Advances in Neural Information Processing Systems 33 (2020), 19511--19522.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/3540250.3558962"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4806"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3526157"},{"key":"e_1_2_1_66_1","volume-title":"International Conference on Machine Learning. PMLR, 11559--11569","author":"Xu Chen","year":"2021","unstructured":"Chen Xu and Yao Xie. 2021. Conformal prediction interval for dynamic time-series. In International Conference on Machine Learning. PMLR, 11559--11569."},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300085"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.14778\/3538598.3538604"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457291"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3526176"},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3266893"},{"key":"e_1_2_1_72_1","volume-title":"Ensemble methods: foundations and algorithms","author":"Zhou Zhi-Hua","unstructured":"Zhi-Hua Zhou. 2012. Ensemble methods: foundations and algorithms. CRC press."},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.14778\/3641204.3641209"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3709671","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3709671","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T18:21:43Z","timestamp":1774981303000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3709671"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,10]]},"references-count":73,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2,10]]}},"alternative-id":["10.1145\/3709671"],"URL":"https:\/\/doi.org\/10.1145\/3709671","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,10]]}}}