Treating Each Intent Equally: The Equilibrium of IA-Select

  title={Treating Each Intent Equally: The Equilibrium of IA-Select},
  author={Yingying Wu and Yiqun Liu and Ke Zhou and Xiaochuan Wang and Min Zhang and Shaoping Ma},
  journal={Companion Proceedings of the The Web Conference 2018},
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… 

Figures and Tables from this paper

Beyond Greedy Search: Pruned Exhaustive Search for Diversified Result Ranking
The proposed pruned exhaustive search algorithm based on ordered pairs (PesOP) finds the optimal solution efficiently and decreases the computational cost while maintaining optimality.


A pruning algorithm for optimal diversified search
Experimental results indicate that the proposed algorithm can decrease the computation complexity of exhaustive search without any performance loss.
On the role of novelty for search result diversification
This paper thoroughly investigates the actual role of novelty for search result diversification, based upon the framework provided by the diversity task of the TREC 2009 and 2010 Web tracks, and demonstrates that, although inherently limited by the performance of the initial ranking, novelty plays a role at breaking the tie between similarly diverse results.
Diversifying search results
This work proposes an algorithm that well approximates this objective in general, and is provably optimal for a natural special case, and generalizes several classical IR metrics, including NDCG, MRR, and MAP, to explicitly account for the value of diversification.
Efficient Diversification of Web Search Results
A new methodology for detecting when, and how, query results need to be diversified, based on the concept of "query refinement" to estimate the probability of a query to be ambiguous is defined.
Less is more: probabilistic models for retrieving fewer relevant documents
This work considers a number of information retrieval metrics from the literature, including the rank of the first relevant result, the %no metric that penalizes a system only for retrieving no relevant results near the top, and the diversity of retrieved results when queries have multiple interpretations.
An analysis of approximations for maximizing submodular set functions—I
It is shown that a “greedy” heuristic always produces a solution whose value is at least 1 −[(K − 1/K]K times the optimal value, which can be achieved for eachK and has a limiting value of (e − 1)/e, where e is the base of the natural logarithm.
Diversifying search results. InWSDM’09
  • 2009