Models for retrieval with probabilistic indexing
Information Processing and Management: an International Journal - Modeling data, information and knowledge
Probabilistic models in information retrieval
The Computer Journal - Special issue on information retrieval
The probability ranking principle in IR
Readings in information retrieval
Inference networks for document retrieval
Readings in information retrieval
A language modeling approach to information retrieval
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
“Is this document relevant?…probably”: a survey of probabilistic models in information retrieval
ACM Computing Surveys (CSUR)
A probabilistic model of information retrieval: development and comparative experiments
Information Processing and Management: an International Journal
GeoSearcher: location-based ranking of search engine results
Journal of the American Society for Information Science and Technology
TREC: Experiment and Evaluation in Information Retrieval (Digital Libraries and Electronic Publishing)
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Application of Language Models to Suspect Prioritisation and Suspect Likelihood in Serial Crimes
IAS '07 Proceedings of the Third International Symposium on Information Assurance and Security
Language models, probability of relevance and relevance likelihood
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Statistical Language Models for Information Retrieval A Critical Review
Foundations and Trends in Information Retrieval
Measuring the likelihood property of scoring functions in general retrieval models
Journal of the American Society for Information Science and Technology
Hi-index | 0.07 |
Probabilistic models of information retrieval rank objects (e.g. documents) in response to a query according to the probability of some matching criterion (e.g. relevance). These models rarely yield an actual probability and their scoring functions are interpreted to be purely ordinal within a given retrieval task. In this paper we show that some scoring functions possess a likelihood property, which means that the scoring function indicates the likelihood of matching when compared to other retrieval tasks. This is potentially more useful than pure ranking even though it cannot be interpreted as an actual probability. This property can be detected by using two modified effectiveness measures, entire precision and entire recall. Experimental evidence is offered to show the existence of this property both for traditional document retrieval and for the analysis of crime data where suspects of an unsolved crime are ranked according to the probability of culpability.