= 27d567bc2d48d9f40e9ccc20ea370b15)
Alicorn comments on New "Best" comment sorting system - Less Wrong Discussion
You are viewing a comment permalink. View the original post to see all comments and the full post content.
= 783df68a0f980790206b9ea87794c5b6)
Loading…= b715d02e85f7b3b4ae65ca3d3e450868)
Subscribe to RSS Feed
Powered by Reddit
= f037147d6e6c911a85753b9abdedda8d)
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (20)
How do the "Best", "Popular", and "Top" algorithms work?
Ironically, it appears the new algorithm is frequentist.
Bayesian reformulations welcome.
Apologies — I should have taken reinforcement into account and noted that the new algorithm is probably still a lot better than the previous one.
This seems like a neat problem. Would it be hard to go from a python function that takes a set of comment upvote downvote counts and returns a ranking to a comment sorting option? If I don't know much about the reddit internals?
Also, would it be difficult to get a real dataset of comment counts from LW?
"Top" simply calculates the (number of upvotes - number of downvotes) and puts on top the comments that rank the highest this way.
I think "Popular" tries to favor comments that don't have many downvotes or something, I'm not sure.
"Best" apparently works by magic.
I think "Popular" adds weight to recent comments. This seems to be a much worse way of achieving what "Best" shoots for.
Not necessarily. Someone who has already seen the best comments and returns a while later to see what new but good comments have been posted may have a use for it.