[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: K-Means Clustering
|
From: |
Ben Pfaff |
|
Subject: |
Re: K-Means Clustering |
|
Date: |
Wed, 09 Mar 2011 20:59:39 -0800 |
|
User-agent: |
Gnus/5.13 (Gnus v5.13) Emacs/23.2 (gnu/linux) |
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 think that the nearest-neighbor problem is still a research
area. There are many algorithms to implement it and related
algorithms (e.g. approximate nearest neighbor). I have textbooks
that describe several of them.
I don't yet see how sparse-array.c helps. (It's only a 1-D
array, for one thing.)
--
Ben Pfaff
http://benpfaff.org
- 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 <=
- 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