Sciweavers

472 search results - page 27 / 95
» Linear programming with online learning
Sort
View
COLT
1999
Springer
13 years 12 months ago
On a Generalized Notion of Mistake Bounds
This paper proposes the use of constructive ordinals as mistake bounds in the on-line learning model. This approach elegantly generalizes the applicability of the on-line mistake ...
Sanjay Jain, Arun Sharma
CORR
2006
Springer
130views Education» more  CORR 2006»
13 years 7 months ago
Genetic Programming for Kernel-based Learning with Co-evolving Subsets Selection
Abstract. Support Vector Machines (SVMs) are well-established Machine Learning (ML) algorithms. They rely on the fact that i) linear learning can be formalized as a well-posed opti...
Christian Gagné, Marc Schoenauer, Mich&egra...
COCOA
2008
Springer
13 years 9 months ago
Stochastic Online Scheduling Revisited
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
Andreas S. Schulz
JMLR
2008
169views more  JMLR 2008»
13 years 7 months ago
Multi-class Discriminant Kernel Learning via Convex Programming
Regularized kernel discriminant analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. Its performance depends on the selection of kernel...
Jieping Ye, Shuiwang Ji, Jianhui Chen
SIGUCCS
2005
ACM
14 years 1 months ago
Developing a synchronous web seminar application for online learning
Many higher education institutions are searching for cost effective tools for the delivery of a feature rich, synchronous online learning environment. While there are several comm...
Michael D. Ciocco, Neil Toporski, Michael Dorris