Sciweavers

1004 search results - page 120 / 201
» A comparison of generalized linear discriminant analysis alg...
Sort
View
COLT
2000
Springer
14 years 1 months ago
PAC Analogues of Perceptron and Winnow via Boosting the Margin
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...
Rocco A. Servedio

Publication
535views
15 years 8 months ago
Continuous Evaluation of Monochromatic and Bichromatic Reverse Nearest Neighbors
This paper presents a novel algorithm for Incremental and General Evaluation of continuous Reverse Nearest neighbor queries (IGERN, for short). The IGERN algorithm is general as it...
James M. Kang, Mohamed F. Mokbel, Shashi Shekhar, ...
COLT
2001
Springer
14 years 1 months ago
Ultraconservative Online Algorithms for Multiclass Problems
In this paper we study a paradigm to generalize online classification algorithms for binary classification problems to multiclass problems. The particular hypotheses we investig...
Koby Crammer, Yoram Singer
STOC
2004
ACM
107views Algorithms» more  STOC 2004»
14 years 9 months ago
Primal-dual algorithms for deterministic inventory problems
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
Retsef Levi, Robin Roundy, David B. Shmoys
ICML
2010
IEEE
13 years 9 months ago
On the Consistency of Ranking Algorithms
We present a theoretical analysis of supervised ranking, providing necessary and sufficient conditions for the asymptotic consistency of algorithms based on minimizing a surrogate...
John Duchi, Lester W. Mackey, Michael I. Jordan