ACM Home Page
Please provide us with feedback. Feedback
Effective and efficient user interaction for long queries
Full text PdfPdf (365 KB)
Source
Annual ACM Conference on Research and Development in Information Retrieval archive
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval table of contents
Singapore, Singapore
SESSION: User interaction models table of contents
Pages 11-18  
Year of Publication: 2008
ISBN:978-1-60558-164-4
Authors
Giridhar Kumaran  Microsoft Live Labs, Redmond, WA, USA
James Allan  University of Massachusetts, Amherst, MA, USA
Sponsors
ACM: Association for Computing Machinery
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 22,   Downloads (12 Months): 354,   Citation Count: 3
Additional Information:

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

ABSTRACT

Handling long queries can involve either pruning the query to retain only the important terms (reduction), or expanding the query to include related concepts (expansion). While automatic techniques to do so exist, roughly 25% performance improvements in terms of MAP have been realized in past work through interactive variants. We show that selectively reducing or expanding a query leads to an average improvement of 51% in MAP over the baseline for standard TREC test collections. We demonstrate how user interaction can be used to achieve this improvement. Most interaction techniques present users with a fixed number of options for all queries. We achieve improvements by interacting less with the user, i.e., we present techniques to identify the optimal number of options to present to users, resulting in an interface with an average of 70% fewer options to consider. Previous algorithms supporting interactive reduction and expansion are exponential in nature. To extend their utility to operational environments, we present techniques to make the complexity of the algorithms polynomial. We finally present an analysis of long queries that continue to exhibit poor performance in spite of our new techniques.


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
J. Allan. The HARD Track Overview in TREC 2003. High Accuracy Retrieval from Documents. In TREC 12 Proceedings, 2003.
3
 
4
 
5
6
7
8
 
9
D. Harman. How effective is suffixing? JASIS, 42(1):7--15, 1991.
10
 
11
B. He and I. Ounis. Inferring query performance using pre-retrieval predictors. In The Eleventh Symposium on String Processing and Information Retrieval, 2004.
12
13
14
15
16
 
17
G. Kumaran and J. Allan. A case for shorter queries, and helping users create them. In HLT-EMNLP Conference Proceedings, pages 220--227, Rochester, NY, 2007.
 
18
G. Kumaran and J. Allan. Adapting information retrieval systems to user queries. IP& M: Special Topic Issue on Adaptive Information Retrieval, In press, 2008.
19
20
21
22
23
 
24
T. Strohman, D. Metzler, H. Turtle, and W. B. Croft. Indri: A language model-based search engine for complex queries. In International Conference on Intelligence Analysis, 2005.
25
26
 
27
E. M. Voorhees and D. Harman. Overview of the fifth text retrieval conference (TREC 5). In TREC 5 Proceedings, 1996.


Collaborative Colleagues:
Giridhar Kumaran: colleagues
James Allan: colleagues