Incremental algorithms for effective and efficient query recommendation

  • Authors:
  • Daniele Broccolo;Ophir Frieder;Franco Maria Nardini;Raffaele Perego;Fabrizio Silvestri

  • Affiliations:
  • ISTI-CNR, Pisa, Italy;Department of Computer Science, Georgetown University, Washington, DC;ISTI-CNR, Pisa, Italy;ISTI-CNR, Pisa, Italy;ISTI-CNR, Pisa, Italy

  • Venue:
  • SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Query recommender systems give users hints on possible interesting queries relative to their information needs. Most query recommenders are based on static knowledge models built on the basis of past user behaviors recorded in query logs. These models should be periodically updated, or rebuilt from scratch, to keep up with the possible variations in the interests of users. We study query recommender algorithms that generate suggestions on the basis of models that are updated continuously, each time a new query is submitted. We extend two state-of-the-art query recommendation algorithms and evaluate the effects of continuous model updates on their effectiveness and efficiency. Tests conducted on an actual query log show that contrasting model aging by continuously updating the recommendation model is a viable and effective solution.