####
Computer Science 5751

Machine Learning

Homework Assignment 3 (20 points)

Due Tuesday, March 20, 2001

- Page 125, Exercise 4.9
- Page 152, Exercise 5.3
- The parity problem involves examining bit strings of length k and
answering yes if the string has on odd number of 1s and no if the
string has an even number of 1s. Explain why this problem is so
difficult to learn for an artificial neural network. Does you
reasoning hold for a decision tree as well? Is it possible to
use a K-nearest neighbor method to learn this problem?
- Page 270, Exercise 9.1