کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
515660 | 867059 | 2012 | 16 صفحه PDF | دانلود رایگان |

To address the inability of current ranking systems to support subtopic retrieval, two main post-processing techniques of search results have been investigated: clustering and diversification. In this paper we present a comparative study of their performance, using a set of complementary evaluation measures that can be applied to both partitions and ranked lists, and two specialized test collections focusing on broad and ambiguous queries, respectively. The main finding of our experiments is that diversification of top hits is more useful for quick coverage of distinct subtopics whereas clustering is better for full retrieval of single subtopics, with a better balance in performance achieved through generating multiple subsets of diverse search results. We also found that there is little scope for improvement over the search engine baseline unless we are interested in strict full-subtopic retrieval, and that search results clustering methods do not perform well on queries with low divergence subtopics, mainly due to the difficulty of generating discriminative cluster labels.
► Clustering and diversification can be compared within a single evaluation framework.
► Clustering and diversification cover complementary aspects of subtopic retrieval.
► Clustering is good for full subtopic retrieval.
► Diversification is good for partial subtopic coverage.
► Retrieval of minimal subsets achieves a better balance in performance.
Journal: Information Processing & Management - Volume 48, Issue 2, March 2012, Pages 358–373