Algorithmic learning theory : 8th International Workshop, ALT '97 Sendai, Japan, October 6-8, 1997 : proceedings
This book constitutes the refereed proceedings of the 8th International Workshop on Algorithmic Learning Theory, ALT'97, held in Sendai, Japan, in October 1997. The volume presents 26 revised full papers selected from 42 submissions. Also included are three invited papers by leading researchers...
Enregistré dans:
| Hovedforfatter: | |
|---|---|
| Institution som forfatter: | |
| Andre forfattere: | |
| Format: | Livre numérique |
| Sprog: | Anglais |
| Udgivet: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serier: | Lecture notes in computer science. Lecture notes in artificial intelligence
1316 |
| Fag: | |
| Online adgang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Kommentar: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Algorithmic learning theory, 8th international workshop, ALT ±97, Sendai, Japan, October 1997, proceedings, Ming Li, Akira Maruoka (eds.), 1997, Berlin [etc.], Springer, 1 vol. (XI-460 p.), Lecture notes in computer science, 3-540-63577-7 • Algorithmic Learning Theory, Texte imprimé, 9783662203767 |
Indholdsfortegnelse:
- Program error detection/correction: Turning PAC learning into Perfect learning
- Team learning as a game
- Inferability of recursive real-valued functions
- Learning of R.E. Languages from good examples
- Identifiability of subspaces and homomorphic images of zero-reversible languages
- On exploiting knowledge and concept use in learning theory
- Partial occam's razor and its applications
- Derandomized learning of boolean functions
- Learning DFA from simple examples
- PAC learning under helpful distributions
- PAC learning using Nadaraya-Watson estimator based on orthonormal systems
- Monotone extensions of boolean data sets
- Classical Brouwer-Heyting-Kolmogorov interpretation
- Inferring a system from examples with time passage
- Polynomial time inductive inference of regular term tree languages from positive data
- Synthesizing noise-tolerant language learners
- Effects of Kolmogorov complexity present in inductive inference as well
- Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
- Oracles in ? 2 p are sufficient for exact learning
- Exact learning via teaching assistants (Extended abstract)
- An efficient exact learning algorithm for ordered binary decision diagrams
- Probability theory for the Brier game
- Learning and revising theories in noisy domains
- A note on a scale-sensitive dimension of linear bounded functionals in Banach Spaces
- On the relevance of time in neural computation and learning
- A simple algorithm for predicting nearly as well as the best pruning labeled with the best prediction values of a decision tree
- Learning disjunctions of features
- Learning simple deterministic finite-memory automata
- Learning acyclic first-order horn sentences from entailment
- On learning disjunctionsof zero-one threshold functions with queries.