{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:00:44Z","timestamp":1742382044609,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001881"},{"type":"electronic","value":"9783540361824"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36182-0_16","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T17:10:33Z","timestamp":1193505033000},"page":"165-177","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["From Ensemble Methods to Comprehensible Models"],"prefix":"10.1007","author":[{"given":"C.","family":"Ferri","sequence":"first","affiliation":[]},{"given":"J.","family":"Hern\u00e1ndez-Orallo","sequence":"additional","affiliation":[]},{"given":"M. J.","family":"Ram\u00edrez-Quintana","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"issue":"2","key":"16_CR1","first-page":"123","volume":"24","author":"L. Breiman","year":"1996","unstructured":"Leo Breiman. Bagging predictors. Machine Learning, 24(2):123\u2013140, 1996.","journal-title":"Machine Learning"},{"key":"16_CR2","series-title":"Technical report","volume-title":"Experiences with ob1, an optimal bayes decision tree learner","author":"J.G. Cleary","year":"1998","unstructured":"J.G. Cleary and L.E. Trigg. Experiences with ob1, an optimal bayes decision tree learner. Technical report, Department of Computer Science, Univ. of Waikato, New Zealand, 1998."},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1177\/001316446002000104","volume":"20","author":"J. Cohen","year":"1960","unstructured":"J. Cohen. A coefficient of agreement for nominal scales. Educational and Psychological Meas., 20:37\u201346, 1960.","journal-title":"Educational and Psychological Meas"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"T. G Dietterich. Ensemble methods in machine learning. In First International Workshop on Multiple Classifier Systems, pages 1\u201315, 2000.","DOI":"10.1007\/3-540-45014-9_1"},{"issue":"2","key":"16_CR5","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1023\/A:1007607513941","volume":"40","author":"T. G. Dietterich","year":"2000","unstructured":"Thomas G. Dietterich. An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, Boosting, and Randomization. Machine Learning, 40(2):139\u2013157, 2000.","journal-title":"Machine Learning"},{"key":"16_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Induction of Decision Multi-trees using Levin Search","author":"C. Ferri","year":"2002","unstructured":"C. Ferri, J. Hern\u00e1ndez, and M.J. Ram\u00edrez. Induction of Decision Multi-trees using Levin Search. In Int. Conf. on Computational Science,ICCS\u201902, LNCS, 2002."},{"key":"16_CR7","unstructured":"C. Ferri, J. Hern\u00e1ndez, and M.J. Ram\u00edrez. Learning multiple and different hypotheses. Technical report, Department of Computer Science, Universitat Polit\u00e9cnica de Val\u00e9ncia, 2002."},{"key":"16_CR8","unstructured":"C. Ferri, J. Hern\u00e1ndez, and M.J. Ram\u00edrez. SMILES system, a multi-purpose learning system. http:\/\/www.dsic.upv.es\/~flip\/smiles\/ , 2002."},{"key":"16_CR9","unstructured":"Y. Freund and R.E. Schapire. Experiments with a new boosting algorithm. In the 13th Int. Conf. on Machine Learning (ICML\u20191996), pages 148\u2013156, 1996."},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Tim Kam Ho. C4.5 decision forests. In Proc. of 14th Intl. Conf. on Pattern Recognition,Brisbane,Australia, pages 545\u2013549, 1998.","DOI":"10.1109\/ICPR.1998.711201"},{"issue":"2","key":"16_CR11","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1109\/34.982906","volume":"24","author":"L. I. Kuncheva","year":"2002","unstructured":"Ludmila I. Kuncheva. A Theoretical Study on Six Classifier Fusion Strategies. IEEE Trans. on Pattern Analysis and Machine Intelligence, 24(2):281\u2013286, 2002.","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Ludmila I. Kuncheva and Christopher J. Whitaker. Measures of diversity in classifier ensembles and their relationship with the ensemble accuracy. Submitted to Machine Learning, 2002.","DOI":"10.1049\/ic:20010105"},{"key":"16_CR13","unstructured":"Dragos D. Margineantu and Thomas G. Dietterich. Pruning adaptive boosting. In 14th Int. Conf. on Machine Learning, pages 211\u2013218. Morgan Kaufmann, 1997."},{"key":"16_CR14","unstructured":"N.J. Nilsson. Artificial Intelligence: a new synthesis. Morgan Kaufmann, 1998."},{"key":"16_CR15","unstructured":"University of California. UCI Machine Learning Repository Content Summary. http:\/\/www.ics.uci.edu\/~mlearn\/MLSummary.html ."},{"key":"16_CR16","unstructured":"J. Quinlan. Miniboosting decision trees. Submitted to JAIR, 1998."},{"key":"16_CR17","unstructured":"J. R. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, 1993."},{"key":"16_CR18","unstructured":"J. R. Quinlan. Bagging, Boosting, and C4.5. In Proc. of the 13th Nat. Conf. on A.I. and the 8th Innovative Applications of A.I. Conf., pages 725\u2013730. AAAI\/MIT Press, 1996."},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Ross Quinlan. Relational learning and boosting. In Saso Dzeroski and Nada Lavrac, editors, Relational Data Mining, pages 292\u2013306. Springer-Verlag, September 2001.","DOI":"10.1007\/978-3-662-04599-2_12"},{"key":"16_CR20","first-page":"192","volume":"15","author":"P. Volf","year":"1994","unstructured":"P. Volf and F. Willems. Context maximizing: Finding mdl decision trees. In Symposium on Information Theory in the Benelux,Vol.15, pages 192\u2013200, 1994.","journal-title":"Context maximizing: Finding mdl decision trees"},{"key":"16_CR21","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1613\/jair.228","volume":"4","author":"G. I. Webb","year":"1996","unstructured":"Geoffrey I. Webb. Further experimental evidence against the utility of Occam\u2019s razor. Journal of Artificial Intelligence Research, 4:397\u2013417, 1996.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"2","key":"16_CR22","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0893-6080(05)80023-1","volume":"5","author":"D. H. Wolpert","year":"1992","unstructured":"David H. Wolpert. Stacked generalization. Neural Networks, 5(2):241\u2013259, 1992.","journal-title":"Neural Networks"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36182-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T23:34:37Z","timestamp":1737502477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36182-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001881","9783540361824"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-36182-0_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"8 November 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}