The use of MMR, diversity-based reranking for reordering documents and producing summaries
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Grouper: a dynamic clustering interface to Web search results
WWW '99 Proceedings of the eighth international conference on World Wide Web
Hierarchical classification of Web content
SIGIR '00 Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval
Agglomerative clustering of a search engine query log
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Optimizing search by showing results in context
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
ACM SIGIR Forum
Query suggestion based on user landing pages
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Using query logs and click data to create improved document descriptions
Proceedings of the 2009 workshop on Web Search Click Data
Models of searching and browsing: languages, studies, and applications
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Network flow for collaborative ranking
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
"I loan because...": understanding motivations for pro-social lending
Proceedings of the fifth ACM international conference on Web search and data mining
Click patterns: an empirical representation of complex query intents
Proceedings of the 21st ACM international conference on Information and knowledge management
Hi-index | 0.00 |
We present a computationally efficient method for automatic grouping of web search results based on reformulating the original query to alternative queries the user may have intended. The method requires no data other than query logs and the standard inverted indices used by most search engines. Our method outperforms standard web search in the task of enabling users to quickly find relevant documents for informational queries.