Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas A revision of an established text for undergraduate and postgraduate Artificial Intelligence courses, this text incorporates the latest research and methods. |
Dentro del libro
Resultados 1-3 de 48
Página 464
... Concept " Japanese economy car " economy car . Now the learning problem is : Given a representation language such as in Figure 17.8 , and given positive and negative training examples such as those in Figure 17.7 , how can we produce a ...
... Concept " Japanese economy car " economy car . Now the learning problem is : Given a representation language such as in Figure 17.8 , and given positive and negative training examples such as those in Figure 17.7 , how can we produce a ...
Página 472
... Concept - A high - level description of what the program is supposed to learn • An Operationality Criterion - A description of which concepts are usable • A Domain Theory - A set of rules that describe relationships between objects and ...
... Concept - A high - level description of what the program is supposed to learn • An Operationality Criterion - A description of which concepts are usable • A Domain Theory - A set of rules that describe relationships between objects and ...
Página 476
... concept X are also examples of another concept Y , create a new concept representing the intersection of X and Y. • If very few examples of a concept X are found , then add to the agenda the task of finding a generalization of X. Figure ...
... concept X are also examples of another concept Y , create a new concept representing the intersection of X and Y. • If very few examples of a concept X are found , then add to the agenda the task of finding a generalization of X. Figure ...
Contenido
What Is Artificial Intelligence? | 3 |
5 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 25 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
Abbott agents algorithm answer apply approach ARMEMPTY assertions attributes axioms backpropagation backtracking backward belief best-first search breadth-first search Caesar called Chapter chess clauses complete concept conceptual dependency consider constraints contains contradiction corresponding define depth-first depth-first search described discussed domain example fact function game tree goal grammar graph heuristic Horn clauses important inference inheritance input instance interpretation isa links John justification knowledge base knowledge representation labeled learning Marcus match minimax move MYCIN natural language node object ON(B ON(C operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG represent result robot rules script Section semantic semantic net sentence shown in Figure simple slot solution solve specific step structure Suppose syntactic task techniques theorem things tree truth maintenance system understanding variables version space