Sciweavers

1419 search results - page 88 / 284
» Approximation Methods for Supervised Learning
Sort
View
111
Voted
ML
2006
ACM
163views Machine Learning» more  ML 2006»
15 years 13 days ago
Extremely randomized trees
Abstract This paper proposes a new tree-based ensemble method for supervised classification and regression problems. It essentially consists of randomizing strongly both attribute ...
Pierre Geurts, Damien Ernst, Louis Wehenkel
98
Voted
IWANN
1999
Springer
15 years 4 months ago
Using Temporal Neighborhoods to Adapt Function Approximators in Reinforcement Learning
To avoid the curse of dimensionality, function approximators are used in reinforcement learning to learn value functions for individual states. In order to make better use of comp...
R. Matthew Kretchmar, Charles W. Anderson
FORTE
2004
15 years 1 months ago
Symbolic Diagnosis of Partially Observable Concurrent Systems
Abstract. Monitoring large distributed concurrent systems is a challenging task. In this paper we formulate (model-based) diagnosis by means of hidden state history reconstruction,...
Thomas Chatain, Claude Jard
SAC
2009
ACM
15 years 7 months ago
Evaluating algorithms that learn from data streams
In the past years, the theory and practice of machine learning and data mining have been focused on static and finite data sets from where learning algorithms generate a static m...
João Gama, Pedro Pereira Rodrigues, Raquel ...
116
Voted
ECCV
2010
Springer
15 years 2 months ago
Inter-Camera Association of Multi-Target Tracks by On-line Learned Appearance Affinity Models
We propose a novel system for associating multi-target tracks across multiple non-overlapping cameras by an on-line learned discriminative appearance affinity model. Collecting rel...