Sciweavers

3250 search results - page 245 / 650
» Parameterized Learning Complexity
Sort
View
JCP
2007
121views more  JCP 2007»
15 years 6 months ago
Learning by Discrimination: A Constructive Incremental Approach
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 ...
Christophe G. Giraud-Carrier, Tony R. Martinez
167
Voted
SIGCSE
2002
ACM
128views Education» more  SIGCSE 2002»
15 years 6 months ago
Enhancing the quality of learning and understanding of first-year mathematics for computer science related majors
Most courses on Discrete Mathematics are designed to emphasize problem solving, in general. When the goal is to cover the content, the learning and understanding takes a second pl...
Francis Suraweera
TNN
1998
112views more  TNN 1998»
15 years 6 months ago
A class of competitive learning models which avoids neuron underutilization problem
— In this paper, we study a qualitative property of a class of competitive learning (CL) models, which is called the multiplicatively biased competitive learning (MBCL) model, na...
Clifford Sze-Tsan Choy, Wan-Chi Siu
ICONIP
2009
15 years 4 months ago
Tracking in Reinforcement Learning
Reinforcement learning induces non-stationarity at several levels. Adaptation to non-stationary environments is of course a desired feature of a fair RL algorithm. Yet, even if the...
Matthieu Geist, Olivier Pietquin, Gabriel Fricout
CORR
2010
Springer
148views Education» more  CORR 2010»
15 years 1 months ago
A Unifying View of Multiple Kernel Learning
Recent research on multiple kernel learning has lead to a number of approaches for combining kernels in regularized risk minimization. The proposed approaches include different for...
Marius Kloft, Ulrich Rückert, Peter L. Bartle...