Sciweavers

270 search results - page 30 / 54
» Incremental Dependency Parsing Using Online Learning
Sort
View
ICML
2007
IEEE
14 years 8 months ago
Exponentiated gradient algorithms for log-linear structured prediction
Conditional log-linear models are a commonly used method for structured prediction. Efficient learning of parameters in these models is therefore an important problem. This paper ...
Amir Globerson, Terry Koo, Xavier Carreras, Michae...
JMLR
2012
11 years 10 months ago
Beyond Logarithmic Bounds in Online Learning
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
Francesco Orabona, Nicolò Cesa-Bianchi, Cla...
EACL
2006
ACL Anthology
13 years 9 months ago
Discriminative Sentence Compression with Soft Syntactic Evidence
We present a model for sentence compression that uses a discriminative largemargin learning framework coupled with a novel feature set defined on compressed bigrams as well as dee...
Ryan T. McDonald
KDD
2003
ACM
243views Data Mining» more  KDD 2003»
14 years 8 months ago
Accurate decision trees for mining high-speed data streams
In this paper we study the problem of constructing accurate decision tree models from data streams. Data streams are incremental tasks that require incremental, online, and any-ti...
João Gama, Pedro Medas, Ricardo Rocha
VLSISP
2002
124views more  VLSISP 2002»
13 years 7 months ago
Agglomerative Learning Algorithms for General Fuzzy Min-Max Neural Network
In this paper two agglomerative learning algorithms based on new similarity measures defined for hyperbox fuzzy sets are proposed. They are presented in a context of clustering and...
Bogdan Gabrys