1859 search results - page 149 / 372 » Using Problems to Learn Service-Oriented Computing |
160
click to vote
JCP
2007
15 years 6 months ago
2007
Abstract— This paper presents i-AA1 , a constructive, incremental learning algorithm for a special class of weightless, self-organizing networks. In i-AA1 , learning consists of ...
183
click to vote
ML
2002
ACM
15 years 5 months ago
2002
ACM
We provide an analytical comparison between discounted and average reward temporal-difference (TD) learning with linearly parameterized approximations. We first consider the asympt...
220
Voted
PR
2007
15 years 5 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...
197
click to vote
WEBI
2010
Springer
15 years 4 months ago
2010
Springer
High-dimensional data usually incur learning deficiencies and computational difficulties. We present a novel semi-supervised dimensionality reduction technique that embeds high-dim...
170
click to vote
BMVC
2010
15 years 4 months ago
2010
We present a framework for the reduction of dimensionality of a data set via manifold learning. Using the building blocks of local hyperplanes we show how a global manifold can be...