ACM Home Page
Please provide us with feedback. Feedback
Two learning schemes in information retrieval
Full text PdfPdf (1.39 MB)
Source Annual ACM Conference on Research and Development in Information Retrieval archive
Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval table of contents
Grenoble, France
Pages: 201 - 218  
Year of Publication: 1988
ISBN:2-7061-0309-4
Authors
C. T. Yu  Department of Electrical Engineering & Computer Science, University of Illinois at Chicago, Chicago, Illinois
H. Mizuno  Department of Electrical Engineering & Computer Science, University of Illinois at Chicago, Chicago, Illinois
Sponsor
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 16,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/62437.62451
What is a DOI?

ABSTRACT

Two methods are given to improve weighting schemes by using relevance information of a set of queries. The first method is to estimate parameter values of two independence models in information retrieval — the binary independence model and the non-binary independence model. The parameters estimated here are used to calculate optimal weights for terms in a different set of queries. Performance of this estimation is compared to the inverse document frequency method, the cosine measure, and the statistical similarity measure. The second method is to learn optimal weights of the non-binary independence model adaptively by a learning formula. Experiments are performed on three different document collections CISI, MEDLARS, and CRN4NUL for both methods, and results are reported. Both methods show improvements compared to the existing weighting schemes. Experimental results show that the second method gives slightly better performance than the first one, and has simpler implementation.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
BoSw
Bookstein, A. and Swanson, D. "A Decision Theoretic Foundation.for Indexing", J. of the American Society for Information Science, January 1975, pp45-50.
 
Brei
Breiman, L.. et al. "Classification and regression trees", WADSWORTH INTERNATIONAL GROUP, 1984, pl 1.
 
CrHa
Croft, W.B. and Harper, D.J. "Using Probabilistic Models of Document Retrieval without Relevance Information", J. of Documentation, Vol. 35, 1979 pp285-295.
 
Crof
Croft, W.B. "Experiments wifl# Representation in a Document Retrieval System", Information Technology:Research and Development, Vol. 2, January 1983, ppl-21.
 
RoSp
Robertson, S.E. and Sparck Jones, K. "Relevance Weighing of Search Term", J. of the American Society for Information Science, May-June 1976, pp129-146.
 
Salt
Salt2
 
SaMc
 
Spar
Sparck Jones, K. "A Statistical Interpretation of Term Specificity and its Application in Retrieval", J. of Documentation, Vol. 28, No. I, March 1972, ppl 1-20.
WoYa
WoZW
 
Yu
Yu, C.T. "A Framework for Effective Retrieval", Technical Report, the University of lltinois at Chicago, 1987.
YuLe
YuSa