-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathREADME
executable file
·30 lines (18 loc) · 975 Bytes
/
README
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
README
======
I did it as a part of homework problem in the Machine Learning class taught by Prof Daniel Gildea (https://www.cs.rochester.edu/~gildea/) in Spring 2014. Here I implemented a Gaussian Mixture Model (GMM) Clustering using Expectation Maximization (EM) algorithm.
==========================================================================================================
Name: Md. Iftekhar Tanveer
Email: itanveer@cs.rochester.edu or mtanveer@z.rochester.edu
Course: CS446
Homework: EM algorithm
************** Files ***************
README: This document
progAss2.py: The original python script. Just run the file using python. The main function will automatically called.
voting2.dat: Dataset file
************* Algorithm ************
It is commented well in the code
************* Results **************
4 clusters. pictures attached
************* Interpretations *****
Max possible development likelihood falls if the number of cluster exceeds 4