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 23
Página 498
... weights , where the extra input xo is always set to 1 . 2. Initialize the weights ( wo , w1 , ... , wn ) to random real values . 3. Iterate through the training set , collecting all examples misclassified by the current set of weights ...
... weights , where the extra input xo is always set to 1 . 2. Initialize the weights ( wo , w1 , ... , wn ) to random real values . 3. Iterate through the training set , collecting all examples misclassified by the current set of weights ...
Página 504
... weights . The network adjusts its weights each time it sees an input - output pair . Each pair requires two stages : a forward pass and a backward pass . The forward pass involves presenting a sample input to the network and letting ...
... weights . The network adjusts its weights each time it sees an input - output pair . Each pair requires two stages : a forward pass and a backward pass . The forward pass involves presenting a sample input to the network and letting ...
Página 513
... weights on the input lines that lead to the single active output unit : Aw ; = n xj - n nw ; for all j = 1 , ... , n m where wj Xj is the weight on the connection from input unit j to the active output unit , is the value of the jth ...
... weights on the input lines that lead to the single active output unit : Aw ; = n xj - n nw ; for all j = 1 , ... , n m where wj Xj is the weight on the connection from input unit j to the active output unit , is the value of the jth ...
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