Abstract
Many agree that the relevancy of current search engine results needs significant improvement. On the other hand, it is also true that finding the appropriate query for the best search engine result is not a trivial task. Often, users try different queries until they are satisfied with the results. This paper presents a method for building a system for automatically suggesting similar queries when results for a query are not satisfactory. Assuming that every search query can be expressed differently and that other users with similar information needs could have already expressed it better, the system makes use of collaborative knowledge from different search engine users to recommend new ways of expressing the same information need. The approach is based on the notion of quasi-similarity between queries since full similarity with an unsatisfactory query would lead to disappointment. We present a model for search engine queries and a variety of quasi-similarity measures to retrieve relevant queries.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Junghoo Cho, Hector Garcia-Molina and Lawrence Page, Efficient Crawling Through URL Ordering, 7th International Conference on WWW, Brisbane, Australia, 1998
Sergey Brin and Lawrence Page, The Anatomy of a Large-Scale Hypertextual Web Search Engine, 7th International Conference on WWW, Brisbane, Australia, 1998
S. Deerwester, S.T. Dumais, G.W. Furnas, T.K. Landauer and R. Harshman, Indexing by Latent Semantic Analysis, in Journal of the American Society of Information Science, 1990
Fitzpatrick, Larry and Dent, Mei 1997 Automatic Feedback Using Past Queries: Social Searching? In Proeedings of SIGIR’97, Philadelphia, PA.
Natalie S. Glance, Community search assistant, Workshop on Artificial Intelligence for Web Search, In conjunction with the AAAI conference, Austin, Texas, USA, 2000
Evangelos P. Markatos. On Caching Search Engine Results. In Technical Report 241, ICSFORTH, January 1999. available at http://archvlsi.ics.forth.gr/html_pages/TR241/
M. F. Porter, An algorithm for suffix stripping, Program, pp 130–137, vol 14, n 3, 1980.
Danny Sullivan, Search Assistance Features: Related Searches, 2001 available at: http://www.searchenginewatch.com/facts/assistance.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zaïane, O.R., Strilets, A. (2002). Finding Similar Queries to Satisfy Searches Based on Query Traces. In: Bruel, JM., Bellahsene, Z. (eds) Advances in Object-Oriented Information Systems. OOIS 2002. Lecture Notes in Computer Science, vol 2426. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46105-1_24
Download citation
DOI: https://doi.org/10.1007/3-540-46105-1_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44088-8
Online ISBN: 978-3-540-46105-0
eBook Packages: Springer Book Archive