\begin{thebibliography}{}

\bibitem[\protect\BCAY{Aha, Kibler, \BBA\ Albert}{Aha et~al.}{1991}]{aha:ibla}
Aha, D.~W., Kibler, D., \BBA\ Albert, M.~K. \BBOP1991\BBCP.
\newblock \BBOQ Instance-based learning algorithms\BBCQ\
\newblock {\Bem Machine Learning}, {\Bem 6}, 37--66.

\bibitem[\protect\BCAY{Ali, Brunk, \BBA\ Pazzani}{Ali
  et~al.}{1994}]{ali:olmdoa}
Ali, K., Brunk, C., \BBA\ Pazzani, M. \BBOP1994\BBCP.
\newblock \BBOQ On learning multiple descriptions of a concept\BBCQ\
\newblock In {\Bem Proceedings of Tools with Artificial Intelligence}\ New
  Orleans, LA.

\bibitem[\protect\BCAY{Berkman \BBA\ Sandholm}{Berkman \BBA\
  Sandholm}{1995}]{ber:wsbmia}
Berkman, N.~C.\BBACOMMA\  \BBA\ Sandholm, T.~W. \BBOP1995\BBCP.
\newblock \BBOQ What should be minimized in a decision tree: {A}
  re-examination\BBCQ\
\newblock Technical report\ 95-20, University of Massachusetts at Amherst,
  Computer Science Department, Amherst, Mass.

\bibitem[\protect\BCAY{Blumer, Ehrenfeucht, Haussler, \BBA\ Warmuth}{Blumer
  et~al.}{1987}]{blu:ocsra}
Blumer, A., Ehrenfeucht, A., Haussler, D., \BBA\ Warmuth, M.~K. \BBOP1987\BBCP.
\newblock \BBOQ {{O}}ccam's {{R}}azor\BBCQ\
\newblock {\Bem Information Processing Letters}, {\Bem 24}, 377--380.

\bibitem[\protect\BCAY{Breiman, Friedman, Olshen, \BBA\ Stone}{Breiman
  et~al.}{1984}]{bre:cart}
Breiman, L., Friedman, J.~H., Olshen, R.~A., \BBA\ Stone, C.~J. \BBOP1984\BBCP.
\newblock {\Bem Classification and Regression Trees}.
\newblock Wadsworth International, Belmont, Ca.

\bibitem[\protect\BCAY{Brodley}{Brodley}{1995}]{bro:asoscd}
Brodley, C.~E. \BBOP1995\BBCP.
\newblock \BBOQ Automatic selection of split criterion during tree growing
  based on node selection\BBCQ\
\newblock In {\Bem Proceedings of the Twelth International Conference on
  Machine Learning}, \BPGS\ 73--80\ Taho City, Ca. Morgan Kaufmann.

\bibitem[\protect\BCAY{Bunge}{Bunge}{1963}]{bun:tmos}
Bunge, M. \BBOP1963\BBCP.
\newblock {\Bem The Myth of Simplicity}.
\newblock Prentice-Hall, Englewood Cliffs, NJ.

\bibitem[\protect\BCAY{Clark \BBA\ Niblett}{Clark \BBA\
  Niblett}{1989}]{cla:tcia}
Clark, P.\BBACOMMA\  \BBA\ Niblett, T. \BBOP1989\BBCP.
\newblock \BBOQ The {CN2} induction algorithm\BBCQ\
\newblock {\Bem Machine Learning}, {\Bem 3}, 261--284.

\bibitem[\protect\BCAY{Fayyad \BBA\ Irani}{Fayyad \BBA\
  Irani}{1990}]{fay:wsbmia}
Fayyad, U.~M.\BBACOMMA\  \BBA\ Irani, K.~B. \BBOP1990\BBCP.
\newblock \BBOQ What should be minimized in a decision tree?\
\newblock In {\Bem {AAAI}-90: {Proceedings} Eighth National Conference on
  Artificial Intelligence}, \BPGS\ 749--754\ Boston, Ma.

