Re-ranking search results using document-passage graphs

doi:10.1145/1390334.1390539

Re-ranking search results using document-passage graphs

Full Text:

PDF

Buy this Article

Authors:	Michael Bendersky	University of Massachusetts, Amherst, MA, USA
	Oren Kurland	Technion - Israel Institute of Technology, Haifa, Israel

Published in:

	· Proceeding
	SIGIR '08 Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
	ACM New York, NY, USA ©2008 table of contents ISBN: 978-1-60558-164-4 doi>10.1145/1390334.1390539

	2008 Article Poster
Bibliometrics
· Downloads (6 Weeks): 1 · Downloads (12 Months): 44 · Citation Count: 4

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref
Upcoming Conference:
- ECIR '12

Tags: algorithms centrality experimentation passage language models passage-based document retrieval passage-document graphs retrieval models

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player