Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

K means algorithm example, Thesis of Computer Science

ppt descibes about k means cluster algorithm. Pick a number (k) of cluster centers Assign every gene to its nearest cluster center Move each cluster center to the mean of its assigned genes Repeat 2-3 until convergence

Typology: Thesis

2017/2018

Uploaded on 01/30/2018

electronics-engineer
electronics-engineer 🇮🇳

1 document

1 / 6

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
K-means algorithm
1) Pick a number (k) of cluster centers
2) Assign every gene to its nearest cluster
center
3) Move each cluster center to the mean of
its assigned genes
4) Repeat 2-3 until convergence
Slides from Wash Univ. BIO5488 lecture, 2004
pf3
pf4
pf5

Partial preview of the text

Download K means algorithm example and more Thesis Computer Science in PDF only on Docsity!

K-means algorithm

1) Pick a number (k) of cluster centers

2) Assign every gene to its nearest cluster

center

3) Move each cluster center to the mean of

its assigned genes

4) Repeat 2-3 until convergence

Slides from Wash Univ. BIO5488 lecture, 2004

expression in condition 2

Algorithm: k-means, Distance Metric: Euclidean Distance

k 1 k 2 k 3

expression in condition 2

Algorithm: k-means, Distance Metric: Euclidean Distance

k

1

k

2

k

3

expression in condition 2

Algorithm: k-means, Distance Metric: Euclidean Distance

k

1

k

2

k

3