Sciweavers

77 search results - page 15 / 16
» Efficient bandit algorithms for online multiclass prediction
Sort
View
COLT
2010
Springer
13 years 4 months ago
Regret Minimization With Concept Drift
In standard online learning, the goal of the learner is to maintain an average loss that is "not too big" compared to the loss of the best-performing function in a fixed...
Koby Crammer, Yishay Mansour, Eyal Even-Dar, Jenni...
KDD
2007
ACM
178views Data Mining» more  KDD 2007»
14 years 7 months ago
Practical learning from one-sided feedback
In many data mining applications, online labeling feedback is only available for examples which were predicted to belong to the positive class. Such applications include spam filt...
D. Sculley
CORR
2010
Springer
69views Education» more  CORR 2010»
13 years 6 months ago
Epistemic irrelevance in credal nets: the case of imprecise Markov trees
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal ne...
Gert de Cooman, Filip Hermans, Alessandro Antonucc...
SIGIR
2008
ACM
13 years 6 months ago
Query dependent ranking using K-nearest neighbor
Many ranking models have been proposed in information retrieval, and recently machine learning techniques have also been applied to ranking model construction. Most of the existin...
Xiubo Geng, Tie-Yan Liu, Tao Qin, Andrew Arnold, H...
ICCV
2005
IEEE
14 years 8 months ago
Building a Classification Cascade for Visual Identification from One Example
Object identification (OID) is specialized recognition where the category is known (e.g. cars) and the algorithm recognizes an object's exact identity (e.g. Bob's BMW). ...
Andras Ferencz, Erik G. Learned-Miller, Jitendra M...