An analysis of NP-completeness in novelty and diversity ranking

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5766 LNCS, Issue , 2009, Pages 200-211

  Carterette, Ben ^a  

^a University of Delaware   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION TIME; EVALUATION MEASURES; INFORMATION NEED; NP COMPLETE; NP-COMPLETENESS; RETRIEVAL SYSTEMS;

COMPUTATIONAL COMPLEXITY; INFORMATION SERVICES; SEARCH ENGINES;

INFORMATION RETRIEVAL;

EID: 70350610820     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04417-5_18     Document Type: Conference Paper

References (14)

1. Agrawal, R., Gollapudi, S., Halverson, H., Ieong, S.: Diversifying search results. In: Proceedings of WSDM 2009, pp. 5-14 (2009)
2. Vee, E., Srivastava, U., Shanmugasundaram, J., Bhat, P., Amer-Yahia, S.: Efficient computation of diverse query results. In: Proceedings of ICDE 2008, pp. 228-236 (2008)
3. Clarke, C.L.A., Kolla, M., Cormack, G.V., Vechtomova, O., Ashkan, A., Büttcher, S., MacKinnon, I.: Novelty and diversity in information retrieval evaluation. In: Proceedings of SIGIR 2008, pp. 659-666 (2008)
4. Radlinski, F., Kleinberg, R., Joachims, T.: Learning diverse rankings with multi-armed bandits. In: Proceedings of ICML 2008, pp. 784-791 (2008)
5. Chen, H., Karger, D.R.: Less is more: Probabilistic models for retrieving fewer relevant documents. In: Proceedings of SIGIR 2006, pp. 429-436 (2006)
6. Zhai, C., Cohen, W.W., Lafferty, J.D.: Beyond independent relevance: Methods and evaluation metrics for subtopic retrieval. In: Proceedings of SIGIR 2003, pp. 10-17 (2003)
7. Carboneil, J.G., Goldstein, J.: The use of mmr, diversity-based reranking for reordering documents and producing summaries. In: Proceedings of SIGIR 1998, pp. 335-336 (1998)
8. Garey, M.R., Johnson, D.S.: Computers and Intractibility: A Guide to the Theory of NP-completeness. W.H. Freeman, New York (1979)
9. Jarvelin, K., Kekalainen, J.: Cumulated gain-based evaluation of ir techniques. ACM Trans. Inf. Syst. 20(4), 422-446 (2002)
10. Feige, U.: A threshold of In n for approximating set cover. Journal of the ACM 45(4), 634-652 (1998)
11. Robertson, S.E.: The probability ranking principle in information retrieval. Journal of Documentation 33, 294-304 (1977)
12. Goffman, W.: On relevance as a measure. Information Storage and Retrieval 2(3), 201-203 (1964)
13. Allan, J., Carterette, B., Lewis, J.: When will information retrieval be 'good enough?'. In: Proceedings of SIGIR 2005, pp. 433-440 (2005)
14. Zaman, A., Simberloff, D.: Random binary matrices in biogeographical ecologyinstituting a good neighbor policy. Environmental and Ecological Statistics 9, 405-421 (2002)