Learning Machines: Foundations of Trainable Pattern-classifying Systems

Etukansi
McGraw-Hill, 1965 - 137 sivua
0 Arvostelut

Kirjan sisältä

 

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

Sivu 106
By partition we mean that the hyperplanes divide TLU 3 Origin TLU 2 TLU 3 TLU 1 TLU 2 TLU 1 ( a ) Pattern space ( b ) Image ... The necessity for partitioning the sets X1 and X2 arises because corresponding to each nonempty cell in the ...
Sivu 107
We know for example that it is necessary that these hyperplanes partition X , and X2 . A set of conditions that are both necessary and sufficient have not yet been found , but in the next section we shall state some sufficient ...
Sivu 108
partition with the property that if any one of the separating hyperplanes is removed , at least two nonempty cells will merge into one cell . Some examples of nonredundant and redundant partitions are shown in Fig . 6.8 .

Missä on loput tästä teoksesta?

Mitä ihmiset sanovat - Kirjoita arvostelu

Yhtään arvostelua ei löytynyt.

Sisältö

Preface vii
11
SOME NONPARAMETRIC TRAINING METHODS
65
APPENDIX
127
Tekijänoikeudet

1 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 decision surfaces define denote density depends derivation described discriminant functions discussed distance distribution element equal error-correction estimates example exists expression FIGURE fixed given implemented important initial known layered machine linear dichotomies linear machine linearly separable 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 space specific Stanford step Suppose theorem theory threshold training methods training patterns 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