{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T22:58:21Z","timestamp":1754261901537,"version":"3.28.0"},"reference-count":42,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T00:00:00Z","timestamp":1626566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T00:00:00Z","timestamp":1626566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,18]]},"DOI":"10.1109\/ijcnn52387.2021.9534446","type":"proceedings-article","created":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T16:40:52Z","timestamp":1632242452000},"page":"1-8","source":"Crossref","is-referenced-by-count":14,"title":["Improved Boosted Regression Forests Through Non-Greedy Tree Optimization"],"prefix":"10.1109","author":[{"given":"Arman","family":"Zharmagambetov","sequence":"first","affiliation":[{"name":"University of California,Dept. of Computer Science and Engineering,Merced,CA,USA"}]},{"given":"Magzhan","family":"Gabidolla","sequence":"additional","affiliation":[{"name":"University of California,Dept. of Computer Science and Engineering,Merced,CA,USA"}]},{"given":"Miguel A.","family":"Carreira-Perpinan","sequence":"additional","affiliation":[{"name":"University of California,Dept. of Computer Science and Engineering,Merced,CA,USA"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"article-title":"UCI machine learning repository","year":"2013","author":"lichman","key":"ref38"},{"journal-title":"Boosting Foundations and Algorithms ser Adaptive Computation and Machine Learning Series","year":"2012","author":"schapire","key":"ref33"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007614523901"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1016218223"},{"key":"ref30","first-page":"1871","article-title":"LIB LINEAR: A library for large linear classification","volume":"9","author":"fan","year":"2008","journal-title":"J Machine Learning Research"},{"key":"ref37","first-page":"420","article-title":"Globally induced forest: A prepruning compression scheme","author":"begon","year":"2017","journal-title":"Proc of the 34th Int Conf Machine Learning (ICML 2017)"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.59"},{"key":"ref35","first-page":"665","article-title":"Narrowing the gap: Random forests in theory and in practice","author":"denil","year":"2014","journal-title":"Proc of the 31st Int Conf Machine Learning (ICML 2014)"},{"key":"ref34","first-page":"723","article-title":"Global refinement of random forest","author":"ren","year":"2015","journal-title":"Proc of the 2015 IEEE Computer Society Conf Computer Vision and Pattern Recognition (CVPR'15)"},{"key":"ref10","first-page":"1211","article-title":"Alternating optimization of decision trees, with application to learning sparse oblique trees","volume":"31","author":"carreira-perpi\u00f1\u00e1n","year":"2018","journal-title":"Advances in Neural IInformation Processing Systems"},{"journal-title":"Statistical Learning with Sparsity The Lasso and Generalizations ser Monographs on Statistics and Applied Probability Chapman & Hall\/CRC","year":"2015","author":"hastie","key":"ref40"},{"journal-title":"The Tree Alternating Optimization (TAO) algorithm A new way to learn decision trees and tree-based models","year":"2021","author":"carreira-perpinan","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1013203451"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1023\/A:1013685603443","article-title":"Boosting methods for regression","volume":"47","author":"nigel","year":"2002","journal-title":"Machine Learning"},{"key":"ref14","first-page":"107","article-title":"Improving regressors using boosting techniques","author":"drucker","year":"1997","journal-title":"Proc of the 14th Int Conf Machine Learning (ICML'97)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1162\/089976699300016746"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1162\/neco.2006.18.7.1678"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939785"},{"key":"ref18","first-page":"3146","article-title":"LightGBM: A highly efficient gradient boosting decision tree","volume":"30","author":"ke","year":"2017","journal-title":"Advances in Neural Information Processing Systems (NIPS)"},{"key":"ref19","first-page":"6638","article-title":"CatBoost: Unbiased boosting with categorical features","volume":"31","author":"prokhorenkova","year":"2018","journal-title":"Advances in Neural IInformation Processing Systems"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3412815.3416882"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1504"},{"key":"ref27","first-page":"11398","article-title":"Smaller, more accurate regression forests using tree alternating optimization","author":"zharmagambetov","year":"0","journal-title":"Proc of the 37th Int Conf Machine Learning (ICML 2020)"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010933404324"},{"journal-title":"Ensemble Methods Foundations and Algorithms ser Chapman & Hall\/CRC Machine Learning and Pattern Recognition Series","year":"2012","author":"zhou","key":"ref6"},{"key":"ref29","first-page":"1819","article-title":"Soft decision trees","author":"irsoy","year":"0","journal-title":"Proc 21st Int Conf Pattern Recognition (ICPR'12) Tsukuba Science City Japan"},{"key":"ref5","doi-asserted-by":"crossref","DOI":"10.1002\/9781118914564","author":"kuncheva","year":"2014","journal-title":"Combining Pattern Classifiers Methods and Algorithms"},{"journal-title":"Classification and Regression Trees Belmont","year":"1984","author":"breiman","key":"ref8"},{"journal-title":"The Elements of Statistical Learning-Data Mining Inference and Prediction","year":"2009","author":"hastie","key":"ref7"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1561\/0600000035","article-title":"Decision forests: A unified framework for classification, regression, density estimation, manifold learning and semi-supervised learning","volume":"7","author":"criminisi","year":"2012","journal-title":"Foundations and Trends in Computer Graphics and Vision"},{"journal-title":"C4 5 Programs for Machine Learning","year":"1993","author":"quinlan","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2010.08.011"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2007.07.001"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1162\/089976600300015178"},{"key":"ref21","first-page":"460","article-title":"Bias, variance, and arcing classifiers","author":"breiman","year":"1996","journal-title":"Technical Report 688 Dept of Statistics Univ of California"},{"journal-title":"Im-proved multiclass adaboost using sparse oblique decision trees","year":"2021","author":"gabidolla","key":"ref42"},{"key":"ref24","first-page":"842","article-title":"Real boosting a la Carte with an application to boosting oblique decision tree","author":"henry","year":"2007","journal-title":"Proc of the 20th Int Joint Conf Artificial Intelligence (IJCAI'07)"},{"key":"ref41","first-page":"2825","article-title":"Scikit-learn: Machine learning in Python","volume":"12","author":"pedregosa","year":"2011","journal-title":"J Machine Learning Research"},{"key":"ref23","first-page":"2001","article-title":"Parallelizing boosting and bagging","author":"yu","year":"2001","journal-title":"Dept of Computing and Information Science Queens University Tech Rep"},{"key":"ref26","first-page":"18","article-title":"Im-proved boosted regression forests through non-greedy tree optimization","author":"zharmagambetov","year":"0","journal-title":"Int J Conf Neural Networks (IJCNN'21) Virtual event"},{"journal-title":"An experimental comparison of old and new decision tree algorithms","year":"2020","author":"zharmagambetov","key":"ref25"}],"event":{"name":"2021 International Joint Conference on Neural Networks (IJCNN)","start":{"date-parts":[[2021,7,18]]},"location":"Shenzhen, China","end":{"date-parts":[[2021,7,22]]}},"container-title":["2021 International Joint Conference on Neural Networks (IJCNN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9533266\/9533267\/09534446.pdf?arnumber=9534446","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T23:54:56Z","timestamp":1699487696000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9534446\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,18]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/ijcnn52387.2021.9534446","relation":{},"subject":[],"published":{"date-parts":[[2021,7,18]]}}}