Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity ...
We present a learning algorithm for non-parametric hidden Markov models with continuous state and observation spaces. All necessary probability densities are approximated using sa...
: One of the key problems in developing standard based adaptive courses is the complexity involved in the design phase, especially when establishing the hooks for the dynamic model...
The REDEEM authoring environment allows teachers to create learning environments from existing computer-based training (CBT) by imposing their pedagogical preferences about how stu...
In this paper we study the problem of classifier learning where the input data contains unjustified dependencies between some data attributes and the class label. Such cases arise...