About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Abstract
This paper presents a new probabilistic approach to document retrieval based on the assumption that, a Markov process can explain the process by which humans rank the relevance of do cuments to queries. The model ranks documents for retrieval based on their probability of r elevane. Two truining methods are presented. The model is compared with Latent Semantic Analysis (LSA) on two publicly available databases. The results show that, the new algorithm achieves Precision/Recall performance equivalent to or better than LSA.