Sample questions for midterm 2:

1. Briefly define the following terms:

   Single Point Crossover

   Two Point Crossover

   Uniform Crossover

   Point Mutation

   Inverted Deduction

   Unsupervised learning

   Clustering Algorithm

   Dendogram

   Control Learning

   Delayed Reward

   Discounted Future Reward

   Markov Decision Process

   Bayes Theorem

   Maximum a posteriori hypothesis

   Maximum likelihood hypothesis

   Bayes optimal classifier

   Gibbs classifier

   Bayes network

   PAC learning

   e-exhausting a Version Space

   Shattering a Set of Instances

   Vapnik-Chervonenkis Dimension

2. How are concepts represented in a genetic algorithm?  Give an example of
   of concept represented in a GA.

3. What operators are used in a genetic algorithm to produce new concepts?
   Give an example of a mechanism that can be used to judge a GA concept.

4. Give pseudo-code for a general genetic algorithm.  Make sure to outline
   the way concepts are represented, the operators used to create new
   concepts, how concepts are chosen to reproduce, and how concepts are
   evaluated.

5. Give two different mechanisms for selecting which members of a GA
   population should reproduce.  What are the advantages and disadvantages of
   your mechanisms?

6. How does genetic programming work?  How is a genetic program defined?
   What genetic operators can be applied to a genetic program?

7. How does the sequential covering algorithm work to generate a set of
   rules for a concept?

8. How does FOIL work to generate first-order logic rules for a concept?

9. What does it mean to view induction as inverted deduction?  Give a
    deduction rule and explain how that rule can be inverted to induce new
    rules.

10. What are the two main approaches for generating clusters?  Explain in
    general terms how these approaches work.

11. List two methods that could be used to estimate the validity of the
    results of a clustering algorithm.  Explain how these methods work.

12. Explain how the following clustering methods work:

    Agglomerative Single Link

    Agglomerative Complete Link

    K-Means

13. A distance measure is important both in memory-based reasoning methods
    such as the k-nearest neighbor method and in clustering.  Why is it so
    critical in these methods.  In which is it possible to "learn" to do
    a better job of measuring the distance between points?  Why?

14. Give pseudo-code for the learning cycle of a Q learner.  What is the
    update rule for a deterministic world?  How about a non-deterministic
    world?

15. How are the V(s) and Q(s,a) functions related in Q learning?  What are
    the advantages of using the Q function over the V function?

16. What is Bayes theorem?  Discuss two examples showing how Bayes theorem
    can be used to justify approaches to learning.  Also, discuss an example
    of a learning method based on Bayes theorem.

17. What is a Bayesian Belief network?  Give an example of such a network.
    What are the advantages of a Bayesian network over a naive Bayes learner?

18. What is a hybrid learning algorithm?  Give three examples of hybrid learning
   methods, explain how each works, and discuss the advantages of each.