{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T22:41:29Z","timestamp":1776811289193,"version":"3.51.2"},"reference-count":24,"publisher":"European Society of Computational Methods in Sciences and Engineering","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JCM"],"published-print":{"date-parts":[[2020,7,10]]},"DOI":"10.3233\/jcm-193912","type":"journal-article","created":{"date-parts":[[2019,11,5]],"date-time":"2019-11-05T10:53:21Z","timestamp":1572951201000},"page":"509-519","source":"Crossref","is-referenced-by-count":0,"title":["Accelerate tree ensemble learning based on adaptive sampling"],"prefix":"10.66113","volume":"20","author":[{"given":"Yu","family":"Zhou","sequence":"first","affiliation":[{"name":"College of Computer Science and Technology, Guizhou University, Guiyang, Guizhou 550025, China"},{"name":"Guizhou Engineer Lab of ACMIS, Guizhou University, Guiyang, Guizhou 550025, China"}]},{"given":"Hui","family":"Li","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Guizhou University, Guiyang, Guizhou 550025, China"},{"name":"Guizhou Engineer Lab of ACMIS, Guizhou University, Guiyang, Guizhou 550025, China"}]},{"given":"Mei","family":"Chen","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Guizhou University, Guiyang, Guizhou 550025, China"},{"name":"Guizhou Engineer Lab of ACMIS, Guizhou University, Guiyang, Guizhou 550025, China"}]},{"given":"Zhenyu","family":"Dai","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Guizhou University, Guiyang, Guizhou 550025, China"},{"name":"Guizhou Engineer Lab of ACMIS, Guizhou University, Guiyang, Guizhou 550025, China"}]},{"given":"Ming","family":"Zhu","sequence":"additional","affiliation":[{"name":"National Astronomical Observatories, Chinese Academy of Sciences, Beijing 100101, China"}]}],"member":"55691","reference":[{"issue":"5","key":"10.3233\/JCM-193912_ref1","doi-asserted-by":"crossref","first-page":"1189","DOI":"10.1214\/aos\/1013203451","article-title":"Greedy function approximation: A gradient boosting machine","volume":"29","author":"Friedman","year":"2011","journal-title":"Annals of Statistics"},{"key":"10.3233\/JCM-193912_ref2","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1145\/2939672.2939785","article-title":"XGBoost: A Scalable Tree Boosting System","author":"Chen","year":"2016","journal-title":"Proc. ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"},{"key":"10.3233\/JCM-193912_ref4","unstructured":"K. Alsabti, S. Ranka and V. Singh, CLOUDS: A DECISION TREE CLASSIFIER FOR LARGE DATasets, Knowledge Discovery & Data Mining (1998)."},{"key":"10.3233\/JCM-193912_ref5","doi-asserted-by":"crossref","unstructured":"R. Jin and G. Agrawal, Communication and Memory Efficient Parallel Decision Tree Construction, Proc. SDM 2003.","DOI":"10.1137\/1.9781611972733.11"},{"key":"10.3233\/JCM-193912_ref6","unstructured":"P. Li, C.J.C. Burges and Q. Wu, McRank: learning to rank using multiple classification and gradient boosting, Proc. International Conference on Neural Information Processing Systems (2007), 897\u2013904."},{"issue":"1\u20133","key":"10.3233\/JCM-193912_ref7","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1023\/A:1013912006537","article-title":"Logistic regression, AdaBoost and bregman distances","volume":"48","author":"Collins","year":"2002","journal-title":"Machine Learning"},{"issue":"4","key":"10.3233\/JCM-193912_ref8","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/S0167-9473(01)00065-2","article-title":"Stochastic gradient boosting,","volume":"38","author":"Friedman","year":"2002","journal-title":"Computational Statistics & Data Analysis"},{"key":"10.3233\/JCM-193912_ref9","doi-asserted-by":"crossref","unstructured":"J. Chen and J. Xu, Sampling adaptively using the massart inequality for scalable learning, Proc. International Conference on Machine Learning and Applications IEEE, 2014, pp. 362\u2013367.","DOI":"10.1109\/ICMLA.2013.149"},{"issue":"4","key":"10.3233\/JCM-193912_ref10","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","article-title":"A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations","volume":"23","author":"Chernoff","year":"1952","journal-title":"Annals of Mathematical Statistics"},{"key":"10.3233\/JCM-193912_ref11","doi-asserted-by":"crossref","unstructured":"W. Hoeffding, Taylor & Francis Online: Probability inequalities for sums of bounded random variables, Journal of the American Statistical Association 58(301).","DOI":"10.1080\/01621459.1963.10500830"},{"issue":"2","key":"10.3233\/JCM-193912_ref12","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1023\/A:1014091514039","article-title":"Adaptive sampling methods for scaling up knowledge discovery algorithms","volume":"6","author":"Domingo","year":"2002","journal-title":"Data Mining & Knowledge Discovery"},{"key":"10.3233\/JCM-193912_ref13","doi-asserted-by":"crossref","unstructured":"J. Kivinen and H. Mannila, The power of sampling in knowledge discovery, Proc. Thirteenth ACM Sigact-Sigmod-Sigart Symposium on Principles of Database Systems, ACM, 1994, pp. 77\u201385.","DOI":"10.1145\/182591.182601"},{"key":"10.3233\/JCM-193912_ref14","first-page":"134","article-title":"Sampling large databases for association rules","author":"Toivonen","year":"1996","journal-title":"Proc. International Conference on Very Large Data Bases,"},{"key":"10.3233\/JCM-193912_ref15","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/3-540-63223-9_108","article-title":"An algorithm for multi-relational discovery of subgroups","author":"Wrobel","year":"1997","journal-title":"Proc. European Symposium on Principles of Data Mining and Knowledge Discovery"},{"key":"10.3233\/JCM-193912_ref16","unstructured":"X. Chen, A new framework of multistage estimation, Mathematics (2008)."},{"key":"10.3233\/JCM-193912_ref17","first-page":"27","article-title":"Sequential sampling techniques for algorithmic learning theory","author":"Watanabe","year":"2000","journal-title":"Proc. International Conference on Algorithmic Learning Theory"},{"key":"10.3233\/JCM-193912_ref18","doi-asserted-by":"crossref","unstructured":"C. Domingo, O. Watanabe, Scaling up a boosting-based learner via adaptive sampling, Proc. PAKDD 2000, 317\u2013328.","DOI":"10.1007\/3-540-45571-X_37"},{"issue":"2","key":"10.3233\/JCM-193912_ref19","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1023\/A:1014091514039","article-title":"Adaptive sampling methods for scaling up knowledge discovery algorithms","volume":"6","author":"Domingo","year":"2002","journal-title":"Data Mining & Knowledge Discovery"},{"issue":"1","key":"10.3233\/JCM-193912_ref20","first-page":"19","article-title":"Simple sampling techniques for discovery science","volume":"83","author":"Watanabe","year":"2000","journal-title":"IEICE Transactions on Information & Systems"},{"key":"10.3233\/JCM-193912_ref21","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1007\/978-3-642-21916-0_25","article-title":"A new method for adaptive sequential sampling for learning and parameter estimation","author":"Chen","year":"2011","journal-title":"Proc. International Conference on Foundations of Intelligent Systems"},{"key":"10.3233\/JCM-193912_ref22","doi-asserted-by":"crossref","unstructured":"J. Chen, Scalable ensemble learning by adaptive sampling, Proc. International Conference on Machine Learning and Applications, IEEE Computer Society, 2012, pp. 622\u2013625.","DOI":"10.1109\/ICMLA.2012.115"},{"key":"10.3233\/JCM-193912_ref23","doi-asserted-by":"crossref","unstructured":"J. Chen and J. Xu, Sampling adaptively using the massart inequality for scalable learning, Proc. International Conference on Machine Learning and Applications, IEEE, 2014, pp. 362\u2013367.","DOI":"10.1109\/ICMLA.2013.149"},{"key":"10.3233\/JCM-193912_ref24","doi-asserted-by":"crossref","unstructured":"J. Chen, Properties of a new adaptive sampling method with applications to scalable learning, Proc. IEEE International Joint Conferences on Web Intelligence, 2013, pp. 9\u201315.","DOI":"10.1109\/WI-IAT.2013.3"},{"issue":"3","key":"10.3233\/JCM-193912_ref25","doi-asserted-by":"crossref","first-page":"1269","DOI":"10.1214\/aop\/1176990746","article-title":"The tight constant in the Dvoretzky-Kiefer-Wolfowitz inequality","volume":"18","author":"Massart","year":"1990","journal-title":"Annals of Probability"}],"container-title":["Journal of Computational Methods in Sciences and Engineering"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JCM-193912","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T22:05:58Z","timestamp":1776809158000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JCM-193912"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,10]]},"references-count":24,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.3233\/jcm-193912","relation":{},"ISSN":["1472-7978","1875-8983"],"issn-type":[{"value":"1472-7978","type":"print"},{"value":"1875-8983","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,10]]}}}