mirror of
https://github.com/LemmyNet/lemmy.git
synced 2024-11-15 03:46:26 +00:00
30 lines
1.6 KiB
Markdown
30 lines
1.6 KiB
Markdown
# Trending / Hot / Best Sorting algorithm
|
|
## Goals
|
|
- During the day, new posts and comments should be near the top, so they can be voted on.
|
|
- After a day or so, the time factor should go away.
|
|
- Use a log scale, since votes tend to snowball, and so the first 10 votes are just as important as the next hundred.
|
|
|
|
## Reddit Sorting
|
|
[Reddit's comment sorting algorithm](https://medium.com/hacking-and-gonzo/how-reddit-ranking-algorithms-work-ef111e33d0d9), the wilson confidence sort, is inadequate, because it completely ignores time. What ends up happening, especially in smaller subreddits, is that the early comments end up getting upvoted, and newer comments stay at the bottom, never to be seen.
|
|
|
|
## Hacker News Sorting
|
|
The [Hacker New's ranking algorithm](https://medium.com/hacking-and-gonzo/how-hacker-news-ranking-algorithm-works-1d9b0cf2c08d) is great, but it doesn't use a log scale for the scores.
|
|
|
|
## My Algorithm
|
|
```
|
|
Rank = ScaleFactor * log(Max(1, 3 + Score)) / (Time + 2)^Gravity
|
|
|
|
Score = Upvotes - Downvotes
|
|
Time = time since submission (in hours)
|
|
Gravity = Decay gravity, 1.8 is default
|
|
```
|
|
|
|
- Use Max(1, score) to make sure all comments are affected by time decay.
|
|
- Add 3 to the score, so that everything that has less than 3 downvotes will seem new. Otherwise all new comments would stay at zero, near the bottom.
|
|
- The sign and abs of the score are necessary for dealing with the log of negative scores.
|
|
- A scale factor of 10k gets the rank in integer form.
|
|
|
|
A plot of rank over 24 hours, of scores of 1, 5, 10, 100, 1000, with a scale factor of 10k.
|
|
|
|
|