360 search results - page 30 / 72 » Learning Evaluation Functions for Large Acyclic Domains |
ICML
2007
IEEE
14 years 9 months ago
2007
IEEE
This paper investigates compression of 3D objects in computer graphics using manifold learning. Spectral compression uses the eigenvectors of the graph Laplacian of an object'...
KCAP
2009
ACM
14 years 3 months ago
2009
ACM
As computational learning agents move into domains that incur real costs (e.g., autonomous driving or financial investment), it will be necessary to learn good policies without n...
PKDD
2009
Springer
14 years 3 months ago
2009
Springer
The goal of approximate policy evaluation is to “best” represent a target value function according to a specific criterion. Temporal difference methods and Bellman residual m...
APIN
2006
13 years 8 months ago
2006
It is not an easy task to know a priori the most appropriate fuzzy sets that cover the domains of quantitative attributes for fuzzy association rules mining. In general, it is unre...
NIPS
1997
13 years 10 months ago
1997
Singular value decomposition (SVD) can be viewed as a method for unsupervised training of a network that associates two classes of events reciprocally by linear connections throug...