Presentation is loading. Please wait.

Presentation is loading. Please wait.

Fuzzy C-mean (FCM) Clustering

Similar presentations


Presentation on theme: "Fuzzy C-mean (FCM) Clustering"— Presentation transcript:

1 Fuzzy C-mean (FCM) Clustering

2 The EM (Expectation Maximization) Algorithm
EM-Algoritma Expectation Step (E-step): menentukan pusat cluster secara random dan menghitung matrik partision sebagai fungsi keanggotaan Maximization Step (M-step): Memperbaiki pusat cluster sehingga jumlah jarak dari objek-objek terhadap pusat kluster yang baru dan hitunh SSE) 2

3 matrik partision

4

5

6 Fuzzy Clustering Using the EM Algorithm
Initially, let c1 = a and c2 = b 1st E-step: assign o to c1,w. wt = 1st M-step: recalculate the centroids according to the partition matrix, minimizing the sum of squared error (SSE) Iteratively calculate this until the cluster centers converge or the change is small enough

7


Download ppt "Fuzzy C-mean (FCM) Clustering"

Similar presentations


Ads by Google