An Analysis of NP-Completeness in Novelty and Diversity Ranking

Abstract. A useful ability for search engines is to be able to rank objects with novelty and diversity: the top k documents retrieved should cover possible interpretations of a query with some distribution, or should contain a diverse set of subtopics related to the user's information need, or contain nuggets of information with little redundancy. Evaluation measures have been introduced to measure the effectiveness of systems at this task, but these measures have worst-case NP-complete computation time. We use simulation to investigate the implications of this for optimization and evaluation of retrieval systems.

• Type: Journal
• Year: 2009
• Where: ICTIR
• Authors: Ben Carterette
• Keywords: Evaluation Measures, ICTIR 2009, Information Technology, Possible Interpretations, Worst-case Np-complete Computation