Thanks for the answers, actually I worked on a similar issue, increasing the diversity of top-N lists (http://link.springer.com/article/10.1007%2Fs10844-013-0252-9). Clustering-based approaches produce good results and they are very fast compared to some optimization based techniques. Also it turned out that introducing randomization (such as choosing random 20 items among the top 100 items) might decrease diversity if the diversity of the top-N lists is better than the diversity of a set of random items, which might sometimes be the case.
On Sun, Jan 26, 2014 at 8:49 PM, Ted Dunning <ted.dunn...@gmail.com> wrote: > On Sun, Jan 26, 2014 at 9:36 AM, Pat Ferrel <p...@occamsmachete.com> wrote: > >> I think I’ll leave dithering out until it goes live because it would seem >> to make the eyeball test easier. I doubt all these experiments will survive. >> > > With anti-flood if you turn the epsilon parameter to 1 (makes log(epsilon) > = 0), then no re-ordering is done. > > I like knobs that go to 11, but also have an "off" position.
