Current Slide

Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.

The EM (Expectation Maximization) Algorithm

  • The k-means algorithm has two steps at each iteration:
    • Expectation Step (E-step): Given the current cluster centers, each object is assigned to the cluster whose center is closest to the object: An object is expected to belong to the closest cluster
    • Maximization Step (M-step): Given the cluster assignment, for each cluster, the algorithm adjusts the center so that the sum of distance from the objects assigned to this cluster and the new center is minimized
  • The (EM) algorithm: A framework to approach maximum likelihood or maximum a posteriori estimates of parameters in statistical models.
    • E-step assigns objects to clusters according to the current fuzzy clustering or parameters of probabilistic clusters
    • M-step finds the new clustering or parameters that minimize the sum of squared error (SSE) or the expected likelihood

Speaker notes:

Content Tools


There are currently no sources for this slide.