Sciweavers

265 search results - page 16 / 53
» How Many Query Superpositions Are Needed to Learn
Sort
View
ICMLA
2007
13 years 9 months ago
Learning to evaluate conditional partial plans
In our research we study rational agents which learn how to choose the best conditional, partial plan in any situation. The agent uses an incomplete symbolic inference engine, emp...
Slawomir Nowaczyk, Jacek Malec
SAMT
2007
Springer
109views Multimedia» more  SAMT 2007»
14 years 1 months ago
Challenges in Supporting Faceted Semantic Browsing of Multimedia Collections
This paper describes our experience developing a semantically-rich exploratory interface that integrates a suite of Newsfilm media sources and associated information. Indeed, the a...
Daniel A. Smith, Alisdair Owens, m. c. schraefel, ...
CIKM
2010
Springer
13 years 2 months ago
Predicting short-term interests using activity-based search context
A query considered in isolation offers limited information about a searcher's intent. Query context that considers pre-query activity (e.g., previous queries and page visits)...
Ryen W. White, Paul N. Bennett, Susan T. Dumais
SIGIR
2008
ACM
13 years 7 months ago
Learning to rank at query-time using association rules
Some applications have to present their results in the form of ranked lists. This is the case of many information retrieval applications, in which documents must be sorted accordi...
Adriano Veloso, Humberto Mossri de Almeida, Marcos...
WSDM
2012
ACM
267views Data Mining» more  WSDM 2012»
12 years 3 months ago
Learning to rank with multi-aspect relevance for vertical search
Many vertical search tasks such as local search focus on specific domains. The meaning of relevance in these verticals is domain-specific and usually consists of multiple well-d...
Changsung Kang, Xuanhui Wang, Yi Chang, Belle L. T...