High Quality
Open the downloaded document, and select print from the file menu (PDF reader required).
INTRODUCTION
TO
MACHINELEARNING
ANEARLYDRAFTOFAPROPOSED TEXTBOOK
NilsJ.Nilsson RoboticsLaboratory DepartmentofComputerScience StanfordUniversity Stanford,CA94305
e-mail:nilsson@cs.stanford.edu
December4,1996
Copyright c
1997NilsJ.Nilsson Thismaterialmaynotbecopied,reproduced,ordistributedwithoutthe writtenpermissionofthecopyrightholder.
Contents
1Preliminaries1
1.1Introduction
:::::::::::::::::::::::::::
1 1.1.1WhatisMachineLearning?
::::::::::::::
1 1.1.2WellspringsofMachineLearning
:::::::::::
3 1.1.3VarietiesofMachineLearning
:::::::::::::
5 1.2LearningInput-OutputFunctions
:::::::::::::::
6 1.2.1TypesofLearning
:::::::::::::::::::
6 1.2.2InputVectors
::::::::::::::::::::::
8 1.2.3Outputs
:::::::::::::::::::::::::
9 1.2.4TrainingRegimes
::::::::::::::::::::
9 1.2.5Noise
::::::::::::::::::::::::::
10 1.2.6PerformanceEvaluation
::::::::::::::::
10 1.3LearningRequiresBias
:::::::::::::::::::::
10 1.4SampleApplications
::::::::::::::::::::::
13 1.5Sources
:::::::::::::::::::::::::::::
14 1.6BibliographicalandHistoricalRemarks
:::::::::::
15
2BooleanFunctions17
2.1Representation
:::::::::::::::::::::::::
17 2.1.1BooleanAlgebra
::::::::::::::::::::
17 2.1.2DiagrammaticRepresentations
::::::::::::
18 2.2ClassesofBooleanFunctions
:::::::::::::::::
19 2.2.1TermsandClauses
:::::::::::::::::::
19 2.2.2DNFFunctions
:::::::::::::::::::::
20 i
2.2.3CNFFunctions
:::::::::::::::::::::
24 2.2.4DecisionLists
::::::::::::::::::::::
25 2.2.5SymmetricandVotingFunctions
:::::::::::
26 2.2.6LinearlySeparableFunctions
:::::::::::::
26 2.3Summary
::::::::::::::::::::::::::::
27 2.4BibliographicalandHistoricalRemarks
:::::::::::
28
3UsingVersionSpacesforLearning29
3.1VersionSpacesandMistakeBounds
:::::::::::::
29 3.2VersionGraphs
:::::::::::::::::::::::::
31 3.3LearningasSearchofaVersionSpace
::::::::::::
34 3.4TheCandidateEliminationMethod
:::::::::::::
35 3.5BibliographicalandHistoricalRemarks
:::::::::::
37
4NeuralNetworks39
4.1ThresholdLogicUnits
:::::::::::::::::::::
39 4.1.1DenitionsandGeometry
:::::::::::::::
39 4.1.2SpecialCasesofLinearlySeparableFunctions
::::
41 4.1.3Error-CorrectionTrainingofaTLU
:::::::::
42 4.1.4WeightSpace
::::::::::::::::::::::
45 4.1.5TheWidrow-HoProcedure
::::::::::::::
46 4.1.6TrainingaTLUonNon-Linearly-SeparableTraining Sets
:::::::::::::::::::::::::::
49 4.2LinearMachines
::::::::::::::::::::::::
50 4.3NetworksofTLUs
:::::::::::::::::::::::
51 4.3.1MotivationandExamples
:::::::::::::::
51 4.3.2Madalines
::::::::::::::::::::::::
54 4.3.3PiecewiseLinearMachines
:::::::::::::::
56 4.3.4CascadeNetworks
:::::::::::::::::::
57 4.4TrainingFeedforwardNetworksbyBackpropagation
::::
58 4.4.1Notation
:::::::::::::::::::::::::
58 4.4.2TheBackpropagationMethod
:::::::::::::
60 4.4.3ComputingWeightChangesintheFinalLayer
:::
62 4.4.4ComputingChangestotheWeightsinIntermediate Layers
::::::::::::::::::::::::::
64 ii
Add a Comment
This document has made it onto the Rising list!