Sciweavers

404 search results - page 47 / 81
» Query clustering using user logs
Sort
View
PODS
2003
ACM
143views Database» more  PODS 2003»
14 years 7 months ago
Maintaining variance and k-medians over data stream windows
The sliding window model is useful for discounting stale data in data stream applications. In this model, data elements arrive continually and only the most recent N elements are ...
Brian Babcock, Mayur Datar, Rajeev Motwani, Liadan...
WWW
2004
ACM
14 years 8 months ago
A hierarchical monothetic document clustering algorithm for summarization and browsing search results
Organizing Web search results into a hierarchy of topics and subtopics facilitates browsing the collection and locating results of interest. In this paper, we propose a new hierar...
Krishna Kummamuru, Rohit Lotlikar, Shourya Roy, Ka...
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
14 years 7 months ago
Keyword search on structured and semi-structured data
Empowering users to access databases using simple keywords can relieve the users from the steep learning curve of mastering a structured query language and understanding complex a...
Yi Chen, Wei Wang 0011, Ziyang Liu, Xuemin Lin
MHCI
2007
Springer
14 years 1 months ago
Incidental information and mobile search
There is much interest in providing effective mobile search tools. Our focus is the value of in situ sharing of users’ mobile search activity. The QnotA prototype displays other...
David Arter, George Buchanan, Matt Jones, Richard ...
EMNLP
2010
13 years 5 months ago
Learning Recurrent Event Queries for Web Search
Recurrent event queries (REQ) constitute a special class of search queries occurring at regular, predictable time intervals. The freshness of documents ranked for such queries is ...
Ruiqiang Zhang, Yuki Konda, Anlei Dong, Pranam Kol...