hi Claude, why you just dont calculate the distance between your values for calculating similarity? is that possible?<br><br><br><br>cheers<br><br><br>U.<br><br><br><div class="gmail_quote">2012/10/5 Jamie Bullock <span dir="ltr"><<a href="mailto:jamie@jamiebullock.com" target="_blank">jamie@jamiebullock.com</a>></span><br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div class="im"><br>
On 5 Oct 2012, at 10:20, Ed Kelly <<a href="mailto:morph_2016@yahoo.co.uk">morph_2016@yahoo.co.uk</a>> wrote:<br>
<br>
><br>
><br>
> There may be a way to use the simile algorithm (from ekext) that gives the matched-ness of two numbers based on an arbitrary window size, but it still might involve rolling your own. I have a feeling KNN is very efficient...<br>
> Ed<br>
><br>
<br>
</div>It's efficient, but there may still be room for optimisation in the implementation if that is a priority. It's also conceptually very simple, which is one reason I like it.<br>
<br>
best,<br>
<br>
Jamie<br>
<div class="HOEnZb"><div class="h5">_______________________________________________<br>
<a href="mailto:Pd-list@iem.at">Pd-list@iem.at</a> mailing list<br>
UNSUBSCRIBE and account-management -> <a href="http://lists.puredata.info/listinfo/pd-list" target="_blank">http://lists.puredata.info/listinfo/pd-list</a><br>
</div></div></blockquote></div><br>