Flashcard (Front and Back)

Front (Question)

What is the heirarchical clustering algorithm

Back (Answer)

builds up a heirarchy by continuously merging the 2 most similar groups until only one is left



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      
App_store_badge
What's new | About Us | Privacy Policy | Copyright Policy | Contact Us

Copyright 2007-2025 YoYoBrain.com

Managed By W3mg