Artificial Intelligence |
Dentro del libro
Resultados 1-3 de 72
Página 448
computer programs , e . g . , database systems , can be said to “ learn ” in this
sense , although most people would not call such simple storage learning .
However , many Al programs are able to improve their performance substantially
through ...
computer programs , e . g . , database systems , can be said to “ learn ” in this
sense , although most people would not call such simple storage learning .
However , many Al programs are able to improve their performance substantially
through ...
Página 483
For a critique of formal learning theory as well as some of the inductive
techniques described in Section 17 . 5 , see Amsterdam ( 1988 ) . 17 . 10 Neural
Net Learning and Genetic Learning The very first efforts in machine learning tried
to mimic ...
For a critique of formal learning theory as well as some of the inductive
techniques described in Section 17 . 5 , see Amsterdam ( 1988 ) . 17 . 10 Neural
Net Learning and Genetic Learning The very first efforts in machine learning tried
to mimic ...
Página 484
Learning from examples - Initial state : collection of positive and negative
examples - Final state : concept description - Search algorithms : candidate
elimination , induction of decision trees • Learning in problem solving - Initial
state : solution ...
Learning from examples - Initial state : collection of positive and negative
examples - Final state : concept description - Search algorithms : candidate
elimination , induction of decision trees • Learning in problem solving - Initial
state : solution ...
Comentarios de la gente - Escribir un comentario
No encontramos ningún comentario en los lugares habituales.
Contenido
What Is Artificial Intelligence? | 3 |
Problems Problem Spaces and Search | 29 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 21 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
active addition agents algorithm allow answer apply approach assertions becomes belief build called Chapter clauses combined complete concept consider consistent constraints contains corresponding define dependency described discussed domain elements example fact Figure function given goal heuristic important initial input instance interpretation John kinds knowledge knowledge base labeled language learning logic look match meaning methods move natural necessary node object occur operators output particular path perform position possible predicate present problem procedure produce properties question reasoning relation represent representation result robot rules semantic sentence shown in Figure shows simple single situation slot solution solve space specific statements step stored structure Suppose task techniques things tree true understanding units usually variables weights