{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T05:24:12Z","timestamp":1767677052408},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677048"},{"type":"electronic","value":"9783540450146"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45014-9_8","type":"book-chapter","created":{"date-parts":[[2007,10,25]],"date-time":"2007-10-25T19:19:51Z","timestamp":1193339991000},"page":"87-96","source":"Crossref","is-referenced-by-count":2,"title":["Some Results on Weakly Accurate Base Learners for Boosting Regression and Classification"],"prefix":"10.1007","author":[{"given":"Wenxin","family":"Jiang","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,12,1]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1214\/aos\/1024691079","volume":"26","author":"L. Breiman","year":"1998","unstructured":"Breiman, L. (1998). Arcing classifiers. The Annals of Statistics, 26 801\u2013849.","journal-title":"The Annals of Statistics"},{"key":"8_CR2","unstructured":"Breiman, L. (1997). Prediction games and arcing classifiers. Technical Report 504, Statistics Department, University of California at Berkeley, 1997."},{"key":"8_CR3","unstructured":"Breiman, L. (1997). Arcing the edge. Technical Report 486, Statistics Department, University of California at Berkeley, 1997"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1006\/inco.1995.1136","volume":"121","author":"Y. Freund","year":"1995","unstructured":"Freund, Y. (1995). Boosting a weak learning algorithm by majority. Information and Computation, 121 256\u2013285.","journal-title":"Information and Computation"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Freund, Y. and Schapire, R. E. (1996). Game theory, on-line prediction and boosting. Proceedings of the Ninth Annual Conference on Computational Learning Theory, 325\u2013332.","DOI":"10.1145\/238061.238163"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y. Freund","year":"1997","unstructured":"Freund, Y. and Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55 119\u2013139.","journal-title":"Journal of Computer and System Sciences"},{"key":"8_CR7","unstructured":"Friedman, J. H. (1999). Greedy function approximation: a gradient boosting machine. Technical Report, Department of Statistics, Stanford University"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Friedman, J., Hastie, T. Tibshirani, R. (1999). Additive logistic regression: a statistical view of boosting. Technical Report, Department of Statistics, Stanford University","DOI":"10.1214\/aos\/1016218223"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/BF01200426","volume":"2","author":"M. Goldmann","year":"1992","unstructured":"Goldmann, M., Hastad, J., and Razborov, A. (1992). Majority gates vs. general weighted threshold gates. Computational Complexity, 2 277\u2013300.","journal-title":"Computational Complexity"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1162\/neco.1991.3.1.79","volume":"3","author":"R. A. Jacobs","year":"1991","unstructured":"Jacobs, R. A., Jordan, M. I., Nowlan, S. J., Hinton, G. E. (1991). Adaptive mixtures of local experts. Neural Comp3 79\u201387.","journal-title":"Neural Comp"},{"key":"8_CR11","unstructured":"Jiang, W. (1999). Large time behavior of boosting algorithms for regression and classification. Technical Report, Department of Statistics, Northwestern University."},{"key":"8_CR12","unstructured":"Jiang, W. (2000). On weak base learners for boosting regression and classification. Technical Report, Department of Statistics, Northwestern University."},{"key":"8_CR13","unstructured":"Mason, L., Baxter, J., Bartlett, P. Frean, M. Boosting algorithms as gradient descent in function space. Technical Report, Department of Systems Engineering, Australian National University"},{"key":"8_CR14","first-page":"197","volume":"5","author":"R. E. Schapire","year":"1990","unstructured":"Schapire, R. E. (1990). The strength of weak learnability. Machine Learning, 5 197\u2013227.","journal-title":"Machine Learning"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Schapire, R. E. (1999). Theoretical views of boosting. Computational Learning Theory: Fourth European Conference, EuroCOLT\u201999, 1\u201310.","DOI":"10.1007\/3-540-49097-3_1"},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"1651","DOI":"10.1214\/aos\/1024691352","volume":"26","author":"R. E. Schapire","year":"1998","unstructured":"Schapire, R. E., Freund, Y., Bartlett, P. AND Lee, W. S. (1998). Boosting the margin: A new explanation for the effectiveness of voting methods. The Annals of Statistics, 26 1651\u20131686.","journal-title":"The Annals of Statistics"}],"container-title":["Lecture Notes in Computer Science","Multiple Classifier Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45014-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,26]],"date-time":"2021-08-26T06:43:47Z","timestamp":1629960227000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45014-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677048","9783540450146"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45014-9_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}