[SOLVED] 685.621 Algorithms for Data Science Homework 4

24.99 $

Programming resource
Digital learning resource
Category:
Practical programming resource
Suitable for guided study and reference
Tutor guidance available when needed

Description

5/5 - (2 votes)

 

Problems for Grading

  1. Problem 1 Note this is a Collaborative Problem
    • Points Total

In this problem, develop pseudocode and code for the Expectation Maximization method. This should be done for a generic number of clusters, at a minimum you should be able to handle 3 clusters to build a three class classifiers. Using the following data

x                                                                             (1)

for 5 iteration show the values for +1) using your code. You can either use a built in EM algorithm or the one you implement to show how well the clusters create the two separations as in slide 15 of the Expectation Maximization.pdf for the 5 iterations. In this example, are the clusters starting to converge? If no, why not? If yes, why?

  1. Problem 2 Note this is a Collaborative Problem

30 Points Total

Using the EM algorithm from Problem 1 the IRIS data set estimate the the unknown parameters µkk,pk.

  1. Problem 3
    • Points Total 15 Points Each

Consider three mean values of µ = [µ123] = [4.5,2.2,3.3] with a corresponding covariance matrix as follows:

(2)

The respective minimums are min = [3.5,1.7,2.5] and maximums are max = [5.5,2.7,4.1].

Generate 300 observations.

Using the EM algorithm from Problem 1 and the generated date estimate the the unknown parameters µkk,pk.

1

References

  • Bishop, Christopher M., Neural Networks for pattern Recognition, Oxford University Press, 1995
  • Bishop, Christopher M., Pattern Recognition and Machine Learning, Springer, 2006, https://www.microsoft.com/en-us/research/uploads/prod/2006/01/Bishop-Pattern-Recognitionand-Machine-Learning-2006.pdf
  • Duin, Robert P.W., Tax, David and Pekalska, Elzbieta, PRTools, http://prtools.tudelft.nl/
  • Dempster, A. P., Laird, N. M. and Rubin, D. B., Maximum likelihood from incomplete data via the EM algorithm, Journal of the Royal Statistical Society B, Volume 39, Number 1, pp.1–22, 1977
  • Franc, Vojtech and Hlavac, Vaclav, Statistical Pattern Recognition Toolbox, https://cmp.felk.cvut.cz/cmp/software/stprtool/index.html
  • Fukunaga, Keinosuke, Introduction to Statistical Pattern Recognition, Academic Press, 1972
  • Machine Learning at Waikato University, WEKA, https://www.cs.waikato.ac.nz/ ml/index.html
  • Tomasi, C., Estimating Gaussian Mixture Densities with EM – A Tutorial, Duke University

Course Notes, 2006, http://www.cs.duke.edu/courses/spring04/cps196.1/handouts/EM/tomasiEM.pdf, Retrieved Sept 2006

2

Resource details

Understand the Task Before You Use the Resource

Review the requirements, identify the programming concepts involved, study the implementation and test your understanding with your own examples and modifications.