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
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Guidelines and tips
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community
Ask the community for help and clear up your study doubts
University Rankings
Discover the best universities in your country according to Docsity users
Free resources
Our save-the-student-ebooks!
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
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
1 / 6
This page cannot be seen from the preview
Don't miss anything!
Related documents
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