The Community for Technology Leaders
2008 Eighth IEEE International Conference on Data Mining (2008)
Dec. 15, 2008 to Dec. 19, 2008
ISSN: 1550-4786
ISBN: 978-0-7695-3502-9
pp: 1115-1120
Subspace learning techniques for text analysis, such as Latent Semantic Indexing (LSI), have been widely studied in the past decade. However, to our best knowledge, no previous study has leveraged the rank information for subspace learning in ranking tasks. In this paper, we propose a novel algorithm, called Learning Latent Semantics for Ranking (LLSR), to seek the optimal Latent Semantic Space tailored to the ranking tasks. We first present a dual explanation for the classical Latent Semantic Indexing (LSI) algorithm, namely learning the so-called Latent Semantic Space (LSS) to encode the data information. Then, to handle the increasing amount of training data for the practical ranking tasks, we propose a novel objective function to derive the optimal LSS for ranking. Experimental results on two SMART sub-collections and a TREC dataset show that LLSR effectively improves the ranking performance compared with the classical LSI algorithm and ranking without subspace learning.
Latent Semantic Space, Ranking

J. Yan, S. Yan, Z. Chen and N. Liu, "Learning the Latent Semantic Space for Ranking in Text Retrieval," 2008 Eighth IEEE International Conference on Data Mining(ICDM), vol. 00, no. , pp. 1115-1120, 2008.
93 ms
(Ver 3.3 (11022016))