An In-Depth Study of Implicit Search Result Diversification

Abstract

In this paper, we present a novel Integer Linear Programming formulation (termed ILP4ID) for implicit search result diversification (SRD). The advantage is that the exact solution can be achieved, which enables us to investigate to what extent using the greedy strategy affects the performance of implicit SRD. Specifically, a series of experiments are conducted to empirically compare the state-of-the-art methods with the proposed approach. The experimental results show that: (1) The factors, such as different initial runs and the number of input documents, greatly affect the performance of diversification models. (2) ILP4ID can achieve substantially improved performance over the state-of-the-art methods in terms of standard diversity metrics.