\bibitem[\protect\BCAY{Good}{Good}{1977}]{goo:eamtoe}
Good, I.~J. \BBOP1977\BBCP.
\newblock \BBOQ Explicativity: {A} mathematical theory of explanation with
  statistical applications\BBCQ\
\newblock {\Bem Proceedings of the Royal Society of London Series {A}}, {\Bem
  354}, 303--330.

\bibitem[\protect\BCAY{Holte}{Holte}{1993}]{hol:vscrpw}
Holte, R.~C. \BBOP1993\BBCP.
\newblock \BBOQ Very simple classification rules perform well on most commonly
  used datasets\BBCQ\
\newblock {\Bem Machine Learning}, {\Bem 11\/}(1), 63--90.

\bibitem[\protect\BCAY{Holte, Acker, \BBA\ Porter}{Holte
  et~al.}{1989}]{hol:clatpo}
Holte, R.~C., Acker, L.~E., \BBA\ Porter, B.~W. \BBOP1989\BBCP.
\newblock \BBOQ Concept learning and the problem of small disjuncts\BBCQ\
\newblock In {\Bem Proceedings of the Eleventh International Joint Conference
  on Artificial Intelligence}, \BPGS\ 813--818\ Detroit. Morgan Kaufmann.

\bibitem[\protect\BCAY{Lubinsky}{Lubinsky}{1995}]{lub:itpaco}
Lubinsky, D.~J. \BBOP1995\BBCP.
\newblock \BBOQ Increasing the performance and consistency of classification
  trees by using the accuracy criterion at the leaves\BBCQ\
\newblock In {\Bem Proceedings of the Twelth International Conference on
  Machine Learning}, \BPGS\ 371--377\ Taho City, Ca. Morgan Kaufmann.

\bibitem[\protect\BCAY{Michalski}{Michalski}{1984}]{mic:atamoi}
Michalski, R.~S. \BBOP1984\BBCP.
\newblock \BBOQ {A} theory and methodology of inductive learning\BBCQ\
\newblock In Michalski, R.~S., Carbonell, J.~G., \BBA\ Mitchell, T.~M.\BEDS,
  {\Bem Machine Learning: {An} Artificial Intelligence Approach}, \BPGS\
  83--129. Springer-Verlag, Berlin.

\bibitem[\protect\BCAY{Murphy}{Murphy}{1995}]{mur:aeaotb}
Murphy, P.~M. \BBOP1995\BBCP.
\newblock \BBOQ An empirical analysis of the benefit of decision tree size
  biases as a function of concept distribution\BBCQ\
\newblock \BTR\ 95-29, Department of Information and Computer Science,
  University of California, Irvine.

\bibitem[\protect\BCAY{Murphy \BBA\ Aha}{Murphy \BBA\ Aha}{1993}]{mur:uromld}
Murphy, P.~M.\BBACOMMA\  \BBA\ Aha, D.~W. \BBOP1993\BBCP.
\newblock \BBOQ {UCI} repository of machine learning databases\BBCQ\
\newblock [Machine-readable data repository]. University of California,
  Department of Information and Computer Science, Irvine, CA.

\bibitem[\protect\BCAY{Murphy \BBA\ Pazzani}{Murphy \BBA\
  Pazzani}{1994}]{mur:etdfae}
Murphy, P.~M.\BBACOMMA\  \BBA\ Pazzani, M.~J. \BBOP1994\BBCP.
\newblock \BBOQ Exploring the decision forest: {An} empirical investigation of
  {{O}}ccam's razor in decision tree induction\BBCQ\
\newblock {\Bem Journal of Artificial Intelligence Research}, {\Bem 1},
  257--275.

\bibitem[\protect\BCAY{Niblett \BBA\ Bratko}{Niblett \BBA\
  Bratko}{1986}]{nib:ldrind}
