570 search results - page 52 / 114 » Intrinsic Geometries in Learning |
AAAI
2008
13 years 10 months ago
2008
The recent years have witnessed a surge of interests in semi-supervised learning methods. A common strategy for these algorithms is to require that the predicted data labels shoul...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Traditional Non-Negative Matrix Factorization (NMF) [19] is a successful algorithm for decomposing datasets into basis function that have reasonable interpretation. One problem of...
JIFS
2002
13 years 7 months ago
2002
This work addresses the problem of finding the adjustable parameters of a learning algorithm using Genetic Algorithms. This problem is also known as the model selection problem. In...
SPEECH
1998
13 years 7 months ago
1998
We consider the problem of obtaining a reduced dimension representation of electropalatographic (EPG) data. An unsupervised learning approach based on latent variable modelling is...
COLT
2010
Springer
13 years 5 months ago
2010
Springer
We present a new family of subgradient methods that dynamically incorporate knowledge of the geometry of the data observed in earlier iterations to perform more informative gradie...