Sciweavers

1116 search results - page 24 / 224
» Domination Mining and Querying
Sort
View
WWW
2004
ACM
14 years 8 months 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
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 8 months ago
Mining broad latent query aspects from search sessions
Search queries are typically very short, which means they are often underspecified or have senses that the user did not think of. A broad latent query aspect is a set of keywords ...
Xuanhui Wang, Deepayan Chakrabarti, Kunal Punera
PVLDB
2008
144views more  PVLDB 2008»
13 years 7 months ago
Mining search engine query logs via suggestion sampling
Many search engines and other web applications suggest auto-completions as the user types in a query. The suggestions are generated from hidden underlying databases, such as query...
Ziv Bar-Yossef, Maxim Gurevich
SAC
2008
ACM
13 years 7 months ago
Continuous k-dominant skyline computation on multidimensional data streams
Skyline queries are important due to their usefulness in many application domains. However, by increasing the number of attributes, the probability that a tuple dominates another ...
Maria Kontaki, Apostolos N. Papadopoulos, Yannis M...