Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 8
Página 464
... version space algorithm , we should make some observa- tions about the representation . Some descriptions are more general than others . For example , the description in Figure 17.9 is more general than the one in Figure 17.7 . In fact ...
... version space algorithm , we should make some observa- tions about the representation . Some descriptions are more general than others . For example , the description in Figure 17.9 is more general than the one in Figure 17.7 . In fact ...
Página 468
... version space ( a space of candidate descrip- tions ) that can be translated roughly into English as : " The target concept may be as specific as ' Japanese , blue economy car , ' or as general as either ' blue car ' or ' economy car ...
... version space ( a space of candidate descrip- tions ) that can be translated roughly into English as : " The target concept may be as specific as ' Japanese , blue economy car , ' or as general as either ' blue car ' or ' economy car ...
Página 469
... version spaces have several deficiencies . One is the large space requirements of the exhaustive , breadth- first search mentioned above . Another is that inconsistent data , also called noise , can cause the candidate elimination ...
... version spaces have several deficiencies . One is the large space requirements of the exhaustive , breadth- first search mentioned above . Another is that inconsistent data , also called noise , can cause the candidate elimination ...
Contenido
Weak SlotandFiller Structures | 9 |
6 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 24 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
Abbott algorithm answer apply approach Artificial Intelligence assertions attributes axioms backpropagation backtracking backward backward reasoning belief best-first search breadth-first search Cabot Caesar Chapter clauses concept consider constraints contains contexts contradiction corresponding define depth-first depth-first search described discussed domain example explicitly fact given goal graph heuristic heuristic function Horn clauses important inference inheritance input instance interpretation justification knowledge base knowledge representation labeled learning logical assertions Marcus match move MYCIN node nonmonotonic reasoning object operators particular path perceptron possible preconditions predicate logic problem problem-solving procedure produce production system PROLOG propagation propositional logic question represent resolution result robot rules Section semantic semantic net sentence shown in Figure simple slot solution solve space specific statements step strategy structure Suppose suspect syntactic task techniques theorem things tree true truth maintenance system variables wff's