Hello Tom,
what you describe seems like using hierarchical clustering and
plotting a dendrogram to me, even though only in the "visual" way, not
in the math behind the algorithms.
Are you looking for something like this?
https://rpubs.com/gaston/dendrograms
Just please note, that this is very far
I think that diana() or mona() in package cluster are what you are looking for.
The computational burdens of polythetic divisive clustering methods as they are
called are substantial so the available methods use shortcuts that should
provide good, but not necessarily optimal results.
--
On Fri, 28 Jul 2017, Tom D. Harray wrote:
Hello,
I have a question related to recursive partitioning, but I cannot find
an answer, likely because I don't know how to properly word my Google
search query.
I think you are looking for "divisive hierarchical clustering" which is
the more commo
Tom:
Recursive partitioning requires a response variable because splitting
criteria are based on node purity/homogeneity (by various criteria) of
the responses.
So why did you not just search on "clustering" (e.g. at rseek.org)?
And in particular, have you looked at the CRAN task view on clusteri
4 matches
Mail list logo
