Probabilistic models in information retrieval
The Computer Journal - Special issue on information retrieval
A user-centred evaluation of ranking algorithms for interactive query expansion
SIGIR '93 Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval
Some simple effective approximations to the 2-Poisson model for probabilistic weighted retrieval
SIGIR '94 Proceedings of the 17th annual international ACM SIGIR conference on Research and development in information retrieval
Probabilistic dependence and logistic inference in information retrieval
Probabilistic dependence and logistic inference in information retrieval
Some inconsistencies and misidentified modeling assumptions in probabilistic information retrieval
ACM Transactions on Information Systems (TOIS)
Overview of the second text retrieval conference (TREC-2)
TREC-2 Proceedings of the second conference on Text retrieval conference
Pivoted document length normalization
SIGIR '96 Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval
Method combination for document filtering
SIGIR '96 Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval
Training algorithms for linear text classifiers
SIGIR '96 Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval
Multimedia Information Retrieval: Content-Based Information Retrieval from Large Text and Audio Databases
| Hi-index | 0.00 |
The linked dependence assumption, a widely used simplification in probabilistic retrieval, is briefly reviewed and its validity is investigated. We show that the linked dependence assumption is violated particularly if the query features are good discriminators between relevant and non-relevant documents. We then propose the manual concept generation method, which takes into account the dependence between different query concepts. For a limited set of routing queries, experiments show a significant improvement when compared with retrieval methods which do not take into account feature dependencies. We consider this method to be the first successful step which progresses beyond the linked dependence assumption.