Treating Each Intent Equally: The Equilibrium of IA-Select

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Wu, Y., Liu, Y., Zhou, K., Wang, X., Zhang, M., & Ma, S. (2018). Treating Each Intent Equally: The Equilibrium of IA-Select. In The Web Conference 2018 - Companion of the World Wide Web Conference, WWW 2018 (pp. 113–114). Association for Computing Machinery, Inc. https://doi.org/10.1145/3184558.3186955

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free