Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/3184558.3186955acmotherconferencesArticle/Chapter ViewAbstractPublication PagesthewebconfConference Proceedingsconference-collections
poster
Free access

Treating Each Intent Equally: The Equilibrium of IA-Select

Published: 23 April 2018 Publication History

Abstract

Diversifying search results to satisfy as many users' intentions as possible is NP-hard. Some research employs a pruned exhaustive search, and some uses a greedy approach. However, the objective function of the result diversification problem adopts the cascade assumption which assumes users' information needs will drop once their subtopic search intents are satisfied. As a result, the intent distribution of diversified results deviates from the actual distribution of user intentions, and each subtopic tends to be chosen equally. This phenomenon is unreasonable, especially when the original distribution of user intent is unbalanced. In this paper, we present empirical evidence of the diversification equilibrium by showing that the standard deviations of subtopic distribution approach zero.

References

[1]
Rakesh Agrawal, Sreenivas Gollapudi, Alan Halverson, and Samuel Ieong. 2009. Diversifying search results. In WSDM'09. ACM, 5--14.
[2]
Gabriele Capannini, Franco Maria Nardini, Raffaele Perego, and Fabrizio Silvestri. 2011. Efficient diversification of web search results. Proceedings of the VLDB Endowment Vol. 4, 7 (2011), 451--459.
[3]
Fei Chen, Yiqun Liu, Jian Li, Min Zhang, and Shaoping Ma. 2014. A Pruning Algorithm for Optimal Diversified Search WWW'14. ACM, 237--238.
[4]
Harr Chen and David R Karger. 2006. Less is more: Probabilistic models for retrieving fewer relevant documents SIGIR'06. 429--436.
[5]
George L Nemhauser, Laurence A Wolsey, and Marshall L Fisher. 1978. An analysis of approximations for maximizing submodular set functions - I. Mathematical Programming Vol. 14, 1 (1978), 265--294.
[6]
Rodrygo LT Santos, Craig Macdonald, and Iadh Ounis. 2012. On the role of novelty for search result diversification. Information Retrieval Vol. 15, 5 (2012), 478--502.

Cited By

View all
  • (2018)Beyond Greedy SearchProceedings of the 2018 ACM SIGIR International Conference on Theory of Information Retrieval10.1145/3234944.3234967(99-106)Online publication date: 10-Sep-2018

Index Terms

  1. Treating Each Intent Equally: The Equilibrium of IA-Select

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    WWW '18: Companion Proceedings of the The Web Conference 2018
    April 2018
    2023 pages
    ISBN:9781450356404
    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]

    Sponsors

    • IW3C2: International World Wide Web Conference Committee

    In-Cooperation

    Publisher

    International World Wide Web Conferences Steering Committee

    Republic and Canton of Geneva, Switzerland

    Publication History

    Published: 23 April 2018

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. diversified search
    2. heuristic algorithms
    3. subtopic retrieval

    Qualifiers

    • Poster

    Funding Sources

    • Natural Science Foundation of China
    • NIH
    • National Key Basic Research Program

    Conference

    WWW '18
    Sponsor:
    • IW3C2
    WWW '18: The Web Conference 2018
    April 23 - 27, 2018
    Lyon, France

    Acceptance Rates

    Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)75
    • Downloads (Last 6 weeks)14
    Reflects downloads up to 13 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2018)Beyond Greedy SearchProceedings of the 2018 ACM SIGIR International Conference on Theory of Information Retrieval10.1145/3234944.3234967(99-106)Online publication date: 10-Sep-2018

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    HTML Format

    View this article in HTML Format.

    HTML Format

    Login options

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media