skip to main content
10.1145/2396761.2398709acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
poster

Evaluating reward and risk for vertical selection

Published:29 October 2012Publication History

ABSTRACT

The aggregation of search results from heterogeneous verticals (news, videos, blogs, etc) has become an important consideration in search. When aiming to select suitable verticals, from which items are selected to be shown along with the standard "ten blue links", there exists the potential to both help (selecting relevant verticals) and harm (selecting irrelevant verticals) the existing result set.

In this paper, we present an approach that considers both reward and risk within the task of vertical selection (VS). We propose a novel risk-aware VS evaluation metric that incorporates users' risk-levels and users' individual preference of verticals. Using the proposed metric, we present a detailed analysis of both reward and risk of current resource selection approaches within a multi-label classification framework. The results bring insights into the effectiveness and robustness of current vertical selection approaches.

References

  1. J. Arguello, F. Diaz, and J. Callan. Learning to aggregate vertical results into web search results. CIKM 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. J. Arguello, F. Diaz, and J. Callan. A methodology for evaluating aggregated search results. ECIR 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. J. Arguello, F. Diaz, J. Callan, and J.-F. Crespo. Sources of evidence for vertical selection. SIGIR 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. J. P. Callan, Z. Lu, and W. B. Croft. Searching distributed collections with inference networks. SIGIR, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. B. Carterette, E. Kanoulas, and E. Yilmaz. Simulating simple user behavior for system effectiveness evaluation. CIKM 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. S. Cronen-Townsend, Y. Zhou, and W.B. Croft. Predicting query performance. SIGIR, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. A. K. Ponnuswami, K. Pattabiraman, Q. Wu, R. Gilad-Bachrach, and T. Kanungo. On composition of a federated web search result page: using online users to provide pairwise preference for heterogeneous verticals. WSDM, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. J. Seo and B.W. Croft. Blog site search using resource selection. CIKM 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. M. Shokouhi. Central-Rank-Based Collection Selection in Uncooperative Distributed Information Retrieval. ECIR 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. L. Si and J. Callan. Relevant document distribution estimation method for resource selection. SIGIR 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. K. Zhou, R. Cummins, M. Lalmas, and J.M. Jose. Evaluating large-scale distributed vertical search. CIKM Workshop LSDS-IR 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. K. Zhou, R. Cummins, M. Halvey, M. Lalmas and J. M. Jose. Assessing and Predicting Vertical Intent for Web Queries. ECIR 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. K. Zhou, R. Cummins, M. Lalmas, and J.M. Jose. Evaluating aggregated search pages. SIGIR 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Evaluating reward and risk for vertical selection

    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
      CIKM '12: Proceedings of the 21st ACM international conference on Information and knowledge management
      October 2012
      2840 pages
      ISBN:9781450311564
      DOI:10.1145/2396761

      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: 29 October 2012

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • poster

      Acceptance Rates

      Overall Acceptance Rate1,861of8,427submissions,22%

      Upcoming Conference

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader