Probabilistic Search Term Weighting-Some Negative Results.
Norbert Fuhr, Peter Müller:
Probabilistic Search Term Weighting-Some Negative Results.
SIGIR 1987: 13-18@inproceedings{DBLP:conf/sigir/FuhrM87,
author = {Norbert Fuhr and
Peter M{\"u}ller},
title = {Probabilistic Search Term Weighting-Some Negative Results},
booktitle = {Proceedings of the Tenth Annual International ACM SIGIR Conference
on Research and Development in Information Retrieval, New Orleans,
Louisiana, USA, June 3-5, 1987},
publisher = {ACM},
year = {1987},
pages = {13-18},
ee = {db/conf/sigir/FuhrM87.html},
crossref = {DBLP:conf/sigir/87},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Abstract
The effect of probabilistic search term weighting on the improvement of retrieval quality has been demonstrated in various experiments described in the literature.
In this paper, we investigate the feasibility of this method for boolean retrieval with terms from a prescribed indexing vocabulary.
This is a quite different test setting in comparison to other experiments where linear retrieval with free text terms was used.
The experimental results show that in our case no improvement over a simple coordination match function can be achieved.
On the other hand, models based on probabilistic indexing outperform the ranking procedures using search term weights.
Copyright © 1987 by the ACM,
Inc., used by permission. Permission to make
digital or hard copies is granted provided that
copies are not made or distributed for profit or
direct commercial advantage, and that copies show
this notice on the first page or initial screen of
a display along with the full citation.
CDROM Version: Load the CDROM "Volume 2 Issue 3, SIGIR, DASFAA'97, OODBS'86" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
Printed Edition
Proceedings of the Tenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, New Orleans, Louisiana, USA, June 3-5, 1987.
ACM 1987
Contents
Citation page
Copyright © Tue Dec 8 20:18:57 2009
by Michael Ley (ley@uni-trier.de)