Skip to main content

A Phrase Recommendation Algorithm Based on Query Stream Mining in Web Search Engines

  • Conference paper
  • 607 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4936))

Abstract

In this paper, a phrase recommender algorithm is proposed that suggests the related frequent phrases to an incomplete user query. The suggested phrases are extracted from past user queries based on the frequency rate of the phrases. A query recommender algorithm called OQD (Online Query Discovery) has also been designed for comparison purposes. Simulation results show the efficiency of the proposed phrase recommender algorithm compared to the OQD. The phrase recommender algorithm significantly reduces the size of the candidate set, which results in smaller memory usage and better performance, while recommending more appropriate phrases to the user.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barouni-Ebrahimi, M., Ghorbani, A.A.: A novel approach for frequent phrase mining in web search engine query streams. In: Barouni-Ebrahimi, M. (ed.) Communication Networks and Services Research Conference (CNSR 2007), Fredericton, Canada, 14-17 May, pp. 125–132 (2007)

    Google Scholar 

  2. Barouni-Ebrahimi, M., Ghorbani, A.A.: An online frequency rate based algorithm for mining frequent sequences in evolving data streams. In: international conference on information technology and management (ICITM 2007), Hong Kong (2007)

    Google Scholar 

  3. Bast, H., Weber, I.: Type less, find more: Fast autocompletion search with a succinct index. In: Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval (SIGIR 2006), New York, NY, USA (2006)

    Google Scholar 

  4. Charikar, M., Chen, K., Farach-Colton, M.: Finding frequent items in data streams. In: Widmayer, P., et al. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 693–703. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  5. Li, H.-F., Lee, S.-Y., Shan, M.-K.: Online mining (recently) maximal frequent itemsets over data streams. In: 15th International Workshop on Research Issues in Data Engineering: Stream Data Mining and Applications (RIDE-SDMA 2005), pp. 11–18 (2005)

    Google Scholar 

  6. Raghavan, V.V., Sever, H.: On the reuse of past optimal queries. In: Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval (SIGIR 1995), New York, NY, USA, pp. 344–350 (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

William Aiello Andrei Broder Jeannette Janssen Evangelos Milios

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Barouni-Ebrahimi, M., Ghorbani, A.A. (2008). A Phrase Recommendation Algorithm Based on Query Stream Mining in Web Search Engines. In: Aiello, W., Broder, A., Janssen, J., Milios, E. (eds) Algorithms and Models for the Web-Graph. WAW 2006. Lecture Notes in Computer Science, vol 4936. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78808-9_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-78808-9_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-78807-2

  • Online ISBN: 978-3-540-78808-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics