Sciweavers

264 search results - page 3 / 53
» Learning Linearly Separable Languages
Sort
View
COLT
1998
Springer
13 years 9 months ago
Learning One-Variable Pattern Languages in Linear Average Time
A new algorithm for learning one-variable pattern languages is proposed and analyzed with respect to its average-case behavior. We consider the total learning time that takes into...
Rüdiger Reischuk, Thomas Zeugmann
IJON
2002
105views more  IJON 2002»
13 years 5 months ago
Separation of sources using simulated annealing and competitive learning
This paper presents a new adaptive procedure for the linear and non-linear separation of signals with non-uniform, symmetrical probability distributions, based on both simulated a...
Carlos García Puntonet, Ali Mansour, Christ...
ICANN
2009
Springer
13 years 10 months ago
Constrained Learning Vector Quantization or Relaxed k-Separability
Neural networks and other sophisticated machine learning algorithms frequently miss simple solutions that can be discovered by a more constrained learning methods. Transition from ...
Marek Grochowski, Wlodzislaw Duch
PR
2007
139views more  PR 2007»
13 years 4 months ago
Learning the kernel matrix by maximizing a KFD-based class separability criterion
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...
Dit-Yan Yeung, Hong Chang, Guang Dai