MathGroup Archive 2012

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Clustering algorithm Mathematica 7

  • To: mathgroup at
  • Subject: [mg129195] Re: Clustering algorithm Mathematica 7
  • From: Matthias Odisio <matthias at>
  • Date: Thu, 20 Dec 2012 03:25:34 -0500 (EST)
  • Delivered-to:
  • Delivered-to:
  • Delivered-to:
  • Delivered-to:
  • References: <> <he895k$q7k$> <>


On 12/16/12 12:06 AM, martin.lottner at 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?

Matthias Odisio
Wolfram Research

  • Prev by Date: Re: Applying "Replace" to subsets of lists
  • Next by Date: Re: Plot[] will not plot functions when one of the functions in list
  • Previous by thread: Re: Clustering algorithm Mathematica 7
  • Next by thread: Mathematica strange behaviour finding a cubic root