Agglomerative clustering of a search engine query log
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Bursty and hierarchical structure in streams
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Using Association Rules to Discover Search Engines Related Queries
LA-WEB '03 Proceedings of the First Conference on Latin American Web Congress
Concept-based interactive query expansion
Proceedings of the 14th ACM international conference on Information and knowledge management
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Data streams: algorithms and applications
Foundations and Trends® in Theoretical Computer Science
Extracting semantic relations from query logs
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Context-aware query suggestion by mining click-through and session data
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
The query-flow graph: model and applications
Proceedings of the 17th ACM conference on Information and knowledge management
Query suggestions using query-flow graphs
Proceedings of the 2009 workshop on Web Search Click Data
Temporal Dynamics of User Interests in Web Search Queries
WAINA '09 Proceedings of the 2009 International Conference on Advanced Information Networking and Applications Workshops
From "Dango" to "Japanese Cakes": Query Reformulation Models and Patterns
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
The effects of time on query flow graph-based models for query suggestion
RIAO '10 Adaptivity, Personalization and Fusion of Heterogeneous Information
Query recommendation using query logs in search engines
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
Hi-index | 0.00 |
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.