[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: K-Means Clustering
From: |
John Darrington |
Subject: |
Re: K-Means Clustering |
Date: |
Thu, 10 Mar 2011 11:55:12 +0000 |
User-agent: |
Mutt/1.5.18 (2008-05-17) |
On Wed, Mar 09, 2011 at 08:59:39PM -0800, Ben Pfaff wrote:
John Darrington <address@hidden> writes:
> Maybe Ben has some ideas how an efficient distance matrix can
> be implemented in PSPP (maybe sparse-array.c can help?) .
I don't yet see how sparse-array.c helps. (It's only a 1-D
array, for one thing.)
You're right. I was kinda just thinking (or not) aloud when I typed that.
J'
--
PGP Public key ID: 1024D/2DE827B3
fingerprint = 8797 A26D 0854 2EAB 0285 A290 8A67 719C 2DE8 27B3
See http://pgp.mit.edu or any PGP keyserver for public key.
signature.asc
Description: Digital signature
- K-Means Clustering, Mehmet Hakan Satman, 2011/03/08
- Re: K-Means Clustering, John Darrington, 2011/03/09
- Re: K-Means Clustering, Duane Currie, 2011/03/09
- Re: K-Means Clustering, Ben Pfaff, 2011/03/09
- Re: K-Means Clustering,
John Darrington <=
- Message not available
- Re: K-Means Clustering, John Darrington, 2011/03/10
- Re: K-Means Clustering, Mehmet Hakan Satman, 2011/03/10
- Re: K-Means Clustering, John Darrington, 2011/03/10
- Re: K-Means Clustering, Mehmet Hakan Satman, 2011/03/10
- Re: K-Means Clustering, Mehmet Hakan Satman, 2011/03/11
- Re: K-Means Clustering, John Darrington, 2011/03/12