Niblett, T.\BBACOMMA\  \BBA\ Bratko, I. \BBOP1986\BBCP.
\newblock \BBOQ Learning decision rules in noisy domains\BBCQ\
\newblock In Bramer, M.~A.\BED, {\Bem Research and Development in Expert
  Systems {III}}, \BPGS\ 25--34. Cambridge University Press, Cambridge.

\bibitem[\protect\BCAY{Nock \BBA\ Gascuel}{Nock \BBA\ Gascuel}{1995}]{noc:oldc}
Nock, R.\BBACOMMA\  \BBA\ Gascuel, O. \BBOP1995\BBCP.
\newblock \BBOQ On learning decision committees\BBCQ\
\newblock In {\Bem Proceedings of the Twelth International Conference on
  Machine Learning}, \BPGS\ 413--420\ Taho City, Ca. Morgan Kaufmann.

\bibitem[\protect\BCAY{Oliver \BBA\ Hand}{Oliver \BBA\ Hand}{1995}]{oli:opaadt}
Oliver, J.~J.\BBACOMMA\  \BBA\ Hand, D.~J. \BBOP1995\BBCP.
\newblock \BBOQ On pruning and averaging decision trees\BBCQ\
\newblock In {\Bem Proceedings of the Twelth International Conference on
  Machine Learning}, \BPGS\ 430--437\ Taho City, Ca. Morgan Kaufmann.

\bibitem[\protect\BCAY{Pearl}{Pearl}{1978}]{pea:otcbtc}
Pearl, J. \BBOP1978\BBCP.
\newblock \BBOQ On the connection between the complexity and credibility of
  inferred models\BBCQ\
\newblock {\Bem International Journal of General Systems}, {\Bem 4}, 255--264.

\bibitem[\protect\BCAY{Quinlan}{Quinlan}{1986}]{qui:iodt}
Quinlan, J.~R. \BBOP1986\BBCP.
\newblock \BBOQ Induction of decision trees\BBCQ\
\newblock {\Bem Machine Learning}, {\Bem 1}, 81--106.

\bibitem[\protect\BCAY{Quinlan}{Quinlan}{1990}]{qui:lldfr}
Quinlan, J.~R. \BBOP1990\BBCP.
\newblock \BBOQ Learning logical definitions from relations\BBCQ\
\newblock {\Bem Machine Learning}, {\Bem 5}, 239--266.

\bibitem[\protect\BCAY{Quinlan}{Quinlan}{1991}]{qui:ieftao}
Quinlan, J.~R. \BBOP1991\BBCP.
\newblock \BBOQ Improved estimates for the accuracy of small disjuncts\BBCQ\
\newblock {\Bem Machine Learning}, {\Bem 6}, 93--98.

\bibitem[\protect\BCAY{Quinlan}{Quinlan}{1993}]{qui:cpfml}
Quinlan, J.~R. \BBOP1993\BBCP.
\newblock {\Bem {C}4.{5}: {Programs} For Machine Learning}.
\newblock Morgan Kaufmann, Los Altos.

\bibitem[\protect\BCAY{Rao, Gordon, \BBA\ Spears}{Rao
  et~al.}{1995}]{rao:fegait}
Rao, R.~B., Gordon, D., \BBA\ Spears, W. \BBOP1995\BBCP.
\newblock \BBOQ For every generalization action is there really an equal and
  opposite reaction? Analysis of the conservation law for generalization
  performance\BBCQ\
\newblock In {\Bem Proceedings of the Twelth International Conference on
  Machine Learning}, \BPGS\ 471--479\ Taho City, Ca. Morgan Kaufmann.

\bibitem[\protect\BCAY{Rendell \BBA\ Seshu}{Rendell \BBA\
  Seshu}{1990}]{ren:lhctci}
Rendell, L.\BBACOMMA\  \BBA\ Seshu, R. \BBOP1990\BBCP.
\newblock \BBOQ Learning hard concepts through constructive induction:
  {Framework} and rationale\BBCQ\
