skip to main content
10.1145/2124295.2124329acmconferencesArticle/Chapter ViewAbstractPublication PageswsdmConference Proceedingsconference-collections
research-article

Online selection of diverse results

Published:08 February 2012Publication History

ABSTRACT

The phenomenal growth in the volume of easily accessible information via various web-based services has made it essential for service providers to provide users with personalized representative summaries of such information. Further, online commercial services including social networking and micro-blogging websites, e-commerce portals, leisure and entertainment websites, etc. recommend interesting content to users that is simultaneously diverse on many different axes such as topic, geographic specificity, etc. The key algorithmic question in all these applications is the generation of a succinct, representative, and relevant summary from a large stream of data coming from a variety of sources. In this paper, we formally model this optimization problem, identify its key structural characteristics, and use these observations to design an extremely scalable and efficient algorithm. We analyze the algorithm using theoretical techniques to show that it always produces a nearly optimal solution. In addition, we perform large-scale experiments on both real-world and synthetically generated datasets, which confirm that our algorithm performs even better than its analytical guarantees in practice, and also outperforms other candidate algorithms for the problem by a wide margin.

Skip Supplemental Material Section

Supplemental Material

wsdm_day2_session1_3.mp4

References

  1. Rakesh Agrawal, Sreenivas Gollapudi, Alan Halverson, and Samuel Ieong. Diversifying search results. In WSDM, pages 5--14, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Nikhil Bansal and Maxim Sviridenko. The Santa Claus problem. In STOC, pages 31--40, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Jaime G. Carbonell and Jade Goldstein. The use of mmr, diversity-based reranking for reordering documents and producing summaries. In SIGIR, pages 335--336, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Nikhil R. Devanur, Kamal Jain, Balasubramanian Sivan, and Christopher A. Wilkens. Near optimal online algorithms and fast approximation algorithms for resource allocation problems. In ACM Conference on Electronic Commerce, pages 29--38, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Marina Drosou and Evaggelia Pitoura. Diversity over continuous data. IEEE Data Eng. Bull., 32(4):49--56, 2009.Google ScholarGoogle Scholar
  6. Marina Drosou and Evaggelia Pitoura. Search result diversification. SIGMOD Record, 39(1):41--47, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Khalid El-Arini, Gaurav Veda, Dafna Shahaf, and Carlos Guestrin. Turning down the noise in the blogosphere. In KDD, pages 289--298, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Sreenivas Gollapudi and Aneesh Sharma. An axiomatic approach for result diversification. In WWW, pages 381--390, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Sean M. McNee, John Riedl, and Joseph A. Konstan. Being accurate is not enough: how accuracy metrics have hurt recommender systems. In CHI Extended Abstracts, pages 1097--1101, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Filip Radlinski, Paul N. Bennett, Ben Carterette, and Thorsten Joachims. Redundancy, diversity and interdependent document relevance. SIGIR Forum, 43(2):46--52, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Rodrygo L. T. Santos, Craig Macdonald, and Iadh Ounis. Exploiting query reformulations for web search result diversification. In WWW, pages 881--890, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Rodrygo L. T. Santos, Craig Macdonald, and Iadh Ounis. Selectively diversifying web search results. In CIKM, pages 1179--1188, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Rodrygo L. T. Santos, Craig Macdonald, and Iadh Ounis. How diverse are web search results? In SIGIR, pages 1187--1188, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Rodrygo L. T. Santos, Craig Macdonald, and Iadh Ounis. Intent-aware search result diversification. In SIGIR, pages 595--604, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Aleksandrs Slivkins, Filip Radlinski, and Sreenivas Gollapudi. Learning optimally diverse rankings over large document collections. In ICML, pages 983--990, 2010.Google ScholarGoogle Scholar
  17. Erik Vee, Utkarsh Srivastava, Jayavel Shanmugasundaram, Prashant Bhat, and Sihem Amer-Yahia. Efficient computation of diverse query results. In ICDE, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Cong Yu, Laks V. S. Lakshmanan, and Sihem Amer-Yahia. It takes variety to make a world: diversification in recommender systems. In EDBT, pages 368--378, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Cong Yu, Laks V. S. Lakshmanan, and Sihem Amer-Yahia. Recommendation diversification using explanations. In ICDE, pages 1299--1302, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. ChengXiang Zhai and John D. Lafferty. A risk minimization framework for information retrieval. Inf. Process. Manage., 42(1):31--55, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Cai-Nicolas Ziegler, Sean M. McNee, Joseph A. Konstan, and Georg Lausen. Improving recommendation lists through topic diversification. In WWW, pages 22--32, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Online selection of diverse results

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        WSDM '12: Proceedings of the fifth ACM international conference on Web search and data mining
        February 2012
        792 pages
        ISBN:9781450307475
        DOI:10.1145/2124295

        Copyright © 2012 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 8 February 2012

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        Overall Acceptance Rate498of2,863submissions,17%

        Upcoming Conference

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader