Sciweavers

17 search results - page 3 / 4
» Ultraconservative Online Algorithms for Multiclass Problems
Sort
View
ACL
1998
13 years 7 months ago
Part of Speech Tagging Using a Network of Linear Separators
We present an architecture and an on-line learning algorithm and apply it to the problem of part-ofspeech tagging. The architecture presented, SNOW, is a network of linear separat...
Dan Roth, Dmitry Zelenko
CVPR
2010
IEEE
14 years 2 months ago
Online-Batch Strongly Convex Multi Kernel Learning
Several object categorization algorithms use kernel methods over multiple cues, as they offer a principled approach to combine multiple cues, and to obtain state-of-theart perform...
Francesco Orabona, Jie Luo, Barbara Caputo
JMLR
2008
230views more  JMLR 2008»
13 years 6 months ago
Exponentiated Gradient Algorithms for Conditional Random Fields and Max-Margin Markov Networks
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
Michael Collins, Amir Globerson, Terry Koo, Xavier...
NIPS
1997
13 years 7 months ago
Relative Loss Bounds for Multidimensional Regression Problems
We study on-line generalized linear regression with multidimensional outputs, i.e., neural networks with multiple output nodes but no hidden nodes. We allow at the final layer tra...
Jyrki Kivinen, Manfred K. Warmuth
SAC
2004
ACM
13 years 11 months ago
Forest trees for on-line data
This paper presents an hybrid adaptive system for induction of forest of trees from data streams. The Ultra Fast Forest Tree system (UFFT) is an incremental algorithm, with consta...
João Gama, Pedro Medas, Ricardo Rocha