Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.soft-sys.math.mathematica > #12885
| From | Matthias Odisio <matthias@wolfram.com> |
|---|---|
| Newsgroups | comp.soft-sys.math.mathematica |
| Subject | Re: Clustering algorithm Mathematica 7 |
| Date | 2012-12-20 08:20 +0000 |
| Message-ID | <kauhot$irt$1@smc.vnet.net> (permalink) |
| References | <200911201139.GAA03443@smc.vnet.net> <he895k$q7k$1@smc.vnet.net> <20121216060625.83C4D6906@smc.vnet.net> |
| Organization | Time-Warner Telecom |
Hello,
On 12/16/12 12:06 AM, martin.lottner@gmail.com wrote:> Hi,
>
> I have started using the clustering methods in Mathematica 9 and
> I'd like to know whether the "FindClusters" function with the
> "optimization" method still uses k medoids in Version 9.
Yes it does.
> Could you please specify on which methods/publications the initial
> seed choice is based? (The documentation states that the algorithm
> "starts by building a set of k representative objects")
> What lies behind the "KMeans" option in ClusterComponents? Is this
> just an implementation of the naked k means algorithm with a
> random choice of initial seeds or is there some seed selection
> process involved as a first step?
I would think it's a random process. You can control it using the
"RandomSeed" (sub-) option:
FindClusters[l, n, Method -> {"Optimize", "RandomSeed" -> s}]
ClusteringComponents[l, n, "RandomSeed" -> s]
Would the bottom half of this tutorial provide more helpful information?
http://reference.wolfram.com/mathematica/tutorial/PartitioningDataIntoClusters.html
Matthias Odisio
Wolfram Research
Back to comp.soft-sys.math.mathematica | Previous | Next | Find similar | Unroll thread
Re: Clustering algorithm Mathematica 7 Matthias Odisio <matthias@wolfram.com> - 2012-12-20 08:20 +0000
csiph-web