Combination of document priors in web information retrieval

Peng, J. and Ounis, I. (2007) Combination of document priors in web information retrieval. Lecture Notes in Computer Science, 4425, pp. 732-736. (doi:10.1007/978-3-540-71496-5_80)

[img]
Preview
Text
peng3765.pdf

342kB

Publisher's URL: http://dx.doi.org/10.1007/978-3-540-71496-5_80

Abstract

Query independent features (also called document priors), such as the number of incoming links to a document, its PageRank, or the length of its associated URL, have been explored to boost the retrieval effectiveness of Web Information Retrieval (IR) systems. The combination of such query independent features could further enhance the retrieval performance. However, most current combination approaches are based on heuristics, which ignore the possible dependence between the document priors. In this paper, we present a novel and robust method for combining document priors in a principled way. We use a conditional probability rule, which is derived from Kolmogorov’s axioms. In particular, we investigate the retrieval performance attainable by our combination of priors method, in comparison to the use of single priors and a heuristic prior combination method. Furthermore, we examine when and how document priors should be combined.

Item Type:Articles
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Ounis, Professor Iadh
Authors: Peng, J., and Ounis, I.
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Lecture Notes in Computer Science
Publisher:Springer
ISSN:1611-3349
Copyright Holders:Copyright © 2007 Springer
First Published:First published in Lecture Notes in Computer Science 4425:732-736
Publisher Policy:Reproduced in accordance with the copyright policy of the publisher.

University Staff: Request a correction | Enlighten Editors: Update this record