s = .score interval = order = Math.log([s.abs(), ].max, )
    sign = s > s < - seconds = .created_at.to_i - (sign * order + seconds / interval).round def hot self # upvotes - downvotes 69000 # originally 45000 1 10 if 0 1.75 # originally 1 elsif 0 1.75 # originally -1 else 0 end self 1134028003 7 end I created a site where people can vote and submit projects they want me to build. It had 2 ranking modes, "top scoring" and "newest" Problems with "Top" and "New" This was fine when there was only a dozen projects, but as the list grew, two problems arose: In the "top scoring view", the top few projects were monopolizing views and votes. Most people just weren't reading down the page enough to see the other ideas. In the "newest" view, an idea only had a little time to be seen before it was buried by bad ideas or even spam. Also, spammy/bad ideas were invincible to downvotes by virtue of being new. I needed a middle ground that would show the top ideas while also allowing new ideas a chance in the spotlight. 'Hot' to the rescue I found reddit's Hot algorithm, translated it from Python to Ruby, and put it on the site. It was kind of working, but it seems like it was weighing "recency" too much and not weighing the project's score enough. I think Reddit has such high voting volumes that my site's small vote counts was barely moving the needle for their algorithm. I have no idea what I'm doing I don't know much math beyond basic algebra. I was pretty mystified by this seemingly simple algorithm, but I got help from an engineer friend. I found out that if I increased , I would amplify the effect of the score on the final ranking. And if I increased , I would the importance of a project's recency. sign interval decrease I tweaked the values, eyed the effect, tweaked again, and eventually settled on a setting that resulted in a satisfying blend of the best projects from both "Top Ranked" and "Newest" Hope this is useful/interesting :) Previously published on IndieHackers .

From Reddit's "Hot" ranking algorithm to my satisfying blend of "Top Ranked" and "New"

About Author

Comments

TOPICS

THIS ARTICLE WAS FEATURED IN

Related Stories

10 Things Everyone Should Know About Machine Learning

10 Repositories that Will Transform the Way You Approach Technical Interviews

10 (Free) Data Structure and Algorithm Courses Junior Developers Should Explore

10 Data Structure & Algorithms Books Every Programmer Should Read

The Noonification: How to Develop a DSL in Kotlin (12/12/2023)

13 Ways to Traverse a Tree: Recursion vs Iteration

10 Things Everyone Should Know About Machine Learning

10 Repositories that Will Transform the Way You Approach Technical Interviews

10 (Free) Data Structure and Algorithm Courses Junior Developers Should Explore

10 Data Structure & Algorithms Books Every Programmer Should Read

The Noonification: How to Develop a DSL in Kotlin (12/12/2023)

13 Ways to Traverse a Tree: Recursion vs Iteration

Light-Mode

Classic

Newspaper

Minty

Dark-Mode

Neon Noir

Minty

HN StartUps