Maybe an upvote of a post could instead become an upvote of each (post, tag) tuple – e.g., (dDudLPHv7AgPLrzef, Building effective altruism), (dDudLPHv7AgPLrzef, Community), (dDudLPHv7AgPLrzef, Software engineering), (dDudLPHv7AgPLrzef, Public interest technology), etc. The final score of the post could then be calculated as (say) median of the quantiles of the scores of the (post, tag) tuples of the post.
This would make it hard for a post to reach any but a low quantile among Community-tagged posts but should make it easy for posts to reach a high quantile among niche posts.
It could introduce a bit of an incentive for people to mistag their posts with obscure tags and leave out common tags, but using the median should make this effect relatively mild. Plus anyone can add the common tags. One could also exclude tags with < 10 posts from the calculation, so some other suitable threshold.
I haven’t tested this, so it might not work at all!
Maybe an upvote of a post could instead become an upvote of each (post, tag) tuple – e.g., (
dDudLPHv7AgPLrzef
,Building effective altruism
), (dDudLPHv7AgPLrzef
,Community
), (dDudLPHv7AgPLrzef
,Software engineering
), (dDudLPHv7AgPLrzef
,Public interest technology
), etc. The final score of the post could then be calculated as (say) median of the quantiles of the scores of the (post, tag) tuples of the post.This would make it hard for a post to reach any but a low quantile among Community-tagged posts but should make it easy for posts to reach a high quantile among niche posts.
It could introduce a bit of an incentive for people to mistag their posts with obscure tags and leave out common tags, but using the median should make this effect relatively mild. Plus anyone can add the common tags. One could also exclude tags with < 10 posts from the calculation, so some other suitable threshold.
I haven’t tested this, so it might not work at all!
Maybe we should have a forum ranking algorithm hackathon 😅
Sure! If folks want to pick this up at the upcoming Hackathon, that’d be stellar.