| D. J. Harper, `Relevance Feedback in Document Retrieval Systems: An Evaluation of Probabilistic Strategies' Phd. Thesis The University of Cambridge (1980). |
....The common objective is the elimination of many of the query document comparisons while still ensuring that the documents at the top of ranking are identified. A critical review of such algorithms is given by Perry and Willet in[15] Previous work related to our approach has been reported by Harper[19] and Buckley[14] The first algorithm optimized the number of documents to be maintained in internal storage whereas the second author worked at the inverted lists to be inspected. A BOUNDED STRATEGY The considerations developed before suggest two ways for optimizing the basic algorithm. The ....
D. J. Harper, `Relevance Feedback in Document Retrieval Systems: An Evaluation of Probabilistic Strategies' Phd. Thesis The University of Cambridge (1980).
....in predicting relevance of an article. 6, 5, 21] To learn the features and their weights, most routing algorithms usually use the probability of occurrence (or some variation of it) of a feature in the articles marked relevant by a user and the non relevant articles in the training corpus. [22, 14] The central idea of this scheme is that if a feature occurs with a high probability in the relevant articles but with a low probability in the non relevant articles, then it is a good indicator of relevance and should be assigned a high weight in the profile. On the other hand, if a feature ....
D. Harper. Relevance Feedback in Document Retrieval Systems. PhD thesis, University of Cambridge, England, 1980.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC