Skip to main content

Occam’s Razor

  • Reference work entry
  • First Online:
Encyclopedia of Machine Learning and Data Mining

Synonyms

Ockham’s Razor

Definition

Occam’s Razor is the maxim that “entities are not to be multiplied beyond necessity,” or as it is often interpreted in the modern context “of two hypotheses H and H’, both of which explain E, the simpler is to be preferred” (Good 1977)

Motivation and Background

Most attempts to learn a model from data confront the problem that there will be many models that are consistent with the data. In order to learn a single model, a choice must be made between the available models. The factors taken into account by a learner in choosing between models are called its learning biases (Mitchell 1980). A preference for simple models is a common learning bias and is embodied in many learning techniques including pruning, minimum message length, and minimum description length. Regularization is also sometimes viewed as an application of Occam’s razor.

Occam’s razor is an imperative, rather than a proposition. That is, it is neither true nor false. Rather, it is a call...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 699.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 949.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  • Blumer A, Ehrenfeucht A, Haussler D, Warmuth MK (1987) Occam’s razor. Inf Process Lett 24(6): 377–380

    Google Scholar 

  • Domingos P (1999) The role of Occam’s razor in knowledge discovery. Data Min Knowl Discov 3(4):409–425

    Google Scholar 

  • Good IJ (1977) Explicativity: a mathematical theory of explanation with statistical applications. Proc R Soc Lond Ser A 354:303–330

    Google Scholar 

  • Mitchell TM (1980) The need for biases in learning generalizations. Department of computer science, Technical report CBM-TR-117, Rutgers University

    Google Scholar 

  • Webb GI (1996) Further experimental evidence against the utility Of occams razor. J Artif Intell Res 4:397–417. AAAI Press, Menlo Park

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Geoffrey I. Webb .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Science+Business Media New York

About this entry

Cite this entry

Webb, G.I. (2017). Occam’s Razor. In: Sammut, C., Webb, G.I. (eds) Encyclopedia of Machine Learning and Data Mining. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-7687-1_614

Download citation

Publish with us

Policies and ethics