Incremental Algorithms for Effective and Efficient Query Recommendation
Lists
Only you see this
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.
BibTeX
@inproceedings{broccolo2010incremental,
author = {Daniele Broccolo and Ophir Frieder and Franco Maria Nardini and Raffaele Perego and Fabrizio Silvestri},
title = {{Incremental Algorithms for Effective and Efficient Query Recommendation}},
booktitle = {SPIRE},
year = {2010},
doi = {10.1007/978-3-642-16321-0\_2},
}Loading related content...