4 Jun 2013 average   » (Observer)

Okay, we've all seen decentralized social media sites that suffer from a common problem: rapid elevation of a few posts due to a phenomenon caused by ordering content deterministically by highest rank (forming a positive feedback loop where the most popular items keep getting visibility and voted-on more than others) or due to screen size and "first post" phenomenon.

The solution is to use a non-arbitrary probabilistic ordering algorithm. This algorithm is shown on WardsWiki at ProbabilisticChooser for anyone who wants to use it for non-commercial applications.

Let me know if you use it! Cheers,


(Also, please vote me up and get me out of this [Observer] hell!)

Latest blog entries     Older blog entries

New Advogato Features

New HTML Parser: The long-awaited libxml2 based HTML parser code is live. It needs further work but already handles most markup better than the original parser.

Keep up with the latest Advogato features by reading the Advogato status blog.

If you're a C programmer with some spare time, take a look at the mod_virgule project page and help us with one of the tasks on the ToDo list!