Artificial Intelligence |
Dentro del libro
Resultados 1-3 de 65
Página 57
18 : A Search Tree for the Water Jug Problem in which they are performed can be
very important in determining the final output . It is possible that if x is added to y ,
a stable compound will be formed , so later addition of z will have no effect ; if z ...
18 : A Search Tree for the Water Jug Problem in which they are performed can be
very important in determining the final output . It is possible that if x is added to y ,
a stable compound will be formed , so later addition of z will have no effect ; if z ...
Página 58
One other issue we should consider at this point is that of search trees versus
search graphs . As mentioned above , we can think of production rules as
generating nodes in a search tree . Each node can be expanded in turn ,
generating a set ...
One other issue we should consider at this point is that of search trees versus
search graphs . As mentioned above , we can think of production rules as
generating nodes in a search tree . Each node can be expanded in turn ,
generating a set ...
Página 471
So how does ID3 actually construct decision trees ? Building a node means
choosing some attribute to test . At a given point in the tree , some attributes will
yield more information than others . For example , testing the attribute color is
useless ...
So how does ID3 actually construct decision trees ? Building a node means
choosing some attribute to test . At a given point in the tree , some attributes will
yield more information than others . For example , testing the attribute color is
useless ...
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