From: Rainer Thiel <lists@...>
Date: 2012-09-03T19:26:02+09:00
Subject: Re: Looking for patterns in a collection

Alex Gutteridge wrote in post #1074412:
> On 02.09.2012 23:52, Rainer Thiel wrote:
> A common distance metric for sets is the Jacquard distance
> (http://en.wikipedia.org/wiki/Jaccard_index). In your case each
> collection of executables is a set. Implementing it in Ruby is quite
> easy using the built in Array union and intersection operators:
>
Alex, many thanks for this. The Jaccard index looks like an answer. 
Thank you also for the worked example...

> Once you have calculated the distance between all machines in this way
> you can cluster them however you like. See
> (http://colinfdrake.com/2011/05/28/clustering-in-ruby.html) for an
> example of k-means clustering in Ruby. Another possibility is to
> generate a graph representation of your data and visualise with
> something like GraphViz (https://github.com/glejeune/Ruby-Graphviz/).

... and these further references.

Cheers, Rainer

-- 
Posted via http://www.ruby-forum.com/.