– Matching algorithm

Hey folks
Since the GPLed dating platform code out there is crappy PHP work and not suited to help geeks meet each other either, I started designing a new matching algorithm in course of the rewrite of as a Ruby application.
Basically the idea is quite easy. First I travel the bipartite tree and cut it into subtrees matching the basic requirement of matching sexual orientation and this way saving CPU power by checking for bidirectional preferences.

Second step: I will then value additional attributes based on a two way connection and average the weight of every forth and back arrow.

For the example on the upper graphics that would mean: R=(((6+1)/2)+((3+4)/2)+0)/3=2.3
Illuminated! 😉

Another practical example: Let’s say I choose under “preferred editor” select that it’s absolutely important to me that my partner like vim too, then anyone who likes vim as well will be given 100 additional points when being weighted in our matching algorithm, and so all the vim using geek girls are listed first (followed by the emacs users ;-)).

I’m not quite done yet, but that’s where I’m going 🙂
Please gimme feedback.

One thought on “ – Matching algorithm”

  1. I think this algorithm doesn’t really give you a measure of concordance. What you want to be doing is something like minimizing sum of ABS(Rnx – Rny) or of the difference between Rnx/Rny and 1. I think.

Leave a Reply

Your email address will not be published. Required fields are marked *