3718 search results - page 170 / 744 » On learning with dissimilarity functions |
116
click to vote
PR
2007
14 years 9 months ago
2007
The advantage of a kernel method often depends critically on a proper choice of the kernel function. A promising approach is to learn the kernel from data automatically. In this p...
89
Voted
ICONIP
2009
14 years 8 months ago
2009
It is generally assumed in the traditional formulation of supervised learning that only the outputs data are uncertain. However, this assumption might be too strong for some learni...
73
Voted
PKDD
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Innovations such as optimistic exploration, function approximation, and hierarchical decomposition have helped scale reinforcement learning to more complex environments, ...
ECAI
2008
Springer
14 years 12 months ago
2008
Springer
In this paper, we propose a policy gradient reinforcement learning algorithm to address transition-independent Dec-POMDPs. This approach aims at implicitly exploiting the locality...
JMLR
2006
14 years 10 months ago
2006
Spectral clustering refers to a class of techniques which rely on the eigenstructure of a similarity matrix to partition points into disjoint clusters, with points in the same clu...