On relevance weights with little relevance information S.E. Robertson and S. Walker Centre for Interactive Syetema Research Department of Information Scienee City University, Northampton Square London ECIV OHB, UK Abstract 1.2 Robertson/Sparck ~0~ relavance wd~ The relationsh~p between the Robertson/Sptxck Jones relevancxi mighting formula and the Croft/Harper version for no relevanee information is d~ussed. A method of avoiding the negative weighta sometimes implied by the Cr&/Harper version is propowx$ which turna out to involve a return to the original Sparck Jones inverse collection frequency weight. The paper then goes on to propose a new way of using small amounts of relevanee information in the e9tim* tion of relevance weiglh Some experiments using TREC data are reported. 1 A short hiiry If the user k provided some relevance judgments for the information need for which the search is being made, then um may make use of these judgments to help derive good term weights for subsequent searchbg. Robertson and Spiuck Jones [2] provide both theoretical and empirical support for the following weighting function: ~=,wp(l-q) q(l -p) (1) This paper concerns the weighting of search terms as a searching mechanism, when there may be some relevance judgments on a f~
End of preview. The entire article is 10 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/on-relevance-weights-with-little-relevance-information-s7ruUbH6nh
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
On relevance weights with little relevance information
Robertson, S. E.; Walker, S.
Follow ACM SIGIR Forum
, Volume 31 (SI)
Association for Computing Machinery – Dec 2, 1997
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
