Occam's Two Razors: The Sharp and the Blunt

@inproceedings{Domingos1998OccamsTR,
  title={Occam's Two Razors: The Sharp and the Blunt},
  author={Pedro M. Domingos},
  booktitle={KDD},
  year={1998}
}
Occam's razor has been the subject of much controversy. This paper argues that this is partly because it has been interpreted in two quite different ways, the first of which (simplicity is a goal in itself) is essentially correct, while the second (simplicity leads to greater accuracy) is not. The paper reviews the large variety of theoretical arguments and empirical evidence for and against the "second razor," and concludes that the balance is strongly against it. In particular, it builds on… CONTINUE READING

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 60 CITATIONS

On the Use of Combining Rules in Relational Probability Trees

VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Process-Oriented Estimation of Generalization Error

VIEW 8 EXCERPTS
CITES METHODS, BACKGROUND & RESULTS

Utilization of domain-knowledge for simplicity and comprehensibility in predictive modeling of Alzheimer's disease

  • 2012 IEEE International Conference on Bioinformatics and Biomedicine Workshops
  • 2012
VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Process-oriented evaluation: The next step

VIEW 8 EXCERPTS
CITES BACKGROUND & METHODS

Minimum Entropy Rate Simplification of Stochastic Processes

  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • 2016
VIEW 1 EXCERPT
CITES BACKGROUND

Information (Stanford Encyclopedia of Philosophy)

  • 2015
VIEW 1 EXCERPT
CITES BACKGROUND

FILTER CITATIONS BY YEAR

1998
2017

CITATION STATISTICS

  • 5 Highly Influenced Citations

References

Publications referenced by this paper.
SHOWING 1-10 OF 43 REFERENCES

Efflcent apl)roximations for the marginal likelihood of Bayesian networks with hidden variables

D.
  • Machine LeaTwing 29:181-212.
  • 1997
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Learning from hints in neural networks

Yaser S. Abu-Mostafa
  • J. Complexity
  • 1990
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

Neural Networks for Pattern I~ecognition

C. M. Bishop
  • Oxford, UK: Oxford University Press.
  • 1995
VIEW 2 EXCERPTS
HIGHLY INFLUENTIAL

Overfitting avoidance

C. Schaffer
  • 1993
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Overfitting avoidance as bias

  • Machine Learning
  • 1993
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

A new metric - based approach to model selection

G. Schwarz
  • Proceedings of the Fourteenth National Conference on Artificial Intelligence , 552 - 558
  • 1997