ACM Home Page
Please provide us with feedback. Feedback
Learning to rank for quantity consensus queries
Full text PdfPdf (642 KB)
Source
Annual ACM Conference on Research and Development in Information Retrieval archive
Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval table of contents
Boston, MA, USA
SESSION: Learning to rank I table of contents
Pages 243-250  
Year of Publication: 2009
ISBN:978-1-60558-483-6
Authors
Somnath Banerjee  HP Labs India, Bangalore, India
Soumen Chakrabarti  IIT Bombay, Mumbai, India
Ganesh Ramakrishnan  IIT Bombay, Mumbai, India
Sponsors
SIGIR: ACM Special Interest Group on Information Retrieval
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 48,   Downloads (12 Months): 175,   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/1571941.1571985
What is a DOI?

ABSTRACT

Web search is increasingly exploiting named entities like persons, places, businesses, addresses and dates. Entity ranking is also of current interest at INEX and TREC. Numerical quantities are an important class of entities, especially in queries about prices and features related to products, services and travel. We introduce Quantity Consensus Queries (QCQs), where each answer is a tight quantity interval distilled from evidence of relevance in thousands of snippets. Entity search and factoid question answering have benefited from aggregating evidence from multiple promising snippets, but these do not readily apply to quantities. Here we propose two new algorithms that learn to aggregate information from multiple snippets. We show that typical signals used in entity ranking, like rarity of query words and their lexical proximity to candidate quantities, are very noisy. Our algorithms learn to score and rankquantity intervals directly, combining snippet quantity and snippet text information. We report on experiments using hundreds of QCQs with ground truth taken from TREC QA, Wikipedia Infoboxes, and other sources, leading to tens of thousands of candidate snippets and quantities. Our algorithms yield about 20% better MAP and NDCG compared to the best-known collective rankers, and are 35% better than scoring snippets independent of each other.


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
M. J. Cafarella, C. Re, D. Suciu, O. Etzioni, and M. Banko. Structured querying of web text: A technical challenge. In CIDR, pages 225--234, 2007.
 
5
O. Chapelle, Q. Le, and A. Smola. Large margin optimization of ranking measures. In NIPS 2007 Workshop on Machine Learning for Web Search, 2007.
 
6
7
8
 
9
H. Fang and C. Zhai. Probabilistic models for expert finding. In ECIR, pages 418--430, 2007.
10
 
11
T. Joachims, H. Li, T.-Y. Liu, and C. Zhai, editors. Learning to Rank for Information Retrieval, Amsterdam, 2007. SIGIR Workshop.
12
 
13
T.-Y. Liu. Learning to rank for information retrieval. Tutorial at SIGIR, 2008.
 
14
T.-Y. Liu, T. Qin, J. Xu, W. Xiong, and H. Li. LETOR: Benchmark dataset for research on learning to rank for information retrieval. In LR4IR Workshop, 2007.
 
15
V. Moriceau. Numerical data integration for cooperative question-answering. In EACL Workshop on Knowledge and Reasoning for Language Processing, pages 42--49, 2006.
16
17
18
19
20
 
21
M. Wu and A. Marian. Corroborating answers from multiple web sources. In WebDB: Tenth International Workshop on the Web and Databases, 2007.
22

Collaborative Colleagues:
Somnath Banerjee: colleagues
Soumen Chakrabarti: colleagues
Ganesh Ramakrishnan: colleagues