Content & Structure Coverage : Extracting a Diverse Information Subset

Recent years have witnessed a rapid increase of online data volume and the growing challenge of information overload for Web use and applications, thus information diversity is of great importance to both providers and users of search services. Based on the proposed diversity evaluation measure (namely, information coverage), two heuristic methods with corresponding algorithms are designed upon the greedy submodular idea. First, this paper proposes the CovC S-Select algorithm, which possesses the characteristic of asymptotic optimality, to optimize information coverage by applying the strategy of simulated annealing. Then to accelerate the speed of CovC S-Select algorithm, its fast approximation called FastCovC S-Select has been introduced by utilizing the properties of information coverage. Furthermore, ample experiments have been conducted to show the effectiveness, efficiency and parameter robustness of proposed diversity-oriented extraction methods in this paper, along with comparative analyses revealing their performances advantageous over other related methods