ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Information Processing & Management
Volume 43, Issue 2, March 2007, Pages 406-419
Special issue on AIRS2005: Information Retrieval Research in Asia
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (218 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
Special issue
View Record in Scopus
 
doi:10.1016/j.ipm.2006.07.008    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2006 Elsevier Ltd All rights reserved.

Employing web mining and data fusion to improve weak ad hoc retrieval

Kui-Lam KwokCorresponding Author Contact Information, a, E-mail The Corresponding Author, Laszlo Grunfelda and Peter Denga

aComputer Science Department, Queens College, City University of New York, 65-30 Kissena Boulevard, Flusihing, NY 11367, USA

Received 27 May 2006; 
accepted 25 July 2006. 
Available online 12 October 2006.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

When a user issues a reasonable query to a retrieval system and obtains no relevant documents, he or she is bound to feel frustrated. We call these weak queries and retrievals. Improving their effectiveness is an important issue for ad hoc retrieval and would be most rewarding for these users. We explain why data fusion of sufficiently dissimilar retrieval lists can improve weak query results and confirm this with experiments using short and medium size queries. To realize sufficiently dissimilar retrieval lists, we propose composing alternate queries through web search and mining, employ them for target retrieval, and combine with the original query retrieval list. Methods of forming web probes from longer queries, including salient term selection and query text window rotation, are investigated. When compared with normal ad hoc retrieval, web assistance and data fusion can more than double the original weak query effectiveness. Other queries can also improve along with weak ones.

Keywords: Weak query; Robust retrieval; Salient term selection; Web mining; Alternate queries; Data fusion

Article Outline

1. Introduction
2. Weak queries
3. External resources for enhancing query and retrieval
4. Exploiting the web to form alternate queries
5. Experiments with short ‘Title’ queries
5.1. Retrieval results – ‘Title’ and alternate queries
5.2. Data fusion of ‘Title’ and alternate query lists
6. Experiments with medium length ‘Description’ queries
6.1. Forming web probes by term selection
6.2. Forming web probes by window rotation
6.3. Data fusion experiments for ‘Description’ queries
6.3.1. Data fusion of enhanced ‘Description’ and alternate query lists
6.3.2. Data fusion of ‘Description’ and ‘Title’ retrievals
7. Conclusion
Acknowledgements
References





Information Processing & Management
Volume 43, Issue 2, March 2007, Pages 406-419
Special issue on AIRS2005: Information Retrieval Research in Asia
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.