Define: K-means clustering from Pro....

Tour Communities Teachers Enterprises

Help

Learning Communities > Social Networking > Programming Collective Intelligence flashcards

Flashcard (Front and Back)

Front (Question)

Define: K-means clustering

Back (Answer)

used to find k groups within a set of data

begins with k centroids placed randomly in data. The nearest points are assigned to each group. Then the centroids are moved to middle of points assigned to them and process is repeated.

Memory Work Out Sessions use brain research to accelerate and improve memorization. Automatically scheduled daily review drills ensure sure you don't forget.

or Find more than 100,000 other things to learn

Educators and Trainers:

Tour YoYoBrain's resources for learning and teaching

Previous Card

See the whole card set

Next Card

Current rating: 0.0/5
1
2
3
4
5

rated by 0 users

Comments:

Other flashcards from Programming Collective Intelligence
Define: Euclidean Distance Score What is the heirarchical clustering a... Define: dendogram Define: K-means clustering Define: Tanimoto coefficient Define technique: multidimensional s... Purpose of stemming algorithm Define: MLP network Define: simulated annealing optimiza... Define: naive Bayesian classifier Define: decision tree learning What is kNN for price finding algorithm What is cross validation when used in... Define: SVM algorithm