07-clustering

11262010 jure leskovec stanford c246 mining massive

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: cluster. age 11/26/2010 Jure Leskovec, Stanford C246: Mining Massive Datasets 42 h h h e e e e h h h h h h e e h e salary h e e e h h e Move points (say) 20% toward the centroid. age 11/26/2010 Jure Leskovec, Stanford C246: Mining Massive Datasets 43 Now, visit each point p in the data set. Place it in the “closest cluster.” Normal definition of “closest”: that cluster with the closest (to p ) among all the sample points of all the clusters. 11/26/2010 Jure Leskovec, Stanford C246: Mining Massive Datasets 44...
View Full Document

This document was uploaded on 02/26/2014 for the course CS 246 at Stanford.

Ask a homework question - tutors are online