IDA - Intelligent Data Analysis Research Group

BibTeX Entry

  file = {mlj.10b.pdf},
  category = {ida-publications},
  author = {Jan Zah{\'a}lka and Filip {\v Z}elezn{\'y}},
  title = {An Experimental Test of Occam's Razor in Classification (Technical note)},
  journal = {Machine Learning},
  volume = {83},
  number = {2},
  year = {2011},
  pages = {475-481},
  url = {},
  abstract = {A widely persisting interpretation of Occam’s razor is that given two classifiers with the same training error, the  simpler classifier is more likely to generalize better. Within a long-lasting debate in the machine learning community over Occam’s razor, Domingos (Data Min. Knowl. Discov. 3:409–425, 1999) rejects this interpretation and proposes that model complexity is only a confounding factor usually correlated with the number of models from which the learner selects. It is thus hypothesized that the risk of overfitting (poor generalization) follows only from the number of model tests rather than the complexity of the selected model. We test this hypothesis on 30 UCI data sets using polynomial classification models. The results confirm Domingos’ hypothesis on the 0.05 significance level and thus refutes the above interpretation of Occam’s razor. Our experiments however also illustrate that decoupling the two factors (model complexity and number of model tests) is problematic.},
  vvvs = {1},
  obory = {JC,JD},
  projnum = {13/100004/13133},

Creative Commons License  Content on this site is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Czech Republic License.