Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with ward
Search options questions only
not deleted
user 253
Ward's method is one of "linkage rules" in hierarchical agglomerative cluster analysis. In Ward's method, those two clusters are chosen to merge at each step that would yield the lowest increase in error sum of squares.
7
votes
2
answers
9k
views
How does "ward" clustering (in R's hclust function) work?
A simple example:
plot(hclust(dist(c(1:3)),method = "ward"))
I would like to know which calculations (in R) can reproduce the distance of 3 from {1,2} to be
1.67
Thanks. …
- 21.9k