{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T04:10:47Z","timestamp":1748751047745,"version":"3.41.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319271217"},{"type":"electronic","value":"9783319271224"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-27122-4_4","type":"book-chapter","created":{"date-parts":[[2015,11,16]],"date-time":"2015-11-16T11:27:27Z","timestamp":1447673247000},"page":"52-65","source":"Crossref","is-referenced-by-count":2,"title":["Parallel Training GBRT Based on KMeans Histogram Approximation for Big Data"],"prefix":"10.1007","author":[{"given":"Rong","family":"Gu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongwei","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingying","family":"Qu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaojun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunfeng","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yihua","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,16]]},"reference":[{"key":"4_CR1","first-page":"849","volume":"11","author":"Y Ben-Haim","year":"2010","unstructured":"Ben-Haim, Y., Tom-Tov, E.: A streaming parallel decision tree algorithm. J. Mach. Learn. Res. (JMLR) 11, 849\u2013872 (2010)","journal-title":"J. Mach. Learn. Res. (JMLR)"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., Hullender, G.: Learning to rank using gradient descent. In: Proceedings of the 22nd International Conference on Machine Learning (ICML), pp. 89\u201396. ACM (2005)","DOI":"10.1145\/1102351.1102363"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Cao, Z., Qin, T., Liu, T.Y., Tsai, M.F., Li, H.: Learning to rank: from pairwise approach to listwise approach. In: Proceedings of the 24th International Conference on Machine Learning (ICML), pp. 129\u2013136. ACM (2007)","DOI":"10.1145\/1273496.1273513"},{"key":"4_CR4","unstructured":"Chapelle, O., Chang, Y.: Yahoo! learning to rank challenge overview. In: Proceedings of JMLR: Workshop and Conference on Yahoo! Learning to Rank, pp. 1\u201324 (2011)"},{"issue":"1","key":"4_CR5","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean, J., Ghemawat, S.: Mapreduce: simplified data processing on large clusters. Commun. ACM 51(1), 107\u2013113 (2008)","journal-title":"Commun. ACM"},{"issue":"5","key":"4_CR6","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1214\/aos\/1013203451","volume":"29","author":"JH Friedman","year":"2001","unstructured":"Friedman, J.H.: Greedy function approximation: a gradient boosting machine. Ann. Stat. 29(5), 1189\u20131232 (2001)","journal-title":"Ann. Stat."},{"issue":"10","key":"4_CR7","first-page":"1854","volume":"94","author":"L Hang","year":"2011","unstructured":"Hang, L.: A short introduction to learning to rank. IEICE Trans. Inf. Syst. 94(10), 1854\u20131862 (2011)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"4_CR8","unstructured":"Liu, T.Y., Xu, J., Qin, T., Xiong, W., Li, H.: Letor: benchmark dataset for research on learning to rank for information retrieval. In: Proceedings of SIGIR 2007 Workshop on Learning To Rank for Information Retrieval, pp. 3\u201310 (2007)"},{"key":"4_CR9","unstructured":"Mohan, A., Chen, Z., Weinberger, K.Q.: Web-search ranking with initialized gradient boosted regression trees. In: JMLR: Workshop and Conference Proceedings, pp. 77\u201389 (2011)"},{"issue":"2","key":"4_CR10","doi-asserted-by":"publisher","first-page":"1426","DOI":"10.14778\/1687553.1687569","volume":"2","author":"B Panda","year":"2009","unstructured":"Panda, B., Herbach, J.S., Basu, S., Bayardo, R.J.: Planet: massively parallel learning of tree ensembles with mapreduce. Proc. VLDB Endowment 2(2), 1426\u20131437 (2009)","journal-title":"Proc. VLDB Endowment"},{"key":"4_CR11","unstructured":"Shafer, J., Agrawal, R., Mehta, M.: Sprint: a scalable parallel classi er for data mining. In: Proceedings of the 1996 International Conference Very Large Data Basesm (VLDB), pp. 544\u2013555. Citeseer (1996)"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Srivastava, A., Han, E.H., Kumar, V., Singh, V.: Parallel formulations of decision-tree classification algorithms. In: Proceedings of the 1988 International Conference on Parallel Processing (ICPP), pp. 237\u2013244. IEEE (1998)","DOI":"10.1109\/ICPP.1998.708491"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Tyree, S., Weinberger, K.Q., Agrawal, K., Paykin, J.: Parallel boosted regression trees for web search ranking. In: Proceedings of the 20th International Conference on World Wide Web(WWW), pp. 387\u2013396. ACM (2011)","DOI":"10.1145\/1963405.1963461"},{"key":"4_CR14","first-page":"1883","volume-title":"Advances in Neural Information Processing Systems 22 (NIPS)","author":"H Valizadegan","year":"2009","unstructured":"Valizadegan, H., Jin, R., Zhang, R., Mao, J.: Learning to rank by optimizing ndcg measure. In: Bengio, Y., Schuurmans, D., Lafferty, J., Williams, C., Culotta, A. (eds.) Advances in Neural Information Processing Systems 22 (NIPS), pp. 1883\u20131891. Curran Associates Inc., Red Hook (2009)"},{"key":"4_CR15","unstructured":"Wu, Q., Burges, C.J., Svore, K.M., Gao, J.: Ranking, boosting, and model adaptation. Tecnical report, MSR-TR-2008-109 (2008)"},{"key":"4_CR16","unstructured":"Zaharia, M., Chowdhury, M., Das, T., Dave, A., Ma, J., McCauley, M., Franklin, M.J., Shenker, S., Stoica, I.: Resilient distributed datasets: a fault-tolerant abstraction for in-memory cluster computing. In: Proceedings of the 9th USENIX Conference on Networked Systems Design and Implementation (NSDI), pp. 2\u201312. USENIX Association (2012)"},{"key":"4_CR17","unstructured":"Zheng, Z., Zha, H., Zhang, T., Chapelle, O., Chen, K., Sun, G.: A general boosting method and its application to learning ranking functions for web search. In: Advances in Neural Information Processing Systems (NIPS), pp. 1697\u20131704 (2008)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27122-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T12:05:00Z","timestamp":1748693100000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27122-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319271217","9783319271224"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27122-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}