skip to main content
10.1145/2983323.2983863acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
short-paper

Quantifying Query Ambiguity with Topic Distributions

Published:24 October 2016Publication History

ABSTRACT

Query ambiguity is a useful metric for search engines to understand users' intents. Existing methods quantify query ambiguity by calculating an entropy of clicks. These methods assign each click to a one-hot vector corresponding to some mutually exclusive groups. However, they cannot incorporate non-obvious structures such as similarity among documents. In this paper, we propose a new approach for quantifying query ambiguity using topic distributions. We show that it is a natural extension of an existing entropy-based method. Further, we use our approach to achieve topic-based extensions of major existing entropy-based methods. Through an evaluation using e-commerce search logs combined with human judgments, our approach successfully extended existing entropy-based methods and improved the quality of query ambiguity measurements.

References

  1. R. Artstein and M. Poesio. Inter-coder agreement for computational linguistics. Comput. Linguist., 34(4):555--596, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. P. N. Bennett, K. Svore, and S. T. Dumais. Classification-enhanced ranking. In Proceedings of WWW '10, pages 111--120, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. D. M. Blei, A. Y. Ng, and M. I. Jordan. Latent dirichlet allocation. J. Mach. Learn. Res., 3:993--1022, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. S. Cronen-Townsend and W. B. Croft. Quantifying query ambiguity. In Proceedings of HLT '02, pages 104--109, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Z. Dou, R. Song, and J.-R. Wen. A large-scale evaluation and analysis of personalized search strategies. In Proceedings of WWW '07, pages 581--590, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. H. Duan, E. Kiciman, and C. Zhai. Click patterns: An empirical representation of complex query intents. In Proceedings of CIKM '12, pages 1035--1044, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. E. Jones, T. Oliphant, P. Peterson, et al. SciPy: Open source scientific tools for Python, 2001--. {Online; accessed 2016-04--25}.Google ScholarGoogle Scholar
  8. T. Kudo, K. Yamamoto, and Y. Matsumoto. Applying conditional random fields to japanese morphological analysis. In Proceedings of EMNLP '04, pages 230--237, 2004.Google ScholarGoogle Scholar
  9. G. Qiu, K. Liu, J. Bu, C. Chen, and Z. Kang. Quantify query ambiguity using odp metadata. In Proceedings of SIGIR '07, pages 697--698, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. R.v Rehurek and P. Sojka. Software Framework for Topic Modelling with Large Corpora. In Proceedings of the LREC 2010 Workshop on New Challenges for NLP Frameworks, pages 45--50, 2010.Google ScholarGoogle Scholar
  11. R. L. Santos, C. Macdonald, and I. Ounis. Selectively diversifying web search results. In Proceedings of CIKM '10, pages 1179--1188, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. R. Song, Z. Luo, J.-R. Wen, Y. Yu, and H.-W. Hon. Identifying ambiguous queries in web search. In Proceedings of WWW '07, pages 1169--1170, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Y. Wang and E. Agichtein. Query ambiguity revisited: clickthrough measures for distinguishing informational and ambiguous queries. In Proceedings of HLT '10, pages 361--364, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Quantifying Query Ambiguity with Topic Distributions

      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 '16: Proceedings of the 25th ACM International on Conference on Information and Knowledge Management
        October 2016
        2566 pages
        ISBN:9781450340731
        DOI:10.1145/2983323

        Copyright © 2016 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 the author(s) 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: 24 October 2016

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • short-paper

        Acceptance Rates

        CIKM '16 Paper Acceptance Rate160of701submissions,23%Overall Acceptance Rate1,861of8,427submissions,22%

        Upcoming Conference

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader