[closed] EM-Algorithm

-1

Can someone please draw me an approximate graph of log-likelihood as a function of number of iterations and another graph where log-likelihood is a function of number of clusters.

Thx in advance

k-means em-algorithm

asked Jan 28 at 18:45

Lopina
5●1●1●2

closed Jan 28 at 19:43

Alexandre Passos ♦
18997●44●214●335

FYI, you can probably generate this type of graph by going through the scikits.learn docs. There are similar types of graphs and a little work will finish the job for you.

(Jan 29 at 03:46) Robert Layton

The question has been closed for the following reason "Homework question" by Alexandre Passos Jan 28 at 19:43

One Answer:

oldest newest most voted

2	Looks like someone is passing off their assignment question here. Go hit the books! answered Jan 28 at 19:24 Delip Rao 650●2●8●10 I think the answer to that is in Bishop's (Jan 30 at 03:56) Leon Palafox

Subscription:

Once you sign in you will be able to subscribe for any updates here

Tags:

k-means ×19
em-algorithm ×2

Asked: Jan 28 at 18:45

Seen: 1,076 times

Last updated: Jan 30 at 03:56

[closed] EM-Algorithm

The question has been closed for the following reason "Homework question" by Alexandre Passos Jan 28 at 19:43

Subscription:

Related questions