Sciweavers

187 search results - page 20 / 38
» Bounding the cost of learned rules
Sort
View
EUROCOLT
1999
Springer
14 years 21 days ago
Averaging Expert Predictions
We consider algorithms for combining advice from a set of experts. In each trial, the algorithm receives the predictions of the experts and produces its own prediction. A loss func...
Jyrki Kivinen, Manfred K. Warmuth
IJCAI
1993
13 years 9 months ago
Learning Decision Lists over Tree Patterns and Its Application
This paper introduces a new concept, a decision tree (or list) over tree patterns, which is a natural extension of a decision tree (or decision list), for dealing with tree struct...
Satoshi Kobayashi, Koichi Hori, Setsuo Ohsuga
AAI
2005
117views more  AAI 2005»
13 years 8 months ago
Machine Learning in Hybrid Hierarchical and Partial-Order Planners for Manufacturing Domains
The application of AI planning techniques to manufacturing systems is being widely deployed for all the tasks involved in the process, from product design to production planning an...
Susana Fernández, Ricardo Aler, Daniel Borr...
PKDD
2010
Springer
169views Data Mining» more  PKDD 2010»
13 years 6 months ago
Efficient and Numerically Stable Sparse Learning
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...
Sihong Xie, Wei Fan, Olivier Verscheure, Jiangtao ...
TALG
2008
93views more  TALG 2008»
13 years 8 months ago
Limitations of cross-monotonic cost-sharing schemes
A cost-sharing scheme is a set of rules defining how to share the cost of a service (often computed by solving a combinatorial optimization problem) amongst serviced customers. A ...
Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirro...