ACM Home Page
Please provide us with feedback. Feedback
Ranked feature fusion models for ad hoc retrieval
Full text PdfPdf (264 KB)
Source
Conference on Information and Knowledge Management archive
Proceeding of the 17th ACM conference on Information and knowledge management table of contents
Napa Valley, California, USA
SESSION: IR: medley table of contents
Pages 893-900  
Year of Publication: 2008
ISBN:978-1-59593-991-3
Authors
Jeremy Pickens  FX Palo Alto Lab, Inc., Palo Alto, CA, USA
Gene Golovchinsky  FX Palo Alto Lab, Inc., Palo Alto, CA, USA
Sponsors
ACM: Association for Computing Machinery
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 114,   Citation Count: 0
Additional Information:

abstract   references   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/1458082.1458200
What is a DOI?

ABSTRACT

We introduce the Ranked Feature Fusion framework for information retrieval system design. Typical information retrieval formalisms such as the vector space model, the best-match model and the language model first combine features (such as term frequency and document length) into a unified representation, and then use the representation to rank documents. We take the opposite approach: Documents are first ranked by the relevance of a single feature value and are assigned scores based on their relative ordering within the collection. A separate ranked list is created for every feature value and these lists are then fused to produce a final document scoring. This new "rank then combine" approach is extensively evaluated and is shown to be as effective as traditional "combine then rank" approaches. The model is easy to understand and contains fewer parameters than other approaches. Finally, the model is easy to extend (integration of new features is trivial) and modify. This advantage includes but is not limited to relevance feedback and distribution flattening.


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.

1
2
 
3
4
 
5
6
7
8
 
9
S. Robertson, S. Walker, S. Jones, M. Hancock-Beaulieu, and M. Gatford. Okapi at trec-3. In 3rd annual Text REtrieval Conference, NIST - Gaithersburg, MD, 1994.
 
10
S. E. Robertson and K. S. Jones. Simple, proven approaches to text retrieval. Technical Report UCAM-CL-TR-356, University of Cambridge, Computer Laboratory, University of Cambridge, 1997.
 
11
 
12
 
13
J. A. Shaw and E. A. Fox. Combination of multiple searches. In Text (REtrieval) Conference, pages 105--108, 1994.
14
15
16
17

Collaborative Colleagues:
Jeremy Pickens: colleagues
Gene Golovchinsky: colleagues