125 search results - page 6 / 25 » Learning with dynamic group sparsity |
ML
1998
ACM
13 years 9 months ago
1998
ACM
Recent algorithmic and theoretical advances in reinforcement learning (RL) have attracted widespread interest. RL algorithmshave appeared that approximatedynamic programming on an ...
ICPR
2008
IEEE
14 years 4 months ago
2008
IEEE
A sparse representation based method is proposed for text detection from scene images. We start with edge information extracted using Canny operator and then group these edge poin...
ECIS
2004
13 years 11 months ago
2004
This article analyzes the impact of a computer simulation (business game) on the users' perceived learning. The theoretical model developed in this paper is derived from the ...
NIPS
2001
13 years 11 months ago
2001
We show that it is possible to extend hidden Markov models to have a countably infinite number of hidden states. By using the theory of Dirichlet processes we can implicitly integ...
ECML
2007
Springer
14 years 4 months ago
2007
Springer
In this paper we study the identification of sparse interaction networks as a machine learning problem. Sparsity means that we are provided with a small data set and a high number...