Characterizing browsing strategies in the World-Wide Web
Proceedings of the Third International World-Wide Web conference on Technology, tools and applications
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Solving large scale linear prediction problems using stochastic gradient descent algorithms
ICML '04 Proceedings of the twenty-first international conference on Machine learning
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Temporal analysis of a very large topically categorized Web query log
Journal of the American Society for Information Science and Technology
Why we search: visualizing and predicting user behavior
Proceedings of the 16th international conference on World Wide Web
Information re-retrieval: repeat queries in Yahoo's logs
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Characteristics of character usage in Chinese Web searching
Information Processing and Management: an International Journal
Search Engines: Information Retrieval in Practice
Search Engines: Information Retrieval in Practice
Extending autocompletion to tolerate errors
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Advancing search query autocompletion services with more and better suggestions
ICWE'10 Proceedings of the 10th international conference on Web engineering
Understanding temporal query dynamics
Proceedings of the fourth ACM international conference on Web search and data mining
CONQUER: a system for efficient context-aware query suggestions
Proceedings of the 20th international conference companion on World wide web
Context-sensitive query auto-completion
Proceedings of the 20th international conference on World wide web
Online spelling correction for query completion
Proceedings of the 20th international conference on World wide web
Fast construction of the HYB index
ACM Transactions on Information Systems (TOIS)
Query suggestions in the absence of query logs
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
Detecting seasonal queries by time-series analysis
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
Scalable, flexible and generic instant overview search
Proceedings of the 21st international conference companion on World Wide Web
Actualization of query suggestions using query logs
Proceedings of the 21st international conference companion on World Wide Web
Time-sensitive query auto-completion
SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Expediting search trend detection via prediction of query counts
Proceedings of the sixth ACM international conference on Web search and data mining
Learning to personalize query auto-completion
Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval
On cognition, emotion, and interaction aspects of search tasks with different search intentions
Proceedings of the 22nd international conference on World Wide Web
A survey on concept drift adaptation
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |
Query auto-completion (QAC) is a common interactive feature that assists users in formulating queries by providing completion suggestions as they type. In order for QAC to minimise the user's cognitive and physical effort, it must: (i) suggest the user's intended query after minimal input keystrokes, and (ii) rank the user's intended query highly in completion suggestions. Typically, QAC approaches rank completion suggestions by their past popularity. Accordingly, QAC is usually very effective for previously seen and consistently popular queries. Users are increasingly turning to search engines to find out about unpredictable emerging and ongoing events and phenomena, often using previously unseen or unpopular queries. Consequently, QAC must be both robust and time-sensitive -- that is, able to sufficiently rank both consistently and recently popular queries in completion suggestions. To address this trade-off, we propose several practical completion suggestion ranking approaches, including: (i) a sliding window of query popularity evidence from the past 2-28 days, (ii) the query popularity distribution in the last N queries observed with a given prefix, and (iii) short-range query popularity prediction based on recently observed trends. Using real-time simulation experiments, we extensively investigated the parameters necessary to maximise QAC effectiveness for three openly available query log datasets with prefixes of 2-5 characters: MSN and AOL (both English), and Sogou 2008 (Chinese). Optimal parameters vary for each query log, capturing the differing temporal dynamics and querying distributions. Results demonstrate consistent and language-independent improvements of up to 9.2% over a non-temporal QAC baseline for all query logs with prefix lengths of 2-3 characters. This work is an important step towards more effective QAC approaches.