Sciweavers

ECML
1995
Springer
13 years 11 months ago
Simplifying Decision Trees by Pruning and Grafting: New Results (Extended Abstract)
Floriana Esposito, Donato Malerba, Giovanni Semera...
COLT
1995
Springer
13 years 11 months ago
Predictive Hebbian Learning
Terrence J. Sejnowski, Peter Dayan, P. Read Montag...
COLT
1995
Springer
13 years 11 months ago
On the Learnability and Usage of Acyclic Probabilistic Finite Automata
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
Dana Ron, Yoram Singer, Naftali Tishby
COLT
1995
Springer
13 years 11 months ago
Exactly Learning Automata with Small Cover Time
We present algorithms for exactly learning unknown environments that can be described by deterministic nite automata. The learner performs a walk on the target automaton, where at...
Dana Ron, Ronitt Rubinfeld
COLT
1995
Springer
13 years 11 months ago
Being Taught can be Faster than Asking Questions
Ronald L. Rivest, Yiqun Lisa Yin
COLT
1995
Springer
13 years 11 months ago
Regression NSS: An Alternative to Cross Validation
The Noise Sensitivity Signature (NSS), originally introduced by Grossman and Lapedes (1993), was proposed as an alternative to cross validation for selecting network complexity. I...
Michael P. Perrone, Brian S. Blais