Saturday, May 11, 2013

Similarity Score Algorithms

As per my previous post, I am working through Programming Collection Intelligence the first couple algorithms described in this book are regarding finding a similarity score, the methods they work through are Euclidean Distance and the Pearson Correlation Coefficient. The Manhattan distance score is also mentioned but some what I could find it seems that it is just the sum of the (absolute) differences of their coordinates, instead of Math.pow 2 used in Euclidean distance.

I worked through this and wrote/found some java equivalents for future use:

Euclidean Distance:

Pearson Correlation Coefficient:


  1. It is very nice that you share this with us.

  2. Great post just what I was looking for.

  3. TreasureBox is operated by a group of young, passionate, and ambitious people that are working diligently towards the same goal - make your every dollar count, as we believe you deserve something better.
    tv stand nz
    bike stand nz

  4. Thanks for sharing this, I actually appreciate you taking the time to share with everybody.
    Best Data Science Course In Hyderabad

  5. I truly like your style of blogging. I added it to my prefer red’s blog webpage list and will return soon…

    Data Science Training in Hyderabad

  6. Cricut machine is an excellent cutting machine that can cut materials into attractive designs. Whether you want to create crafts for your home or sell them in a market, the Cricut machine is suitable for both purposes. visit pages cricut machines | cricut setup | cricut machines | cricut setup | cricut setup |


Popular Posts