\newblock {\Bem Computational Intelligence}, {\Bem 6}, 247--270.

\bibitem[\protect\BCAY{Rissanen}{Rissanen}{1983}]{ris:aupfia}
Rissanen, J. \BBOP1983\BBCP.
\newblock \BBOQ {A} universal prior for integers and estimation by minimum
  description length\BBCQ\
\newblock {\Bem Annals of Statistics}, {\Bem 11}, 416--431.

\bibitem[\protect\BCAY{Rissanen}{Rissanen}{1987}]{ris:sc}
Rissanen, J. \BBOP1987\BBCP.
\newblock \BBOQ Stochastic complexity\BBCQ\
\newblock {\Bem Journal of the Royal Statistical Society Series {B}}, {\Bem
  49\/}(3), 223--239.

\bibitem[\protect\BCAY{Schaffer}{Schaffer}{1992}]{sch:sdateo}
Schaffer, C. \BBOP1992\BBCP.
\newblock \BBOQ Sparse data and the effect of overfitting avoidance in decision
  tree induction\BBCQ\
\newblock In {\Bem {AAAI}-92: {Proceedings} of the Tenth National Conference on
  Artificial Intelligence}, \BPGS\ 147--152\ San Jose, CA. AAAI Press.

\bibitem[\protect\BCAY{Schaffer}{Schaffer}{1993}]{sch:oaab}
Schaffer, C. \BBOP1993\BBCP.
\newblock \BBOQ Overfitting avoidance as bias\BBCQ\
\newblock {\Bem Machine Learning}, {\Bem 10}, 153--178.

\bibitem[\protect\BCAY{Schaffer}{Schaffer}{1994}]{sch:aclfgp}
Schaffer, C. \BBOP1994\BBCP.
\newblock \BBOQ {A} conservation law for generalization performance\BBCQ\
\newblock In {\Bem Proceedings of the 1994 International Conference on Machine
  Learning}\ San Mateo, Ca. Morgan Kaufmann.

\bibitem[\protect\BCAY{Ting}{Ting}{1994}]{tin:tposdi}
Ting, K.~M. \BBOP1994\BBCP.
\newblock \BBOQ The problem of small disjuncts: {Its} remedy in decision
  trees\BBCQ\
\newblock In {\Bem Proceedings of the Tenth Canadian Conference on Artificial
  Intelligence}, \BPGS\ 63--70. Morgan Kaufmann,.

\bibitem[\protect\BCAY{Wallace \BBA\ Boulton}{Wallace \BBA\
  Boulton}{1968}]{wal:aimfc}
Wallace, C.~S.\BBACOMMA\  \BBA\ Boulton, D.~M. \BBOP1968\BBCP.
\newblock \BBOQ An information measure for classification\BBCQ\
\newblock {\Bem Computer Journal}, {\Bem 11}, 185--194.

\bibitem[\protect\BCAY{Wallace \BBA\ Freeman}{Wallace \BBA\
  Freeman}{1987}]{wal:eaibcc}
Wallace, C.~S.\BBACOMMA\  \BBA\ Freeman, P.~R. \BBOP1987\BBCP.
\newblock \BBOQ Estimation and inference by compact coding\BBCQ\
\newblock {\Bem Journal of the Royal Statistical Society Series {B}}, {\Bem
  49\/}(3), 240--265.

\bibitem[\protect\BCAY{Webb}{Webb}{1994}]{web:gimstc}
Webb, G.~I. \BBOP1994\BBCP.
\newblock \BBOQ Generality is more significant than complexity: {Toward}
  alternatives to {{O}}ccam's razor\BBCQ\
\newblock In Zhang, C., Debenham, J., \BBA\ Lukose, D.\BEDS, {\Bem {AI'94} --
  Proceedings of the Seventh Australian Joint Conference on Artificial
  Intelligence}, \BPGS\ 60--67\ Armidale. World Scientific.

\end{thebibliography}
