Your SlideShare is downloading. ×
0
coppin chapter 10e.ppt
coppin chapter 10e.ppt
coppin chapter 10e.ppt
coppin chapter 10e.ppt
coppin chapter 10e.ppt
coppin chapter 10e.ppt
coppin chapter 10e.ppt
coppin chapter 10e.ppt
coppin chapter 10e.ppt
coppin chapter 10e.ppt
coppin chapter 10e.ppt
coppin chapter 10e.ppt
coppin chapter 10e.ppt
coppin chapter 10e.ppt
coppin chapter 10e.ppt
coppin chapter 10e.ppt
coppin chapter 10e.ppt
coppin chapter 10e.ppt
coppin chapter 10e.ppt
coppin chapter 10e.ppt
coppin chapter 10e.ppt
coppin chapter 10e.ppt
coppin chapter 10e.ppt
coppin chapter 10e.ppt
coppin chapter 10e.ppt
coppin chapter 10e.ppt
coppin chapter 10e.ppt
Upcoming SlideShare
Loading in...5
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×
Saving this for later? Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime – even offline.
Text the download link to your phone
Standard text messaging rates apply

coppin chapter 10e.ppt

273

Published on

0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total Views
273
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
Downloads
4
Comments
0
Likes
0
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
No notes for slide

