Social information filtering: algorithms for automating “word of mouth”
CHI '95 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Agglomerative clustering of a search engine query log
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Clustering user queries of a search engine
Proceedings of the 10th international conference on World Wide Web
Collaborative filtering with privacy via factor analysis
SIGIR '02 Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval
Latent semantic models for collaborative filtering
ACM Transactions on Information Systems (TOIS)
IEEE Transactions on Knowledge and Data Engineering
Query chains: learning to rank from implicit feedback
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Concept-based interactive query expansion
Proceedings of the 14th ACM international conference on Information and knowledge management
Fast maximum margin matrix factorization for collaborative prediction
ICML '05 Proceedings of the 22nd international conference on Machine learning
Generating query substitutions
Proceedings of the 15th international conference on World Wide Web
Unifying user-based and item-based collaborative filtering approaches by similarity fusion
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
s-grams: Defining generalized n-grams for information retrieval
Information Processing and Management: an International Journal
Robust classification of rare queries using web knowledge
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Heads and tails: studies of web search with common and rare queries
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Extracting semantic relations from query logs
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Query suggestion using hitting time
Proceedings of the 17th ACM conference on Information and knowledge management
The query-flow graph: model and applications
Proceedings of the 17th ACM conference on Information and knowledge management
Beyond the session timeout: automatic hierarchical segmentation of search topics in query logs
Proceedings of the 17th ACM conference on Information and knowledge management
Proceedings of the Second ACM International Conference on Web Search and Data Mining
Query suggestions using query-flow graphs
Proceedings of the 2009 workshop on Web Search Click Data
Online expansion of rare queries for sponsored search
Proceedings of the 18th international conference on World wide web
Search shortcuts: a new approach to the recommendation of queries
Proceedings of the third ACM conference on Recommender systems
A live-user evaluation of collaborative web search
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
The Probabilistic Relevance Framework: BM25 and Beyond
Foundations and Trends in Information Retrieval
Beyond DCG: user behavior as a predictor of a successful search
Proceedings of the third ACM international conference on Web search and data mining
Optimal rare query suggestion with implicit user feedback
Proceedings of the 19th international conference on World wide web
Mining Query Logs: Turning Search Usage Data into Knowledge
Foundations and Trends in Information Retrieval
Query similarity by projecting the query-flow graph
Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval
Identifying task-based sessions in search engine query logs
Proceedings of the fourth ACM international conference on Web search and data mining
Query recommendation using query logs in search engines
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
Adaptation of the concept hierarchy model with search logs for query recommendation on intranets
SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
When entities meet query recommender systems: semantic search shortcuts
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Learning to shorten query sessions
Proceedings of the 22nd international conference on World Wide Web companion
Orthogonal query recommendation
Proceedings of the 7th ACM conference on Recommender systems
Learning to rank query suggestions for adhoc and diversity search
Information Retrieval
Analyzing, Detecting, and Exploiting Sentiment in Web Queries
ACM Transactions on the Web (TWEB)
Expert Systems with Applications: An International Journal
Cognitive canonicalization of natural language queries using semantic strata
ACM Transactions on Speech and Language Processing (TSLP)
Hi-index | 0.00 |
This paper proposes an efficient and effective solution to the problem of choosing the queries to suggest to web search engine users in order to help them in rapidly satisfying their information needs. By exploiting a weak function for assessing the similarity between the current query and the knowledge base built from historical users' sessions, we re-conduct the suggestion generation phase to the processing of a full-text query over an inverted index. The resulting query recommendation technique is very efficient and scalable, and is less affected by the data-sparsity problem than most state-of-the-art proposals. Thus, it is particularly effective in generating suggestions for rare queries occurring in the long tail of the query popularity distribution. The quality of suggestions generated is assessed by evaluating the effectiveness in forecasting the users' behavior recorded in historical query logs, and on the basis of the results of a reproducible user study conducted on publicly-available, human-assessed data. The experimental evaluation conducted shows that our proposal remarkably outperforms two other state-of-the-art solutions, and that it can generate useful suggestions even for rare and never seen queries.