Message-ID: <18458777.152.1323416345921.JavaMail.geo-discussion-forums@yqiw17>
Date: 2011-12-09T07:39:05Z
From: Kerry
Subject: Help understanding cutree used for Dunn Index
In-Reply-To: <650af817-4436-4371-b765-c067ac3c574c@n10g2000vbg.googlegroups.com>
I found a way to draw rectangles around whatever cutree cuts, so I think I
now have a better idea, which is that it looks for the largest k distances
and cuts there, where k is the # clusters you want defined. Then, I assume
Dunn index uses the same defined #clusters to determine within vs. across
cluster similarities (i.e. distances).
If I'm way off please let me know, otherwise thanks for taking the time to
read my question.
kbrownk