Transcript

  • 1. <ul><li>Chapter 10 </li></ul><ul><li>Introduction to Machine Learning </li></ul>
  • 2. Chapter 10 Contents (1) <ul><li>Training </li></ul><ul><li>Rote Learning </li></ul><ul><li>Concept Learning </li></ul><ul><li>Hypotheses </li></ul><ul><li>General to Specific Ordering </li></ul><ul><li>Version Spaces </li></ul><ul><li>Candidate Elimination </li></ul>
  • 3. Chapter 10 Contents (2) <ul><li>Inductive Bias </li></ul><ul><li>Decision Tree Induction </li></ul><ul><li>Overfitting </li></ul><ul><li>The Nearest Neighbor Algorithm </li></ul><ul><li>Neural Networks </li></ul><ul><li>Supervised Learning </li></ul><ul><li>Unsupervised Learning </li></ul><ul><li>Reinforcement Learning </li></ul>
  • 4. Training <ul><li>Learning problems usually involve classifying inputs into a set of of classifications. </li></ul><ul><li>Learning is only possible if there is a relationship between the data and the classifications. </li></ul><ul><li>Training involves providing the system with data which has been manually classified. </li></ul><ul><li>Learning systems use the training data to learn to classify unseen data. </li></ul>
  • 5. Rote Learning <ul><li>A very simple learning method. </li></ul><ul><li>Simply involves memorizing the classifications of the training data. </li></ul><ul><li>Can only classify previously seen data – unseen data cannot be classified by a rote learner. </li></ul>
  • 6. Concept Learning <ul><li>Concept learning involves determining a mapping from a set of input variables to a Boolean value. </li></ul><ul><li>Such methods are known as inductive learning methods. </li></ul><ul><li>If a function can be found which maps training data to correct classifications, then it will also work well for unseen data – hopefully! </li></ul><ul><li>This process is known as generalization. </li></ul>
  • 7. Hypotheses <ul><li>A hypothesis is a vector of variables: </li></ul><ul><ul><li>&lt;5, slow, red, 10, 100&gt; </li></ul></ul><ul><li>In concept learning, a training hypothesis is either a positive or negative (true or false). </li></ul><ul><li>A ? is used to indicate that any value will be suitable. </li></ul><ul><li>A Ø is used to indicate that no value will be suitable. </li></ul>
  • 8. Hypotheses - Example <ul><li>Each hypothesis represents a set of driving conditions. </li></ul><ul><li>If a hypothesis is positive, then it represents a safe scenario. </li></ul><ul><li>For example: </li></ul><ul><li>&lt;fast, rain, 10ft, 2, ?, ?&gt; </li></ul><ul><li>This represents the hypothesis that it is safe to drive fast in rain 10ft behind the next car having drunk 2 units of alcohol. </li></ul><ul><li>This would be a negative training example, as clearly it is not safe! </li></ul>
  • 9. General to Specific Ordering <ul><li>This hypothesis is the most general hypothesis. It represents the idea that it is safe to drive in any conditions: </li></ul><ul><li>h g = &lt;?, ?, ?, ?, ?, ?&gt; </li></ul><ul><li>The following hypothesis is the most specific hypothesis: it says it is not safe to drive in any conditions: </li></ul><ul><li>h s = &lt;Ø, Ø, Ø, Ø, Ø, Ø&gt; </li></ul><ul><li>We can define a partial order over the set of hypotheses: </li></ul><ul><ul><li>h 1 &gt; g h 2 </li></ul></ul><ul><li>This states that h 1 is more general than h 2 </li></ul><ul><li>One learning method is to determine the most specific hypothesis that matches all the training data. </li></ul>
  • 10. Partial Order (sort) <ul><li>H1 = &lt;?,?,?,?,evening,cold&gt; </li></ul><ul><li>H2 = &lt;medium, snow,?,?,?,?&gt; </li></ul><ul><li>Cannot be ordered, they have not relation </li></ul>
  • 11. More General Hypothesis <ul><li>&lt;slow, ?,?,?,?,?&gt; ≥ &lt;slow,?,?,?,?,cold&gt; </li></ul>
  • 12. Learning Algorithm <ul><li>Start with the most specific hypothesis, relaxing until a match is found. </li></ul><ul><li>&lt;0,0,0,0,0,0,0,0&gt; </li></ul><ul><li>Positive Training has </li></ul><ul><ul><li>&lt;slow,wind,30ft,0,evening,cold&gt; </li></ul></ul><ul><ul><li>&lt;slow rain,20ft,0,evening,warm&gt; </li></ul></ul><ul><ul><li>&lt;slow,snow,30ft,0,afternoon,cold&gt; </li></ul></ul><ul><li>Choose &lt;slow,wind,30ft,0,evening,cold&gt; </li></ul><ul><li>Match with &lt;slow rain,20ft,0,evening,warm&gt; yields </li></ul><ul><li>&lt;slow ?,?,0,evening,?&gt; </li></ul><ul><li>Match with &lt;slow,snow,30ft,0,afternoon,cold&gt; yields </li></ul><ul><li>&lt;slow,?,?,0,?,?&gt; -- hypothesis – it is safe to drive if one drives slowly and doesn’t drink </li></ul>
  • 13. Version Spaces <ul><li>A version space is the set of hypotheses that correctly map all the training data to their categories. </li></ul><ul><li>A simplistic learning method would be to start from a version space of all hypotheses and to systematically remove all the ones that do not match the training data. </li></ul><ul><li>Clearly this would not be an efficient learning method! </li></ul>
  • 14. Candidate Elimination <ul><li>Candidate elimination aims to derive one hypothesis which matches all training data. </li></ul><ul><li>We start with a set of the most general (h g ) and most specific (h s ) hypotheses. </li></ul><ul><li>As each item of training data is examined, the set of hypotheses are modified such that all hypotheses in h s and h g match the training data. </li></ul><ul><li>When finished with training, the remaining hypothesis should match unseen data. </li></ul>
  • 15. Inductive Bias <ul><li>All learning methods have an inductive bias. </li></ul><ul><li>The inductive bias of a learning method is the set of restrictions on the learning method. </li></ul><ul><li>Without inductive bias, a learning method could not learn to generalize. </li></ul><ul><li>Occam’s razor is an example of an inductive bias: The best hypothesis to select is the simplest one. </li></ul>
  • 16. Decision Tree Induction (1) <ul><li>A decision tree takes an input and gives a Boolean output. </li></ul><ul><li>A decision tree takes an input and gives a Boolean output. </li></ul><ul><li>Decision trees can represent more complex scenarios than version spaces. </li></ul>
  • 17. Decision Tree Induction (2) <ul><li>Decision tree induction involves creating a decision tree from a set of training data that can be used to correctly classify the training data. </li></ul><ul><li>ID3 is an example of a decision tree learning algorithm. </li></ul><ul><li>ID3 builds the decision tree from the top down, selecting the features from the training data that provide the most information at each stage. </li></ul><ul><li>http://www.dcs.napier.ac.uk/~peter/vldb/dm/node11.html </li></ul>
  • 18. Decision Tree Induction (3) <ul><li>ID3 selects attributes based on information gain. </li></ul><ul><li>Information gain is the reduction in entropy caused by a decision. </li></ul><ul><li>Entropy is defined as: </li></ul><ul><ul><li>H(S) = - p 1 log 2 p 1 - p 0 log 2 p 0 </li></ul></ul><ul><li>p 1 is the proportion of the training data which are positive examples </li></ul><ul><li>p 0 is the proportion which are negative examples </li></ul><ul><li>The entropy of S is zero when all the examples are positive, or when all the examples are negative. </li></ul><ul><li>The entropy reaches its maximum value of 1 when exactly half of the examples are positive, and half are negative. </li></ul>
  • 19. Values with greatest gain are placed near the top of the tree <ul><li>Considering example page 279 </li></ul><ul><ul><li>Country of origin 0.2756 </li></ul></ul><ul><ul><li>Big star 0.01 </li></ul></ul><ul><ul><li>Genre 0.17 </li></ul></ul>
  • 20. The Problem of Overfitting Black dots represent positive examples, white dots negative. The two lines represent two different hypotheses. In the first diagram, there are just a few items of training data, correctly classified by the hypothesis represented by the darker line. In the second and third diagrams we see the complete set of data, and that the simpler hypothesis which matched the training data less well matches the rest of the data better than the more complex hypothesis, which overfits.
  • 21. The Nearest Neighbor Algorithm (1) <ul><li>This is an example of instance based learning. </li></ul><ul><li>Instance based learning involves storing training data and using it to attempt to classify new data as it arrives. </li></ul><ul><li>The nearest neighbor algorithm works with data that consists of vectors of numeric attributes. </li></ul><ul><li>Each vector represents a point in n-dimensional space. </li></ul>
  • 22. The Nearest Neighbor Algorithm (2) <ul><li>When an unseen data item is to be classified, the Euclidean distance is calculated between this item and all training data. </li></ul><ul><li>the distance between &lt;x 1 , y 1 &gt; and &lt;x 2 , y 2 &gt; is: </li></ul><ul><li>The classification for the unseen data is usually selected as the one that is most common amongst the few nearest neighbors. </li></ul><ul><li>Shepard’s method involves allowing all training data to contribute to the classification with their contribution being proportional to their distance from the data item to be classified. </li></ul>
  • 23. Neural Networks (1) <ul><li>An neural network is a network of artificial neurons, which is based on the operation of the human brain. </li></ul><ul><li>Neural networks usually have their nodes arranged in layers. </li></ul><ul><li>One layer is the input layer, and another is an output layer. </li></ul><ul><li>There are one or more hidden layers between these two. </li></ul>
  • 24. Neural Networks (2) <ul><li>The connections between nodes have weights associated with them, which determine the behavior of the network. </li></ul><ul><li>Input data is applied to the input layer. </li></ul><ul><li>Neurons fire if their inputs are above a certain level. </li></ul><ul><li>If one neuron is connected to another the firing of one may cause the firing of the next. </li></ul>
  • 25. Supervised Learning <ul><li>Many neural networks use supervised learning. </li></ul><ul><li>Pre-classified training data is provided to the network before it is presented with unseen data. </li></ul><ul><li>The training data causes the weights in the network to be set to levels such that unseen data can be classified correctly. </li></ul><ul><li>Neural networks are able to learn to classify extremely complex functions. </li></ul>
  • 26. Unsupervised Learning <ul><li>Unsupervised learning networks learn without requiring human intervention. </li></ul><ul><li>No training data is required. </li></ul><ul><li>The system learns to cluster input data into a set of classifications that are not previously defined. </li></ul><ul><li>Example: Kohonen Maps. </li></ul>
  • 27. Reinforcement Learning <ul><li>Systems that learn using reinforcement learning are given a positive feedback when they classify data correctly, and negative feedback when they classify data incorrectly. </li></ul><ul><li>Credit assignment is needed to reward nodes in a network correctly. </li></ul>

×