Sciweavers

509 search results - page 53 / 102
» Using Learning for Approximation in Stochastic Processes
Sort
View
122
Voted
UAI
2003
15 years 3 months ago
Learning Continuous Time Bayesian Networks
Continuous time Bayesian networks (CTBN) describe structured stochastic processes with finitely many states that evolve over continuous time. A CTBN is a directed (possibly cycli...
Uri Nodelman, Christian R. Shelton, Daphne Koller
ECML
2007
Springer
15 years 6 months ago
Seeing the Forest Through the Trees: Learning a Comprehensible Model from an Ensemble
Abstract. Ensemble methods are popular learning methods that usually increase the predictive accuracy of a classifier though at the cost of interpretability and insight in the deci...
Anneleen Van Assche, Hendrik Blockeel
112
Voted
TNN
1998
96views more  TNN 1998»
15 years 2 months ago
Noise suppressing sensor encoding and neural signal orthonormalization
In this paper we regard first the situation where parallel channels are disturbed by noise. With the goal of maximal information conservation we deduce the conditions for a transf...
Rüdiger W. Brause, M. Rippl
116
Voted
ICA
2007
Springer
15 years 8 months ago
Dictionary Learning for L1-Exact Sparse Coding
We have derived a new algorithm for dictionary learning for sparse coding in the ℓ1 exact sparse framework. The algorithm does not rely on an approximation residual to operate, b...
Mark D. Plumbley
115
Voted
ICDAR
2009
IEEE
15 years 9 months ago
Fast Incremental Learning Strategy Driven by Confusion Reject for Online Handwriting Recognition
In this paper, we present a new incremental learning strategy for handwritten character recognition systems. This learning strategy enables the recognition system to learn “rapi...
Abdullah Almaksour, Éric Anquetil