ACM Home Page
Please provide us with feedback. Feedback
Efficient interactive query expansion with complete search
Full text PdfPdf (258 KB)
Source
Conference on Information and Knowledge Management archive
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management table of contents
Lisbon, Portugal
POSTER SESSION: Poster session table of contents
Pages 857-860  
Year of Publication: 2007
ISBN:978-1-59593-803-9
Authors
Holger Bast  MPI für Informatik, Saarbrücken, Germany
Debapriyo Majumdar  IBM India Research Lab, Bangalore, India
Ingmar Weber  MPI für Informatik, Saarbrücken, Germany
Sponsors
SIGIR: ACM Special Interest Group on Information Retrieval
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 29,   Downloads (12 Months): 136,   Citation Count: 2
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/1321440.1321560
What is a DOI?

ABSTRACT

We present an efficient realization of the following interactive search engine feature: as the user is typing the query, words that are related to the last query word and that would lead to good hits are suggested, as well as selected such hits. The realization has three parts: (i) building clusters of related terms, (ii) adding this information as artificial words to the index such that (iii) the described feature reduces to an instance of prefix search and completion. An efficient solution for the latter is provided by the CompleteSearch engine, with which we have integrated the proposed feature. For building the clusters of related terms we propose a variant of latent semantic indexing that, unlike standard approaches, is completely transparent to the user. By experiments on two large test-collections, we demonstrate that the feature is provided at only a slight increase in query processing time and index size.


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
Billerbeck, B. Efficient Query Expansion. PhD thesis, RMIT University, 2005.
 
4
 
5
Deerwester, S. C., Dumais, S. T., Landauer, T. K., Furnas, G. W., and Harshman, R. A. Indexing by latent semantic analysis. JASIS 41, 6 (1990), 391--407.
 
6
Fellbaum, C., Ed. WordNet: An Electronic Lexical Database. MIT Press, 1998.
7
 
8
Porter, M. F. An algorithm for suffix stripping. Program 14, 3 (1980), 130--137.
 
9
10
 
11
van Dongen, S. Graph Clustering by Flow Simulation. PhD thesis, University of Utrecht, 2000. http://micans.org/mcl.
 
12
Voorhees, E. Overview of the Trec 2004 Robust retrieval track. In TREC (2004).


Collaborative Colleagues:
Holger Bast: colleagues
Debapriyo Majumdar: colleagues
Ingmar Weber: colleagues