Sciweavers

736 search results - page 18 / 148
» Ranking Query Results using Context-Aware Preferences
Sort
View
SCCC
1997
IEEE
14 years 2 months ago
Reactive Ranking for Cooperative Databases
A cooperative database allows the user to specify approximate or vague query conditions. A vague query requires the database system to rank the retrieved answers according to thei...
Berthier A. Ribeiro-Neto, Guilherme T. de Assis
SDM
2007
SIAM
169views Data Mining» more  SDM 2007»
13 years 11 months ago
Rank Aggregation for Similar Items
The problem of combining the ranked preferences of many experts is an old and surprisingly deep problem that has gained renewed importance in many machine learning, data mining, a...
D. Sculley
ICDE
2009
IEEE
158views Database» more  ICDE 2009»
14 years 11 months ago
BioNav: Effective Navigation on Query Results of Biomedical Databases
Search queries on biomedical databases like PubMed often return a large number of results, only a small subset of which is relevant to the user. Ranking and categorization, which c...
Abhijith Kashyap, Vagelis Hristidis, Michalis Petr...
SIGIR
2009
ACM
14 years 4 months ago
Reducing long queries using query quality predictors
Long queries frequently contain many extraneous terms that hinder retrieval of relevant documents. We present techniques to reduce long queries to more effective shorter ones tha...
Giridhar Kumaran, Vitor R. Carvalho
ICDM
2010
IEEE
122views Data Mining» more  ICDM 2010»
13 years 8 months ago
Learning Preferences with Millions of Parameters by Enforcing Sparsity
We study the retrieval task that ranks a set of objects for a given query in the pairwise preference learning framework. Recently researchers found out that raw features (e.g. word...
Xi Chen, Bing Bai, Yanjun Qi, Qihang Lin, Jaime G....