Propose new features
Designing Decidim together
Improve the score of comments
List of Endorsements
Report inappropriate content
Is this content inappropriate?
We use cookies to ensure the basic functionalities of the website and to enhance your online experience. You can choose for each category to opt-in/out whenever you want.
These cookies are essential for the proper functioning of my website. Without these cookies, the website would not work properly.
These cookies allow the website to remember the choices you have made in the past
Analytics cookies are cookies that track how users navigate and interact with a website. The information collected is used to help the website owner improve the website.
These cookies collect information about how you use the website, which pages you visited and which links you clicked on.
Designing Decidim together
The piece of text below is a shortened, hashed representation of this content. It's useful to ensure the content hasn't been tampered with, as a single modification would result in a totally different value.
Value:
729dab60f6843e977d94a20119df6dc48a5ff87694f7d87395283aebf35b449d
Source:
{"body":{"en":"The ranking of comments uses upvotes−downvotes. \r\n\r\nThanks to David Ruescas (nVotes), I found a blog post from 2009 remarking that this is a wrong strategy (http://www.evanmiller.org/how-not-to-sort-by-average-rating.html). For instance, a comment with 100 upvotes and 0 downvotes and a comment with 1000 upvotes and 900 downvotes would be equally scored. One could expect this would be solved using the average rating (upvotes/(upvotes+downvotes)), however, such strategy is also inappropriate because there will be many comments with few votes and, therefore, high uncertainty.\r\n\r\nTo solve the above problem, the blog post suggests using the lower bound of the Wilson score confidence interval. Please find the formula implemented in Ruby in the blog post, as well as this detailed explanation of why Reddit is using this method https://medium.com/hacking-and-gonzo/how-reddit-ranking-algorithms-work-ef111e33d0d9"},"title":{"en":"Improve the score of comments"}}
This fingerprint is calculated using a SHA256 hashing algorithm. In order to replicate it yourself, you can use an MD5 calculator online and copy-paste the source data.
<script src="https://meta.decidim.org/processes/roadmap/f/122/proposals/13043/embed.js"></script>
<noscript><iframe src="https://meta.decidim.org/processes/roadmap/f/122/proposals/13043/embed.html" frameborder="0" scrolling="vertical"></iframe></noscript>
Is this content inappropriate?
You need to enable all cookies in order to see this content.
Change cookie settings
3 comments
Loading comments ...
Add your comment
Sign in with your account or sign up to add your comment.
Loading comments ...