Sciweavers

648 search results - page 14 / 130
» A general dimension for query learning
Sort
View
IUI
2009
ACM
14 years 5 months ago
Learning to generalize for complex selection tasks
Selection tasks are common in modern computer interfaces: we are often required to select a set of files, emails, data entries, and the like. File and data browsers have sorting a...
Alan Ritter, Sumit Basu
ECML
2006
Springer
14 years 12 days ago
Right of Inference: Nearest Rectangle Learning Revisited
In Nearest Rectangle (NR) learning, training instances are generalized into hyperrectangles and a query is classified according to the class of its nearest rectangle. The method ha...
Byron J. Gao, Martin Ester
WSDM
2010
ACM
194views Data Mining» more  WSDM 2010»
14 years 6 months ago
Ranking with Query-Dependent Loss for Web Search
Queries describe the users' search intent and therefore they play an essential role in the context of ranking for information retrieval and Web search. However, most of exist...
Jiang Bian, Tie-Yan Liu, Tao Qin, Hongyuan Zha
ICALP
2001
Springer
14 years 1 months ago
Separating Quantum and Classical Learning
We consider a model of learning Boolean functions from quantum membership queries. This model was studied in [26], where it was shown that any class of Boolean functions which is i...
Rocco A. Servedio
DATAMINE
2002
104views more  DATAMINE 2002»
13 years 8 months ago
Cubegrades: Generalizing Association Rules
Cubegrades are generalization of association rules which represent how a set of measures (aggregates) is affected by modifying a cube through specialization (rolldown), generaliza...
Tomasz Imielinski, Leonid Khachiyan, Amin Abdulgha...