Sciweavers

ML
2007
ACM
153views Machine Learning» more  ML 2007»
13 years 12 months ago
Multi-Class Learning by Smoothed Boosting
AdaBoost.OC has been shown to be an effective method in boosting “weak” binary classifiers for multi-class learning. It employs the Error-Correcting Output Code (ECOC) method ...
Rong Jin, Jian Zhang 0003
ML
2007
ACM
104views Machine Learning» more  ML 2007»
13 years 12 months ago
A general criterion and an algorithmic framework for learning in multi-agent systems
We offer a new formal criterion for agent-centric learning in multi-agent systems, that is, learning that maximizes one’s rewards in the presence of other agents who might also...
Rob Powers, Yoav Shoham, Thuc Vu
ML
2007
ACM
127views Machine Learning» more  ML 2007»
13 years 12 months ago
Density estimation with stagewise optimization of the empirical risk
We consider multivariate density estimation with identically distributed observations. We study a density estimator which is a convex combination of functions in a dictionary and ...
Jussi Klemelä
ML
2007
ACM
13 years 12 months ago
Optimal dyadic decision trees
Gilles Blanchard, Christin Schäfer, Yves Roze...
ML
2007
ACM
13 years 12 months ago
Feature space perspectives for learning the kernel
In this paper, we continue our study of learning an optimal kernel in a prescribed convex set of kernels, [18]. We present a reformulation of this problem within a feature space e...
Charles A. Micchelli, Massimiliano Pontil
ML
2007
ACM
130views Machine Learning» more  ML 2007»
13 years 12 months ago
Interactive learning of node selecting tree transducer
We develop new algorithms for learning monadic node selection queries in unranked trees from annotated examples, and apply them to visually interactive Web information extraction. ...
Julien Carme, Rémi Gilleron, Aurélie...
ML
2007
ACM
13 years 12 months ago
LARS: A learning algorithm for rewriting systems
Rémi Eyraud, Colin de la Higuera, Jean-Chri...
ML
2007
ACM
13 years 12 months ago
Learning deterministic context free grammars: The Omphalos competition
This paper describes the winning entry to the Omphalos context free grammar learning competition. Our approach integrates an information theoretic constituent likelihood measure to...
Alexander Clark