169 search results - page 7 / 34 » Bumptrees for Efficient Function, Constraint and Classificat... |
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
We formalize the associative bandit problem framework introduced by Kaelbling as a learning-theory problem. The learning environment is modeled as a k-armed bandit where arm payof...
COLT
2008
Springer
13 years 9 months ago
2008
Springer
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
WEBDB
2009
Springer
14 years 2 months ago
2009
Springer
We study the problem of automatically discovering semantic associations between schema elements, namely foreign keys. This problem is important in all applications where data sets...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
This paper presents an approach to build Sparse Large Margin Classifiers (SLMC) by adding one more constraint to the standard Support Vector Machine (SVM) training problem. The ad...
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
Many algorithms have been proposed for the problem of time series classification. However, it is clear that one-nearest-neighbor with Dynamic Time Warping (DTW) distance is except...