Please use this identifier to cite or link to this item: http://dspace.library.iitb.ac.in/xmlui/handle/100/2032
Full metadata record
DC FieldValueLanguage
dc.contributor.authorRAMAN, K-
dc.contributor.authorUDUPA, R-
dc.contributor.authorBHATTACHARYA, P-
dc.contributor.authorBHOLE, A-
dc.date.accessioned2011-10-24T02:26:45Z-
dc.date.accessioned2011-12-15T09:11:23Z-
dc.date.available2011-10-24T02:26:45Z-
dc.date.available2011-12-15T09:11:23Z-
dc.date.issued2010-
dc.identifier.citationADVANCES IN INFORMATION RETRIEVAL, PROCEEDINGS,5993,573-576en_US
dc.identifier.isbn978-3-642-12274-3-
dc.identifier.issn0302-9743-
dc.identifier.urihttp://dspace.library.iitb.ac.in/xmlui/handle/10054/15307-
dc.identifier.urihttp://hdl.handle.net/100/2032-
dc.description.abstractPseudo-Relevance Feedback (PRF) assumes that the top-ranking n documents of the initial retrieval are relevant and extracts expansion terms from them. In this work, we introduce the notion of pseudo-irrelevant documents, i.e. high-scoring documents outside a top n that, are highly unlikely to be relevant. We show how pseudo-irrelevant documents can be used to extract; better expansion terms from the top-ranking n documents: good expansion terms are those which discriminate the top-ranking n documents from the pseudo-irrelevant documents. Our approach gives substantial improvements in retrieval performance over Model-based Feedback on several test collections.en_US
dc.language.isoEnglishen_US
dc.publisherSPRINGER-VERLAG BERLIN-
dc.source32nd Europeasn Conference on Information Retrieval Research,Milton Keynes, ENGLAND,MAR 28-31, 2010-
dc.subject.otherInformation Retrieval-
dc.subject.otherPseudo-Relevance Feedback-
dc.subject.otherQuery Expansion-
dc.subject.otherPseudo-Irrelevance-
dc.subject.otherLinear Classifier-
dc.titleOn improving Pseudo-relevance feedback using Pseudo-irrelevant documentsen_US
dc.typeProceedings Paperen_US
Appears in Collections:Proceedings papers

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.