![Employing web mining and data fusion to improve weak ad hoc retrieval [An article from: Information Processing and Management]](https://www.ebooknetworking.net/books/B00/0PB/bigB000PBZV6M.jpg)
Employing web mining and data fusion to improve weak ad hoc retrieval [An article from: Information Processing and Management]
Price not available for France
You can still browse on Amazon. Try another country above.
Book Details
Author(s)
K.L. Kwok, L. Grunfeld, P. Deng
Publisher
Elsevier
ISBN / ASIN
B000PBZV6M
ISBN-13
978B000PBZV64
Marketplace
France 🇫🇷
Ratings & Reviews
No reviews yet — be the first!
No reviews yet.
Description
This digital document is a journal article from Information Processing and Management, published by Elsevier in 2007. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
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.
Description:
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.
