In general, a dendrogram will connect the closest matches, reorder the set so they're consecutive entries in set X, and collapse these neighbors into a single composite entry and try again. Repeat until the size of set X or the distance between clusters achieves your desired threshold.
--
[ e d @ h a l l e y . c c ]
In reply to Re: Finding The Best Cluster Problem
by halley
in thread Finding The Best Cluster Problem
by neversaint
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |