{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:03:22Z","timestamp":1725494602971},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440369"},{"type":"electronic","value":"9783540367550"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36755-1_21","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T16:03:29Z","timestamp":1194969809000},"page":"245-257","source":"Crossref","is-referenced-by-count":7,"title":["iBoost: Boosting Using an instance-Based Exponential Weighting Scheme"],"prefix":"10.1007","author":[{"given":"Stephen","family":"Kwek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chau","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,20]]},"reference":[{"key":"21_CR1","first-page":"123","volume":"24","author":"L. Breiman","year":"1996","unstructured":"L. Breiman. Bagging predictors. In Machine Learning, volume 24, pages 123\u2013140, 1996.","journal-title":"Machine Learning"},{"key":"21_CR2","unstructured":"T. G. Dietterich and E. B. Kong. Machine learning bias, statistical bias, and statistical variance of decision tree algorithms. Technical report, Department of Computer Science, Oregon State University, 1995."},{"issue":"2","key":"21_CR3","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1006\/inco.1995.1136","volume":"121","author":"Y. Freund","year":"1995","unstructured":"Y. Freund. Boosting a weak learning algorithm by majority. Inform. Comput., 121(2):256\u2013285, September 1995. Also appeared in COLT90.","journal-title":"Inform. Comput."},{"key":"21_CR4","unstructured":"Yoav Freund, Yishay Mansour, and Robert Schapire. Why averaging classifiers can protect against overfitting. In Proc. of the 8th International Workshop on Artificial Intelligence and Statistics, 2001."},{"key":"21_CR5","unstructured":"Yoav Freund and Robert E. Schapire. Experiments with a new boosting algorithm. In Proc. 13th International Conference on Machine Learning, pages 148\u2013146. Morgan Kaufmann, 1996."},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"David Helmbold, Stephen Kwek, and Leonard Pitt. Learning when to trust which experts. In Computational Learning Theory: EuroColt\u2019 97, pages 134\u2013149. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-62685-9_12"},{"key":"21_CR7","unstructured":"Michael I. Jordan and Robert A. Jacobs. Hierarchical mixtures of experts and the EM algorithm. CBCL Paper 83, M. I. T. Center for Biological and Computational Learning, August 1993."},{"issue":"1","key":"21_CR8","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/174644.174647","volume":"41","author":"M. Kearns","year":"1994","unstructured":"Michael Kearns and Leslie Valiant. Cryptographic limitations on learning Boolean formulae and finite automata. J. ACM, 41(1):67\u201395, 1994.","journal-title":"J. ACM"},{"key":"21_CR9","unstructured":"Ron Kohavi and David H. Wolpert. Bias plus variance decomposition for zero-one loss functions. In Proc. 13th International Conference on Machine Learning, pages 275\u2013283. Morgan Kaufmann, 1996."},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Eun Bae Kong and Thomas G. Dietterich. Error-correcting output coding corrects bias and variance. In Proc. 12th International Conference on Machine Learning, pages 313\u2013321. Morgan Kaufmann, 1995.","DOI":"10.1016\/B978-1-55860-377-6.50046-3"},{"issue":"2","key":"21_CR11","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1006\/inco.1994.1009","volume":"108","author":"N. Littlestone","year":"1994","unstructured":"N. Littlestone and M. K. Warmuth. The weighted majority algorithm. Inform. Comput., 108(2):212\u2013261, 1994.","journal-title":"Inform. Comput."},{"key":"21_CR12","unstructured":"Richard Maclin. Boosting classifiers regionally. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98) and of the 10th Conference on Innovative Applications of Artificial Intelligence (IAAI-98), pages 700\u2013705, Menlo Park, July 26\u201330 1998. AAAI Press."},{"key":"21_CR13","unstructured":"D. Optiz and R. Marlin. Popular ensemble methods: An empirical study. CBCL Paper UMD CS TR 98-1, University of Maryland, 19938."},{"issue":"2","key":"21_CR14","first-page":"197","volume":"5","author":"R. E. Schapire","year":"1990","unstructured":"Robert E. Schapire. The strength of weak learnability. Machine Learning, 5(2):197\u2013227, 1990.","journal-title":"Machine Learning"},{"key":"21_CR15","unstructured":"Robert E. Schapire, Yoav Freund, Peter Bartlett, and Wee Sun Lee. Boosting the margin: a new explanation for the effectiveness of voting methods. In Proc. 14th International Conference on Machine Learning, pages 322\u2013330. Morgan Kaufmann, 1997."},{"key":"21_CR16","unstructured":"Ljupco Todorovski and Saso Dzeroski. Combining classifiers with meta decision trees. In Machine Learning Journal, 2002. to appear."},{"issue":"11","key":"21_CR17","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. G. Valiant","year":"1984","unstructured":"L. G. Valiant. A theory of the learnable. Commun. ACM, 27(11):1134\u20131142, November 1984.","journal-title":"Commun. ACM"},{"key":"21_CR18","unstructured":"I. H. Witten and E. Frank. Nuts and bolts: Machine learning algorithms in java,. In Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations., pages 265\u2013320. Morgan Kaufmann, 2000."},{"issue":"2","key":"21_CR19","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0893-6080(05)80023-1","volume":"5","author":"D. Wolpert","year":"1992","unstructured":"D. Wolpert. Stacked generalization. Neural Networks, 5(2):241\u2013260, 1992.","journal-title":"Neural Networks"}],"container-title":["Lecture Notes in Computer Science","Machine Learning: ECML 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36755-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T01:18:11Z","timestamp":1551057491000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36755-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440369","9783540367550"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-36755-1_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}