\begin{thebibliography}{}

\bibitem[\protect\BCAY{Bauer\ \BBA\ Kohavi}{Bauer\ \BBA\ Kohavi}{1999}]{bkAE}
Bauer, E.\BBACOMMA\  \BBA\ Kohavi, R. \BBOP1999\BBCP.
\newblock \BBOQ An empirical comparison of voting classification algorithms:
  Bagging, boosting, and variants\BBCQ\
\newblock {\Bem Machine Learning}, {\Bem 36}, 105--139.

\bibitem[\protect\BCAY{Blake, Keogh,\ \BBA\ Merz}{Blake et~al.}{1998}]{bkmUR}
Blake, C.~L., Keogh, E., \BBA\ Merz, C. \BBOP1998\BBCP.
\newblock \BBOQ {UCI} repository of machine learning databases\BBCQ.
\newblock \texttt{http://www.ics.uci.edu/$\sim$mlearn/MLRepository.html}.

\bibitem[\protect\BCAY{Breiman}{Breiman}{1996}]{bBP}
Breiman, L. \BBOP1996\BBCP.
\newblock \BBOQ Bagging predictors\BBCQ\
\newblock {\Bem Machine Learning}, {\Bem 24}, 123--140.

\bibitem[\protect\BCAY{Breiman, Freidman, Olshen,\ \BBA\ Stone}{Breiman
  et~al.}{1984}]{bfosCA}
Breiman, L., Freidman, J.~H., Olshen, R.~A., \BBA\ Stone, C.~J. \BBOP1984\BBCP.
\newblock {\Bem Classification and Regression Trees}.
\newblock Wadsworth.

\bibitem[\protect\BCAY{Buja\ \BBA\ Lee}{Buja\ \BBA\ Lee}{2001}]{blDM}
Buja, A.\BBACOMMA\  \BBA\ Lee, Y.-S. \BBOP2001\BBCP.
\newblock \BBOQ Data mining criteria for tree-based regression and
  classification\BBCQ\
\newblock In {\Bem Proceedings of the 7$^{th}$ International Conference on
  Knowledge Discovery in Databases}, \BPGS\ 27--36.

\bibitem[\protect\BCAY{Buntine\ \BBA\ Niblett}{Buntine\ \BBA\
  Niblett}{1992}]{bnAF}
Buntine, W.\BBACOMMA\  \BBA\ Niblett, T. \BBOP1992\BBCP.
\newblock \BBOQ A further comparison of splitting rules for {D}ecision-{T}ree
  induction\BBCQ\
\newblock {\Bem Machine Learning}, {\Bem 8}, 75--85.

\bibitem[\protect\BCAY{Clark\ \BBA\ Boswell}{Clark\ \BBA\
  Boswell}{1991}]{cbRI}
Clark, P.\BBACOMMA\  \BBA\ Boswell, R. \BBOP1991\BBCP.
\newblock \BBOQ Rule induction with CN2: some recent 
  improvements\BBCQ\
\newblock In {\Bem Proceedings of the 6$^{~th}$ European 
  Working Session in Learning}, \BPGS\ 155--161.

\bibitem[\protect\BCAY{Cohen\ \BBA\ Singer}{Cohen\ \BBA\
  Singer}{1999}]{csAS}
Cohen, W.~W.\BBACOMMA\  \BBA\ Singer, Y. \BBOP1999\BBCP.
\newblock \BBOQ A Simple, Fast and Effective Rule Learner\BBCQ\
\newblock In {\Bem Proceedings of the 16$^{th}$ National Conference on
  Artificial Intelligence}, \BPGS\ 335--342.

\bibitem[\protect\BCAY{de~Carvalho~Gomes\ \BBA\ Gascuel}{de~Carvalho~Gomes\
  \BBA\ Gascuel}{1994}]{dgSD}
de~Carvalho~Gomes, F.~A.\BBACOMMA\  \BBA\ Gascuel, O. \BBOP1994\BBCP.
\newblock \BBOQ {SDL}, a stochastic algorithm for learning decision lists with
  limited complexity\BBCQ\
\newblock {\Bem Annals of Mathematics and Artificial Intelligence}, {\Bem 10},
  281--302.

\bibitem[\protect\BCAY{Dietterich}{Dietterich}{2000}]{dAE}
Dietterich, T.~G. \BBOP2000\BBCP.
\newblock \BBOQ An experimental comparison of three methods for constructing
  ensembles of decision trees: Bagging, boosting, and randomization\BBCQ\
\newblock {\Bem Machine Learning}, {\Bem 40}, 139--157.

\bibitem[\protect\BCAY{Domingos}{Domingos}{1998}]{dAP}
Domingos, P. \BBOP1998\BBCP.
\newblock \BBOQ A {P}rocess-oriented {H}euristic for {M}odel selection\BBCQ\
\newblock In {\Bem Proceedings of the 15$^{~th}$ International Conference on
  Machine Learning}, \BPGS\ 127--135.

\bibitem[\protect\BCAY{Feige}{Feige}{1996}]{fAT}
Feige, U. \BBOP1996\BBCP.
\newblock \BBOQ A threshold of ln $n$ for approximating set cover\BBCQ\
\newblock In {\Bem Proceedings of the 28$^{~th}$ ACM Symposium on the Theory of
  Computing}, \BPGS\ 314--318.

\bibitem[\protect\BCAY{Franck\ \BBA\ Witten}{Franck\ \BBA\ Witten}{1998}]{fwUA}
Franck, E.\BBACOMMA\  \BBA\ Witten, I. \BBOP1998\BBCP.
\newblock \BBOQ Using a {P}ermutation {T}est for {A}ttribute selection in
  {D}ecision {T}rees\BBCQ\
\newblock In {\Bem Proceedings of the 15$^{~th}$ International Conference on
  Machine Learning}, \BPGS\ 152--160.

\bibitem[\protect\BCAY{Freund\ \BBA\ Mason}{Freund\ \BBA\ Mason}{1999}]{fmTA}
Freund, Y.\BBACOMMA\  \BBA\ Mason, L. \BBOP1999\BBCP.
\newblock \BBOQ The alternating decision tree learning algorithm\BBCQ\
\newblock In {\Bem Proceedings of the 16$^{~th}$ International Conference on
  Machine Learning}, \BPGS\ 124--133.

\bibitem[\protect\BCAY{Friedman, Hastie,\ \BBA\ Tibshirani}{Friedman
  et~al.}{2000}]{fhtAL}
Friedman, J., Hastie, T., \BBA\ Tibshirani, R. \BBOP2000\BBCP.
\newblock \BBOQ {A}dditive {L}ogistic {R}egression : a {S}tatistical {V}iew of
  {B}oosting\BBCQ\
\newblock {\Bem Annals of Statistics}, {\Bem 28}, 337--374.

\bibitem[\protect\BCAY{Garey\ \BBA\ Johnson}{Garey\ \BBA\ Johnson}{1979}]{gjCA}
Garey, M.\BBACOMMA\  \BBA\ Johnson, D. \BBOP1979\BBCP.
\newblock {\Bem Computers and Intractability, a guide to the theory of
  NP-Completeness}.
\newblock Bell Telephone Laboratories.

\bibitem[\protect\BCAY{Gr{\"o}tschel, Lov{\`a}sz,\ \BBA\
  Schrijver}{Gr{\"o}tschel et~al.}{1981}]{glsTE}
Gr{\"o}tschel, M., Lov{\`a}sz, L., \BBA\ Schrijver, A. \BBOP1981\BBCP.
\newblock \BBOQ The ellipsoid method and its consequences in combinatorial
  optimization\BBCQ\
\newblock {\Bem Combinatorica}, {\Bem 1}, 169--197.

\bibitem[\protect\BCAY{Holte}{Holte}{1993}]{hVS}
Holte, R. \BBOP1993\BBCP.
\newblock \BBOQ Very simple classification rules perform well on most commonly
  used datasets\BBCQ\
\newblock {\Bem Machine Learning}, {\Bem 11}, 63--91.

\bibitem[\protect\BCAY{Hyafil\ \BBA\ Rivest}{Hyafil\ \BBA\ Rivest}{1976}]{hrCO}
Hyafil, L.\BBACOMMA\  \BBA\ Rivest, R. \BBOP1976\BBCP.
\newblock \BBOQ Constructing optimal decision trees is {NP}-complete\BBCQ\
\newblock {\Bem Information Processing Letters}, {\Bem 5}, 15--17.

\bibitem[\protect\BCAY{John, Kohavi,\ \BBA\ Pfleger}{John et~al.}{1994}]{jkpIF}
John, G.~H., Kohavi, R., \BBA\ Pfleger, K. \BBOP1994\BBCP.
\newblock \BBOQ Irrelevant features and the subset selection problem\BBCQ\
\newblock In {\Bem Proceedings of the 11$^{~th}$ International Conference on
  Machine Learning}, \BPGS\ 121--129.

\bibitem[\protect\BCAY{Kearns\ \BBA\ Mansour}{Kearns\ \BBA\
  Mansour}{1998}]{kmAF}
Kearns, M.~J.\BBACOMMA\  \BBA\ Mansour, Y. \BBOP1998\BBCP.
\newblock \BBOQ A {F}ast, {B}ottom-up {D}ecision {T}ree {P}runing algorithm
  with {N}ear-{O}ptimal generalization\BBCQ\
\newblock In {\Bem Proceedings of the 15$^{~th}$ International Conference on
  Machine Learning}, \BPGS\ 269--277.

\bibitem[\protect\BCAY{Kearns, Li, Pitt,\ \BBA\ Valiant}{Kearns
  et~al.}{1987}]{klpvOT}
Kearns, M., Li, M., Pitt, L., \BBA\ Valiant, L. \BBOP1987\BBCP.
\newblock \BBOQ On the learnability of boolean formulae\BBCQ\
\newblock In {\Bem Proceedings of the 19$^{~th}$ ACM Symposium on the Theory of
  Computing}, \BPGS\ 285--295.

\bibitem[\protect\BCAY{Kohavi\ \BBA\ Sommerfield}{Kohavi\ \BBA\
  Sommerfield}{1998}]{ksTB}
Kohavi, D.\BBACOMMA\  \BBA\ Sommerfield, D. \BBOP1998\BBCP.
\newblock \BBOQ Targetting {B}usiness users with {D}ecision {T}able
  {C}lassifiers\BBCQ\
\newblock In {\Bem Proceedings of the 4$^{th}$ International Conference on
  Knowledge Discovery in Databases}, \BPGS\ 249--253.

\bibitem[\protect\BCAY{Mansour\ \BBA\ Mc{A}llester}{Mansour\ \BBA\
  Mc{A}llester}{2000}]{mmBU}
Mansour, Y.\BBACOMMA\  \BBA\ Mc{A}llester, D. \BBOP2000\BBCP.
\newblock \BBOQ Boosting using branching programs\BBCQ\
\newblock In {\Bem Proceedings of the 13$^{~th}$ International Conference on
  Computational Learning Theory}, \BPGS\ 220--224.

\bibitem[\protect\BCAY{Margineantu\ \BBA\ Dietterich}{Margineantu\ \BBA\
  Dietterich}{1997}]{mdPA}
Margineantu, D.\BBACOMMA\  \BBA\ Dietterich, T.~G. \BBOP1997\BBCP.
\newblock \BBOQ Pruning adaptive boosting\BBCQ\
\newblock In {\Bem Proceedings of the 14$^{~th}$ International Conference on
  Machine Learning}, \BPGS\ 211--218.

\bibitem[\protect\BCAY{Mitchell}{Mitchell}{1997}]{mML}
Mitchell, T. \BBOP1997\BBCP.
\newblock {\Bem Machine Learning}.
\newblock McGraw-Hill.

\bibitem[\protect\BCAY{Nock\ \BBA\ Gascuel}{Nock\ \BBA\ Gascuel}{1995}]{ngOL}
Nock, R.\BBACOMMA\  \BBA\ Gascuel, O. \BBOP1995\BBCP.
\newblock \BBOQ On learning decision committees\BBCQ\
\newblock In {\Bem Proceedings of the 12$^{~th}$ International Conference on
  Machine Learning}, \BPGS\ 413--420. Morgan Kaufmann.

\bibitem[\protect\BCAY{Nock\ \BBA\ Jappy}{Nock\ \BBA\ Jappy}{1998}]{njOT}
Nock, R.\BBACOMMA\  \BBA\ Jappy, P. \BBOP1998\BBCP.
\newblock \BBOQ On the power of decision lists\BBCQ\
\newblock In {\Bem Proceedings of the 15$^{~th}$ International Conference on
  Machine Learning}, \BPGS\ 413--420. Morgan Kaufmann.

\bibitem[\protect\BCAY{Opitz\ \BBA\ Maclin}{Opitz\ \BBA\ Maclin}{1999}]{omPE}
Opitz, D.\BBACOMMA\  \BBA\ Maclin, R. \BBOP1999\BBCP.
\newblock \BBOQ Popular ensemble methods: a survey\BBCQ\
\newblock {\Bem Journal of Artificial Intelligence Research}, {\Bem 11},
  169--198.

\bibitem[\protect\BCAY{Queyranne}{Queyranne}{1998}]{qMS}
Queyranne, M. \BBOP1998\BBCP.
\newblock \BBOQ Minimizing symmetric submodular functions\BBCQ\
\newblock {\Bem Mathematical Programming}, {\Bem 82}, 3--12.

\bibitem[\protect\BCAY{Quinlan}{Quinlan}{1994}]{qC4}
Quinlan, J.~R. \BBOP1994\BBCP.
\newblock {\Bem C4.5 : programs for machine learning}.
\newblock Morgan Kaufmann.

\bibitem[\protect\BCAY{Quinlan}{Quinlan}{1996}]{qBB}
Quinlan, J.~R. \BBOP1996\BBCP.
\newblock \BBOQ {B}agging, {B}oosting and {C}4.5\BBCQ\
\newblock In {\Bem Proceedings of the 13$^{th}$ National Conference on
  Artificial Intelligence}, \BPGS\ 725--730.

\bibitem[\protect\BCAY{Ridgeway, Madigan, Richardson,\ \BBA\ O'Kane}{Ridgeway
  et~al.}{1998}]{rmroIB}
Ridgeway, G., Madigan, D., Richardson, T., \BBA\ O'Kane, J. \BBOP1998\BBCP.
\newblock \BBOQ Interpretable boosted naive bayes classification\BBCQ\
\newblock In {\Bem Proceedings of the 4$^{th}$ International Conference on
  Knowledge Discovery in Databases}, \BPGS\ 101--104.

\bibitem[\protect\BCAY{Rivest}{Rivest}{1987}]{rLD}
Rivest, R. \BBOP1987\BBCP.
\newblock \BBOQ Learning decision lists\BBCQ\
\newblock {\Bem Machine Learning}, {\Bem 2}, 229--246.

\bibitem[\protect\BCAY{Schapire, Freund, Bartlett,\ \BBA\ Lee}{Schapire
  et~al.}{1998}]{sfblBT}
Schapire, R.~E., Freund, Y., Bartlett, P., \BBA\ Lee, W.~S. \BBOP1998\BBCP.
\newblock \BBOQ Boosting the {M}argin : a new explanation for the effectiveness
  of {V}oting methods\BBCQ\
\newblock {\Bem Annals of statistics}, {\Bem 26}, 1651--1686.

\bibitem[\protect\BCAY{Schapire\ \BBA\ Singer}{Schapire\ \BBA\
  Singer}{1998}]{ssIB}
Schapire, R.~E.\BBACOMMA\  \BBA\ Singer, Y. \BBOP1998\BBCP.
\newblock \BBOQ Improved boosting algorithms using confidence-rated
  predictions\BBCQ\
\newblock In {\Bem Proceedings of the 11$^{~th}$ International Conference on
  Computational Learning Theory}, \BPGS\ 80--91.

\bibitem[\protect\BCAY{Valiant}{Valiant}{1984}]{vAT}
Valiant, L.~G. \BBOP1984\BBCP.
\newblock \BBOQ A theory of the learnable\BBCQ\
\newblock {\Bem Communications of the ACM}, {\Bem 27}, 1134--1142.

\bibitem[\protect\BCAY{Valiant}{Valiant}{1985}]{vLD}
Valiant, L.~G. \BBOP1985\BBCP.
\newblock \BBOQ Learning disjunctions of conjunctions\BBCQ\
\newblock In {\Bem Proceedings of the 9$^{~th}$ International Joint Conference
  on Artificial Intelligence}, \BPGS\ 560--566.

\end{thebibliography}
