Sciweavers

196 search results - page 31 / 40
» Using historical data to enhance rank aggregation
Sort
View
WWW
2004
ACM
16 years 10 days ago
Mining anchor text for query refinement
When searching large hypertext document collections, it is often possible that there are too many results available for ambiguous queries. Query refinement is an interactive proce...
Reiner Kraft, Jason Y. Zien
62
Voted
SIGSOFT
2007
ACM
16 years 12 days ago
Recommending random walks
We improve on previous recommender systems by taking advantage of the layered structure of software. We use a random-walk approach, mimicking the more focused behavior of a develo...
Zachary M. Saul, Vladimir Filkov, Premkumar T. Dev...
SIGMOD
2010
ACM
132views Database» more  SIGMOD 2010»
14 years 6 months ago
Durable top-k search in document archives
We propose and study a new ranking problem in versioned databases. Consider a database of versioned objects which have different valid instances along a history (e.g., documents i...
Leong Hou U, Nikos Mamoulis, Klaus Berberich, Srik...
106
Voted
CIKM
2007
Springer
15 years 5 months ago
Predictive user click models based on click-through history
Web search engines consistently collect information about users interaction with the system: they record the query they issued, the URL of presented and selected documents along w...
Benjamin Piwowarski, Hugo Zaragoza
207
Voted
ICDE
2009
IEEE
159views Database» more  ICDE 2009»
16 years 1 months ago
Sketch-Based Summarization of Ordered XML Streams
XML streams, such as RSS feeds or complex event streams, are becoming increasingly pervasive as they provide the foundation for a wide range of emerging applications. An important...
Veronica Mayorga, Neoklis Polyzotis