How to sort rated content

If you are a web developer, or at least a webmaster, and if you have rateable content on your website, you probably almost once faced this common problem: how should I sort my content, using the collected rating data?

As a common problem, it has common but different solutions, most of which are wrong. We will analyse two cases: the up/down rating, and the 5-star rating.

Up/Down rating case

This is the simplest case. Everyone can positively or negatively rate the content. So, every content will have:

  • Np = number of positive ratings
  • Nn = number of negative ratings
Solution #1 (Definitely wrong)

The first attempt is: let’s use the raw difference between positive and negative ratings.

rating = Np - Nn

This is a fairly used approach, but still it is wrong. Suppose you have two items:

  1. Item 1 has 500 positive ratings and 200 negative ratings
  2. Item 2 has 150 positive ratings and 10 negative ratings

Just analysing the data you come to think that Item 2 is more appreciated by the public. But this algorithm will compute:

  1. Item 1 rating = 300
  2. Item 2 rating = 140

So, Item 1 is valued better than Item 2. This is not what we expected.

Solution #2 (Quite wrong)

This solution is widespread through the web. It consists on computing the arithmetic average score for each item.

score = Np / (Np + Nn) = Am (Arithmetic mean)

If we consider the same previous situation, we’ll have:

  1. Item 1 score = 500/700 = 71,43%
  2. Item 2 score = 150/160 = 93,75%

This result seems a little bit fairer. But let’s face this other situation:

  1. Item 1: Np = 90, Nn = 10, score = 90%
  2. Item 2: Np = 9, Nn = 1, score = 90%

The score is the same for the two items, even if we probably all think that the first item has a more precise valuation that the second.

Sadly, even with this second solution the results are too biased to be acceptable.

Solution #3 (best?)

If we wanted to computed a completely unbiased scoring, taking into account just the item’s ratings, we have to face some probabilistic mathematical aspect for the question.

What we are trying to do is the following: we want to compute the best estimation of the item’s real score considering that we can have a variable incertainty for the measures. The incertainty decreases when the number of ratings grows. Each rating contributes to the definition of the real score of the item, which is our unknown value, and with each new rating the estimated score gets closer to the real score.

The fundamental question is: “Given the amount of data that I have, what is the least scoring for the item that has a minimum 95% probability of being the real one?

So, welcome the Lower bound of Wilson score confidence interval for a Bernoulli parameter, that is to say:

The lower bound

The Wilson score confidence interval

In this formula, we have:

  • s = estimate of the real scoring
  • p = Np/(Np+Nn) = fraction of the positive ratings
  • z = z1-α/2 = the (1 – α/2) percentile of the standard normal distribution
  • n = Np + Nn = number of samples (ratings)

To get the lower bound for the estimate, we have to use the minus sign before the square root. If we want to get the 95 percentile, z will be equal to 1.96.

This formula has good results even for a very low number of available ratings, as well for a largely rated item. Its implementation is very simple too. A Ruby method implementation could be this one (warning: it requires the abscondment-statistics2 gem):

require 'statistics2'

def lower_bound_estimate(np, n, power)
    if n == 0 { return 0 }

    z = Statistics2.pnormaldist(1-power/2)
    p = (np/n).to_f
    (p + z*z/(2*n) - z * Math.sqrt((p*(1-p)+z*z/(4*n))/n))/(1+z*z/n)
end

 

5 star rating – General case

The previous 3 solutions are useful for up/down ratings, but poorely adapt for the more common 5 star rating approach. In this latter case we should find a solution that doesn’t cost too much in terms of computational time, is not too biased, and is rating-scale independent. That is, we have to find something that could adapt to the up/down case as well as to the 5 star case.

Solution #4 (a fair good compromise)

This solution is one currently used by IMDB to sort the top 250 rated titles. It is a Bayesian estimate of the score of the item. We have to define:

  • Am = arithmetic mean for the item
  • N = total number of votes
  • m = minimum number of votes for the item to be taken into account
  • ATm = arithmetic total mean when considering the collection of all the items

The Am parameter, for the simplest case, has to be computed as shown for Solution #2. For the 5 star case, we will use this formula:

Am = Σ(ratings) / N

