Facilitating query decomposition in query language modeling by association rule mining using multiple sliding windows
Contribuinte(s) |
Macdonald, Craig Ounis, Iadh Plachouras, Vassilis Ruthven, Ian White, Ryen |
---|---|
Data(s) |
2008
|
Resumo |
This paper presents a novel framework to further advance the recent trend of using query decomposition and high-order term relationships in query language modeling, which takes into account terms implicitly associated with different subsets of query terms. Existing approaches, most remarkably the language model based on the Information Flow method are however unable to capture multiple levels of associations and also suffer from a high computational overhead. In this paper, we propose to compute association rules from pseudo feedback documents that are segmented into variable length chunks via multiple sliding windows of different sizes. Extensive experiments have been conducted on various TREC collections and our approach significantly outperforms a baseline Query Likelihood language model, the Relevance Model and the Information Flow model. |
Identificador | |
Publicador |
Springer Berlin Heidelberg |
Relação |
DOI:10.1007/978-3-540-78646-7_31 Song, Dawei, Huang, Qiang, Ruger, Stefan, & Bruza, Peter D. (2008) Facilitating query decomposition in query language modeling by association rule mining using multiple sliding windows. In Macdonald, Craig, Ounis, Iadh, Plachouras, Vassilis, Ruthven, Ian, & White, Ryen (Eds.) Advances in Information Retrieval. Springer Berlin Heidelberg, pp. 334-345. |
Fonte |
School of Information Systems; Science & Engineering Faculty |
Palavras-Chave | #Association rule #Term relationship #Query expansion #Document segmentation |
Tipo |
Book Chapter |