A general optimization framework for smoothing language models on graph structures

Recent work on language models for information retrieval has shown that smoothing language models is crucial for achieving good retrieval performance. Many different effective smoothing methods have been proposed, which mostly implement various heuristics to exploit corpus structures. In this paper, we propose a general and unified optimization framework for smoothing language models on graph structures. This framework not only provides a unified formulation of the existing smoothing heuristics, but also serves as a road map for systematically exploring smoothing methods for language models. We follow this road map and derive several different instantiations of the framework. Some of the instantiations lead to novel smoothing methods. Empirical results show that all such instantiations are effective with some outperforming the state of the art smoothing methods. Categories and Subject Descriptors: H.3.3 [Information Search and Retrieval]: Retrieval Models General Terms: Algorithms

• Type: Journal
• Year: 2008
• Where: SIGIR
• Authors: Qiaozhu Mei, Duo Zhang, ChengXiang Zhai
• Keywords: Information Technology, Language Models, SIGIR 2008, Smoothing, Smoothing Methods