Eg. if an item has 3 scores, let’s say 1, 4 and 5, Am will be: (1+4+5) / 3 = 3.33.

Using these parameters we define the weigthed scoring as follows:

Ws = (N / (N + m)) × Am + (m ÷ (N + m)) × ATm

We are answering this question: “What is the score of the item, given all the ratings I collected till now, for this item and for the others?” (= posterior expected value)

How does this work? Well, if we put m = 0 we will have Ws = Am, that’s what we just analysed in Solution #2. If we put m >> N or N ~= 0, we have Ws = ATm, that’s to say that every item’s scoring is equal to the global mean score.

Using a fair value for m, and that surely depends on the average number of rating per item (IMDB currently uses something around 3000), we will have that every item’s score will be biased around the global mean rating. Items that have few rating will have a weigthed rating very close to ATm, while items with lots or rating will tend to have Ws ~= Am.

This is actually an acceptable solution, since items with low number of rating will have a scoring that is coherent with the whole collection rating, avoiding the situation described in the last paragraph. But, still, this is a biased solution. The best amongst the biased solutions, I’d say.

Conclusions

Every problem has its own best solution. If you have the simplest up/down rating implementation, probably Solution #3 will be your best choise. For every other case I’d suggest to use an implementation of Solution #4, since it’s the one that performs best for various rating systems, and for low or high number of ratings.

374 thoughts on “How to sort rated content

  1. An impressive share! I have just forwarded this onto a coworker who had been conducting a little research on this.
    And he actually ordered me dinner due to the fact that I stumbled upon it
    for him… lol. So allow me to reword this…. Thanks for the meal!!
    But yeah, thanks for spending the time to
    talk about this matter here on your web site.

    My homepage :: DonnellHPaez

  2. I want to express my gratitude for your kind-heartedness for individuals who really want help on this important question. Your very own commitment to passing the message across had become remarkably insightful and has in every case allowed individuals like me to arrive at their objectives. Your personal insightful guide entails a great deal a person like me and even more to my office workers. Thank you; from everyone of us.

  3. I found myself extremely pleased to find out this site.
    I want to to thanks for ones time just for this wonderful read!!
    I definitely liked every amount of it and i have you
    ever saved to fav to look into new information on the website.

    Feel free to surf to my blog post … DungQHamrick

  4. Does your blog have a contact page? I’m having a tough time locating it but, I’d like to send you an email. I’ve got some suggestions for your blog you might be interested in hearing. Either way, great site and I look forward to seeing it develop over time.

  5. I simply needed to thank you so much yet again. I do not know the things that I could possibly have worked on without the entire creative concepts discussed by you concerning this subject. It absolutely was the alarming problem in my circumstances, but coming across this specialized way you resolved it made me to cry over joy. Now i am grateful for this help and as well , wish you comprehend what a great job you’re undertaking training many others thru your webpage. More than likely you haven’t come across any of us.

  6. It is the best time to make some plans for the future and it’s time to be happy. I have read this post and if I could I wish to suggest you some interesting things or advice. Perhaps you could write next articles referring to this article. I wish to read more things about it!

  7. Thanks a lot for providing individuals with such a splendid possiblity to read critical reviews from this site. It is often very fantastic and stuffed with a good time for me personally and my office peers to visit the blog not less than three times weekly to find out the latest issues you have got. Not to mention, I’m also certainly amazed with all the special advice you serve. Certain 3 areas in this posting are easily the most efficient I’ve had.

  8. I think this is one of the so much vital information for me. And i’m glad reading your article. However should observation on few basic things, The web site taste is great, the articles is in reality nice : D. Excellent job, cheers

  9. Fantastic goods on your part, man. I have bear in mind your stuff before and you’re just extremely great.
    I really like what you might have got here, really like what
    you might be stating and how where you happen to be saying it.
    You’re making it entertaining and you still care for to keep it sensible.
    I can’t wait to read far more by you. That may be actually a wonderful internet
    site.

    Here is my web blog :: ChinaHGaub

  10. Wow, incredible blog format! How long have you ever been running a blog for? you make running a blog glance easy. The overall look of your website is fantastic, as smartly as the content material!

Lascia un commento

Il tuo indirizzo email non sarà pubblicato. I campi obbligatori sono contrassegnati *