1. Implement a subsampling ensemble in combination with a 1-nearest neighbor classifier. 5. Suppose you used a 1-nearest neighbor classifier in combination with an ensemble method, and you are guaranteed that each application gets you the correct answer for a test instance with 60% probability. What is the probability that you get the correct answer using a majority vote of three tries, each of which are guaranteed to be independent and identically distributed?
2. Suppose that a data set is sampled without replacement to create a bagged sample of the same size as the original data set. Show that he probability that a point will not be included in the re-sampled data set is given by 1/e, where e is the base of the natural logarithm.
