<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05807906</id>
  <dt>a</dt>
  <an>05807906</an>
  <augroup>
    <au>Bernard, Simon</au>
    <au>Heutte, Laurent</au>
    <au>Adam, S\'ebastien</au>
  </augroup>
  <ti>A study of strength and correlation in random forests.</ti>
  <so>Huang, De-Shuang (ed) et al., Advanced intelligent computing theories and applications. 6th international conference on intelligent computing, Changsha, China, August 18--21, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14830-9/pbk; 978-3-642-14831-6/ebook). Communications in Computer and Information Science 93, 186-191 (2010).</so>
  <py>2010</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>random forests</ut>
    <ut>ensemble of classifiers</ut>
    <ut>strength</ut>
    <ut>correlation</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-3-642-14831-6_25</li>
  </ligroup>
  <abgroup>
    <ab>Summary: In this paper we present a study on the Random Forest (RF) family of classification methods, and more particularly on two important properties called strength and correlation. These two properties have been introduced by Breiman in the calculation of an upper bound of the generalization error. We thus propose to experimentally study the actual relation between these properties and the error rate in order to confirm and extend the Breiman theoretical results. We show that the error rate statistically decreases with the joint maximization of the strength and minimization of the correlation, and this for different sizes of RF.</ab>
    <rv></rv>
  </abgroup>
</item>