Sciweavers

4930 search results - page 241 / 986
» Learning minimal abstractions
Sort
View
AIED
2009
Springer
16 years 1 months ago
To Elicit Or To Tell: Does It Matter?
Abstract. While high interactivity has been one of the main characteristics of oneon-one human tutoring, a great deal of controversy surrounds the issue of whether interactivity is...
Min Chi, Pamela W. Jordan, Kurt VanLehn, Diane J. ...
IDA
2009
Springer
16 years 1 months ago
Canonical Dual Approach to Binary Factor Analysis
Abstract. Binary Factor Analysis (BFA) is a typical problem of Independent Component Analysis (ICA) where the signal sources are binary. Parameter learning and model selection in B...
Ke Sun, Shikui Tu, David Yang Gao, Lei Xu
189
Voted
CEC
2008
IEEE
16 years 1 months ago
The simplest evolution/learning hybrid: LEM with KNN
Abstract— The Learnable Evolution Model (LEM) was introduced by Michalski in 2000, and involves interleaved bouts of evolution and learning. Here we investigate LEM in (we think)...
Guleng Sheri, David W. Corne
ICML
1999
IEEE
16 years 7 months ago
Lazy Bayesian Rules: A Lazy Semi-Naive Bayesian Learning Technique Competitive to Boosting Decision Trees
Lbr is a lazy semi-naive Bayesian classi er learning technique, designed to alleviate the attribute interdependence problem of naive Bayesian classi cation. To classify a test exa...
Zijian Zheng, Geoffrey I. Webb, Kai Ming Ting
EH
1999
IEEE
351views Hardware» more  EH 1999»
15 years 11 months ago
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
Marek A. Perkowski, Alan Mishchenko, Anatoli N. Ch...