Produktbild
John Woodward

Program Induction, Complexity and Occam''s Razor

The Induction of Computable Functions, Modularity and No Free Lunch Theorems

Buch

Search is a broad machine learning method where solutions are generated and tested. We focus on evolving computable functions with genetic programming. The literature reveals the complexity of programs is small, indicating a limitation of current methods. No Free Lunch is not valid for machine learning as simpler functions are represented more frequently which is also related to Occam''s razor. We argue for Occam''s razor, not on grounds of simplicity but probability. The complexity of a function depends on the primitives available. If the representation can build new primitives, then the complexity is independent of the primitives. We giv… Mehr

CHF 80.00

Preise inkl. MwSt. und Versandkosten (Portofrei ab CHF 40.00)

Versandfertig innerhalb 1-3 Werktagen

Produktdetails


  • ISBN: 978-3-8383-8934-9
  • EAN: 9783838389349
  • Produktnummer: 37834652
  • Verlag: LAP Lambert Academic Publishing
  • Sprache: Englisch
  • Erscheinungsjahr: 2010
  • Seitenangabe: 156 S.
  • Masse: H22.0 cm x B15.0 cm x D0.9 cm 250 g
  • Abbildungen: Paperback
  • Gewicht: 250

Über den Autor


Search is a broad machine learning method. We show No Free Lunch is not valid for much of machine learning, and conversely argue why Occam''s Razor is valid. We prove results concerning the complexity of functions. Finally we examine the impact of representation, genetic operators and fitness function on genetic programming.

79 weitere Werke von John Woodward:


Bewertungen


0 von 0 Bewertungen

Geben Sie eine Bewertung ab!

Teilen Sie Ihre Erfahrungen mit dem Produkt mit anderen Kunden.