Learning Machines: Foundations of Trainable Pattern-classifying Systems

Etukansi
McGraw-Hill, 1965 - 137 sivua
0 Arvostelut
Arvosteluja ei vahvisteta, mutta Google tarkistaa ne valheellisen sisällön varalta ja poistaa tällaisen sisällön

Kirjan sisältä

 

Tulokset 1 - 3 kokonaismäärästä 30

Sivu 101
k weight vectors which are adjusted are those which have dot products closest to zero . ( Ties are resolved arbitrarily . ) These , in one sense , are the easiest to adjust . The adjustment is achieved by the familiar process of adding ...
Sivu 103
are adjusted as shown since they are the closest to the Y , pattern hyperplane ( they make the two least - negative ... we see that all of them ( hence , again , the majority ) are on the correct side ; thus , no adjustments are made .
Sivu 123
We shall describe the adjustments to be made at the kth step . Suppose that the ( k + 1 ) st ... Then , only this closest weight vector is adjusted and all other weight vectors ( including all those in the other banks ) are left fixed .

Missä on loput tästä teoksesta?

Mitä ihmiset sanovat - Kirjoita arvostelu

Yhtään arvostelua ei löytynyt.

Sisältö

I
1
SOME NONPARAMETRIC TRAINING METHODS
65
7
115
Tekijänoikeudet

2 muita osia ei näytetty

Muita painoksia - Näytä kaikki

Learning Machines: Foundations of Trainable Pattern-classifying Systems
Nils J. Nilsson
Otenäkymä - 1965
Learning Machines: Foundations of Trainable Pattern-classifying Systems
Nils J. Nilsson
Otenäkymä - 1965
Learning Machines: Foundations of Trainable Pattern-classifying Systems
Nils J. Nilsson
Otenäkymä - 1965
Näytä kaikki »

Yleiset termit ja lausekkeet

adjusted apply assume bank belonging to category called changes Chapter cluster committee components consider consists contains correction corresponding covariance decision surfaces define denote density depends derivation Development discriminant functions discussed distance distribution element equal error-correction estimates example exists expression FIGURE fixed given implemented important initial layered machine linear dichotomies linear machine linearly separable matrix measurements negative networks normal Note optimum origin parameters partition pattern classifier pattern hyperplane pattern space pattern vector piecewise linear plane points positive presented probability problem proof properties proved PWL machine quadric reduced regions respect response rule sample mean selection separable shown side solution space Stanford step Suppose theorem theory threshold training methods training procedure training sequence training subsets transformation values weight vectors zero

Viitteet tähän teokseen

Tietoja kirjailijasta (1965)

Nils John Nilsson was born in Saginaw, Michigan on February 6, 1933. He received a bachelor's degree and a Ph.D. in electrical engineering from Stanford University. He joined the Air Force and served three years at the Rome Air Development Center before joining the Stanford Research Institute in 1961. He helped develop the first general-purpose robot and was a co-inventor of algorithms that made it possible for the machine to move about efficiently and perform simple tasks. He later worked on the "Computer-based Consultant," which focused on natural language understanding. He wrote several books including Learning Machines: Foundations of Trainable Pattern-Classifying Systems and The Quest for Artificial Intelligence: A History of Ideas and Achievements. He died on April 21, 2019 at the age of 86.

Kirjaluettelon tiedot

QR code for Learning Machines
OtsikkoLearning Machines: Foundations of Trainable Pattern-classifying Systems
McGraw-Hill series in systems science
KirjoittajaNils J. Nilsson
Painoskuvitettu
KustantajaMcGraw-Hill, 1965
ISBN0070465703, 9780070465701
Pituus137 sivua
  
Vie sitaattiBiBTeX EndNote RefMan