Incremental diversification for very large sets

Enrico Minack, Wolf Siberski, Wolfgang Nejdl · 2011

Result diversification is an effective method to reduce the risk that none of the returned results satisfies a user's query intention. It has been shown to decrease query abandonment substantially. On the other hand, computing an optimally diverse set is NP-hard for the usual objectives. Existing greedy diversification algorithms require random access to the input set, rendering them impractical in the context of large result sets or continuous data.

Read the paper · More papers on PaperTik