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?
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.
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.