|
Are any comparation and description available in this topic? |
|
There's a great comparison of basic algorithms on SEOMoz (http://www.seomoz.org/blog/reddit-stumbleupon-delicious-and-hacker-news-algorithms-exposed), but of course these all depends of the dynamics of your particular audience and what signals they are giving you to help you determine what's hot, as well as where your content is coming from. A more detailed and current example for hacker news specifically at: http://amix.dk/blog/post/19574 |
can you expand on what exactly do you mean by 'time decay in news ranking'? Do you mean how often you should check newswires for new stories?
No I mean how fast it should become less Hot. If rank function is r(news) = rank*decay(t) what is poplar choice of decay(t) and why.
I think it really depends on the dynamics you want to have for your website and the other factors involved in ranking news. Pretty much any weight scheme (1/t, 1/t^2, 1/log(t+1), exp(-t), exp(-t^2), etc) you can think of can be reasonable given specific context.