ACM Home Page
Please provide us with feedback. Feedback
A latent variable model for query expansion using the hidden markov model
Full text PdfPdf (132 KB)
Source
Conference on Information and Knowledge Management archive
Proceeding of the 17th ACM conference on Information and knowledge management table of contents
Napa Valley, California, USA
POSTER SESSION: Poster session 2/information retrieval table of contents
Pages 1417-1418  
Year of Publication: 2008
ISBN:978-1-59593-991-3
Authors
Qiang Huang  The Open University, Milton Keynes, United Kingdom
Dawei Song  The Open University, Milton Keynes, United Kingdom
Sponsors
ACM: Association for Computing Machinery
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 15,   Downloads (12 Months): 83,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1458082.1458310
What is a DOI?

ABSTRACT

We propose a novel probabilistic method based on the Hidden Markov Model(HMM) to learn the structure of a Latent Variable Model (LVM) for query language modeling. In the proposed LVM, the combinations of query terms are viewed as the latent variables and the segmented chunks from the feedback documents are used as the observations given these latent variables. Our extensive experiments shows that our method significantly outperforms a number of strong baselines in terms of both effectiveness and robustness.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
 
4
 
5
D. Song, Q. Huang, S. Rueger, and P. Bruza. Facilitating query decomposition in query language modeling by association rule mining using multiple sliding windows. In Proceedings of ECIR'2008.