|
Powered by
|
|
Section: All | News & Politics | Geek Stuff | Devel | Non-existent Life | Random | Food! | Life |
Mon, April 28, 2003
Cracked!
Okay, I think I just cracked the link scoring algorithm:
S(l) = D(l) * log(M) / log(N(l))
Where:
S(l) = score of link
D(l) = depth of link
M = number of occurences of most popular link
N(l) = number of occurrences of link n
So, if there's a link that you share with just a few other blogs, that link could get a score of perhaps 14, while the more popular links may only get a score of 2 or 3. I haven't implemented the actual scoring algorithm, but I did calculate log(n)s of a bunch of links and it looks very promising.
For anyone who cares, the solution was bloody obvious. I graphed the occurrence rate of all the links, and the graph looked a lot like stuff I saw a couple of years ago in calculus. So I tried to remember all the different things we did to those poor numbers (some of which I dare not mention in public) and came up with log().
Maybe I'll do my master's thesis on this. What? I have to get my B.S. first? Drats... I hate it when that happens. I guess they call it "BS" for a reason.
|
|
Ryo Chijiiwa
I'm a biologically Japanese, culturally American, Germany-raised, socially liberal, politically independent, gun-totin', code writin' dude. My life is currently sponsored by Google.
|
Posted Mon, April 28, 2003 19:18 by Michael Fagan http://www.faganfinder.com/me/
Sounds good. I agree with your comments on my comments. Linking to The Onion definitely says something about the blogger, and having an algorithm do it is probably the best way. Let's hope this one works well. You can look forward to my comments when you put it up :-)