{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T17:09:37Z","timestamp":1746551377703,"version":"3.38.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,12,14]],"date-time":"2010-12-14T00:00:00Z","timestamp":1292284800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,12,14]],"date-time":"2010-12-14T00:00:00Z","timestamp":1292284800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Inf Retrieval"],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1007\/s10791-010-9157-1","type":"journal-article","created":{"date-parts":[[2010,12,15]],"date-time":"2010-12-15T16:26:40Z","timestamp":1292430400000},"page":"89-106","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["An analysis of NP-completeness in novelty and diversity ranking"],"prefix":"10.1007","volume":"14","author":[{"given":"Ben","family":"Carterette","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,12,14]]},"reference":[{"key":"9157_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Gollapudi, S., Halverson, H., & Ieong, S. (2009). Diversifying search results. In Proceedings of the 2nd ACM international conference on web search and data mining (pp. 5\u201314).","DOI":"10.1145\/1498759.1498766"},{"key":"9157_CR18","doi-asserted-by":"crossref","unstructured":"Allan, J., Carterette, B., & Lewis, J. (2005). When will information retrieval be \u2019good enough?\u2019. In Proceedings of the 28th annual international ACM SIGIR conference on research and development in information retrieval (pp. 433\u2013440).","DOI":"10.1145\/1076034.1076109"},{"key":"9157_CR17","doi-asserted-by":"crossref","DOI":"10.1561\/9781933019970","volume-title":"Average-case complexity","author":"A. Bogdanov","year":"2006","unstructured":"Bogdanov, A., & Trevisan, L. (2006). Average-case complexity. Hanover, MA: Now Publishers Inc."},{"key":"9157_CR7","doi-asserted-by":"crossref","unstructured":"Carbonell, J. G., & Goldstein, J. (1998) The use of MMR, diversity-based reranking for reordering documents and producing summaries. In Proceedings of the 21st annual international ACM SIGIR conference on research and development in information retrieval (pp. 335\u2013336).","DOI":"10.1145\/290941.291025"},{"key":"9157_CR8","doi-asserted-by":"crossref","unstructured":"Carterette, B., & Chandar, P. (2009). Probabilistic models of novel document rankings for faceted topic retrieval. In Proceedings of the 18th ACM international conference on information and knowledge management.","DOI":"10.1145\/1645953.1646116"},{"key":"9157_CR5","doi-asserted-by":"crossref","unstructured":"Chen, H., & Karger, D. R. (2006). Less is more: Probabilistic models for retrieving fewer relevant documents. In Proceedings of the 29th annual international ACM SIGIR conference on research and development in information retrieval (pp. 429\u2013436).","DOI":"10.1145\/1148170.1148245"},{"key":"9157_CR9","doi-asserted-by":"crossref","unstructured":"Clarke, C. L., Craswell, N., & Soboroff, I. (2009a). Overview of the TREC 2009 web track. In Proceedings of the 18th text retrieval conference (TREC).","DOI":"10.6028\/NIST.SP.500-278.web-overview"},{"key":"9157_CR3","doi-asserted-by":"crossref","unstructured":"Clarke, C. L. A., Kolla, M., Cormack, G. V., Vechtomova, O., Ashkan, A., B\u00fcttcher, S., et al. (2008). Novelty and diversity in information retrieval evaluation. In Proceedings of the 31st annual international ACM SIGIR conference on research and development in information retrieval (pp. 659\u2013666).","DOI":"10.1145\/1390334.1390446"},{"key":"9157_CR12","doi-asserted-by":"crossref","unstructured":"Clarke, C. L., Kolla, M., & Vechtomova, O. (2009b). An effectiveness measure for ambiguous and underspecified queries. In Advances in information retrieval theory: Proceedings of the 2nd international conference on the theory of information retrieval (pp. 188\u2013199).","DOI":"10.1007\/978-3-642-04417-5_17"},{"issue":"4","key":"9157_CR13","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U. (1998). A threshold of ln n for approximating set cover. Journal of the ACM, 45(4),634\u2013652.","journal-title":"Journal of the ACM"},{"issue":"3","key":"9157_CR16","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0020-0271(64)90004-X","volume":"2","author":"W. Goffman","year":"1964","unstructured":"Goffman, W. (1964). On relevance as a measure. Information Storage and Retrieval, 2(3), 201\u2013203.","journal-title":"Information Storage and Retrieval"},{"issue":"4","key":"9157_CR10","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/582415.582418","volume":"20","author":"K. Jarvelin","year":"2002","unstructured":"Jarvelin, K., & Kekalainen, J. (2002). Cumulated gain-based evaluation of ir techniques. ACM Transactions on Information and Systems, 20(4), 422\u2013446.","journal-title":"ACM Transactions on Information and Systems"},{"key":"9157_CR21","doi-asserted-by":"crossref","unstructured":"Lenstra, J. K., Kan, A. H. G. R., & Brucker, P. (1977). Complexity of machine scheduling problems. In P. L. Hammer (Ed.), Studies in integer programming (Vol. 1). North Holland: Addison-Wesley.","DOI":"10.1016\/S0167-5060(08)70743-X"},{"key":"9157_CR15","unstructured":"Li, P., Burges, C. J., & Wu, Q. (2008). McRank: Learning to rank using multiple classification and gradient boosting. In Advances in neural information processing systems (Vol. 20, pp. 897\u2013904)."},{"key":"9157_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1416950.1416952","volume":"27","author":"A. Moffat","year":"2008","unstructured":"Moffat, A., & Zobel, J. (2008). Rank-biased precision for measurement of retrieval effectiveness. ACM Transactions on Information and Systems, 27, 1\u201327.","journal-title":"ACM Transactions on Information and Systems"},{"key":"9157_CR4","doi-asserted-by":"crossref","unstructured":"Radlinski, F., Kleinberg, R., & Joachims, T. (2008). Learning diverse rankings with multi-armed bandits. In Proceedings of the 25th international conference on machine learning (pp. 784\u2013791).","DOI":"10.1145\/1390156.1390255"},{"key":"9157_CR14","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1108\/eb026647","volume":"33","author":"S.E. Robertson","year":"1977","unstructured":"Robertson, S. E. (1977). The probability ranking principle in information retrieval. Journal of Documentation, 33, 294\u2013304.","journal-title":"Journal of Documentation"},{"key":"9157_CR2","doi-asserted-by":"crossref","unstructured":"Vee, E., Srivastava, U., Shanmugasundaram, J., Bhat, P., & Amer-Yahia, S. (2008). Efficient computation of diverse query results. In Proceedings of the 24th international conference on data engineering (pp. 228\u2013236).","DOI":"10.1109\/ICDE.2008.4497431"},{"key":"9157_CR19","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1023\/A:1020918807808","volume":"9","author":"A. Zaman","year":"2002","unstructured":"Zaman, A., & Simberloff, D. (2002). Random binary matrices in biogeographical ecology\u2014instituting a good neighbor policy. Environmental and Ecological Statistics, 9, 405\u2013421.","journal-title":"Environmental and Ecological Statistics"},{"key":"9157_CR6","doi-asserted-by":"crossref","unstructured":"Zhai, C., Cohen, W. W., & Lafferty, J. D. (2003). Beyond independent relevance: Methods and evaluation metrics for subtopic retrieval. In Proceedings of the 26th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (pp. 10\u201317).","DOI":"10.1145\/860435.860440"},{"key":"9157_CR20","volume-title":"Human behavior and the principle of least-effort","author":"G.K. Zipf","year":"1949","unstructured":"Zipf, G. K. (1949). Human behavior and the principle of least-effort. Cambridge, MA: Addison-Wesley."}],"container-title":["Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-010-9157-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10791-010-9157-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-010-9157-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-010-9157-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T21:07:07Z","timestamp":1740776827000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10791-010-9157-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,14]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,2]]}},"alternative-id":["9157"],"URL":"https:\/\/doi.org\/10.1007\/s10791-010-9157-1","relation":{},"ISSN":["1386-4564","1573-7659"],"issn-type":[{"type":"print","value":"1386-4564"},{"type":"electronic","value":"1573-7659"}],"subject":[],"published":{"date-parts":[[2010,12,14]]},"assertion":[{"value":"2 August 2010","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 August 2010","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 December 2010","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}