On Mon, 30 Dec 2002, [EMAIL PROTECTED] wrote:
> For example, take a set of songs, I'd like to be able to
> present them people, have them listen to one song, then compare that
> song to two (or more) other songs, then select the song that it most
> closely matches.
>
> From this, I'd
On Mon, Dec 30, 2002 at 03:11:24PM -0500, Larry Coffin wrote:
>
> Hey folks!
>
> I apologize that this is off topic, but I thought someone on here
> might know an answer or be able to point me in the direction of one.
>
> I'm looking for an algorithm for sorting/grouping sets
From: Larry Coffin <[EMAIL PROTECTED]>
Date: Mon, 30 Dec 2002 15:11:24 -0500
Hey folks!
I apologize that this is off topic, but I thought someone on here
might know an answer or be able to point me in the direction of one.
No more so than anyone else. ;-}
I'm rather rusty on graph theory, but I'm in a mood to take a whack at
this anyway...
Use any convenient data structure to represent your graph. The nodes
are the songs, the edges are the "relationships" between songs. You can
can model the relationships in several ways. Starting with song A
Hey folks!
I apologize that this is off topic, but I thought someone on here
might know an answer or be able to point me in the direction of one.
I'm looking for an algorithm for sorting/grouping sets of items
based on perception-based comparison.
For example,
5 matches
Mail list logo