Re: Clustering algorithm Mathematica 7
- To: mathgroup at smc.vnet.net
- Subject: [mg129110] Re: Clustering algorithm Mathematica 7
- From: martin.lottner at gmail.com
- Date: Sun, 16 Dec 2012 01:06:24 -0500 (EST)
- Delivered-to: l-mathgroup@mail-archive0.wolfram.com
- Delivered-to: l-mathgroup@wolfram.com
- Delivered-to: mathgroup-newout@smc.vnet.net
- Delivered-to: mathgroup-newsend@smc.vnet.net
- References: <200911201139.GAA03443@smc.vnet.net> <he895k$q7k$1@smc.vnet.net>
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. 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? Thanks very much, Martin Martin Lottner Technische Universit=E4t M=FCnchen Department of Physics James-Franck-Str. 1 85748 Garching Germany
- Follow-Ups:
- Re: Clustering algorithm Mathematica 7
- From: Matthias Odisio <matthias@wolfram.com>
- Re: Clustering algorithm Mathematica 7