Retrieval test evaluation of a rule based automatic indexing (AIR/PHYS)
Proc. of the third joint BCS and ACM symposium on Research and development in information retrieval
Recent trends in automatic information retrieval
Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval
Two models of retrieval with probabilistic indexing
Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval
Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval
The maximum entropy principle in information retrieval
Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval
On Relevance, Probabilistic Indexing and Information Retrieval
Journal of the ACM (JACM)
Probabilistic models of indexing and searching
SIGIR '80 Proceedings of the 3rd annual ACM conference on Research and development in information retrieval
Concept based retrieval in classical IR systems
SIGIR '88 Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval
An information structure dealing with term dependance and polysemy
SIGIR '88 Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval
A Probabilistic Framework for Vague Queries and Imprecise Information in Databases
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
| Hi-index | 0.00 |
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.