Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
515199 | Information Processing & Management | 2007 | 13 Pages |
Abstract
The term mismatch problem in information retrieval is a critical problem, and several techniques have been developed, such as query expansion, cluster-based retrieval and dimensionality reduction to resolve this issue. Of these techniques, this paper performs an empirical study on query expansion and cluster-based retrieval. We examine the effect of using parsimony in query expansion and the effect of clustering algorithms in cluster-based retrieval. In addition, query expansion and cluster-based retrieval are compared, and their combinations are evaluated in terms of retrieval performance by performing experimentations on seven test collections of NTCIR and TREC.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science Applications
Authors
Seung-Hoon Na, In-Su Kang, Ji-Eun Roh, Jong-Hyeok Lee,