98 search results - page 6 / 20 » Robust ranking models via risk-sensitive optimization |
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
We introduce a new algorithm for binary classification in the selective sampling protocol. Our algorithm uses Regularized Least Squares (RLS) as base classifier, and for this reas...
67
Voted
4OR
2005
14 years 9 months ago
2005
Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not...
ECIR
2009
Springer
15 years 6 months ago
2009
Springer
Probabilistic retrieval models usually rank documents based on a scalar quantity. However, such models lack any estimate for the uncertainty associated with a document’s rank. Fu...
ACSD
2006
IEEE
15 years 3 months ago
2006
IEEE
An optimized functional design space exploration method for multimedia applications is proposed. The basis of the method is a way of representing the dependency and the concurrenc...
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
1 We consider the problem of similarity search in applications where the cost of computing the similarity between two records is very expensive, and the similarity measure is not a...