Algorithmic learning theory : 9th international conference, ALT ±98, Otzenhausen, Germany, October 8-10, 1998 : proceedings
This volume contains all the papers presented at the Ninth International Con- rence on Algorithmic Learning Theory (ALT 98), held at the European education centre Europ aisches Bildungszentrum (ebz) Otzenhausen, Germany, October 8{ 10, 1998. The Conference was sponsored by the Japanese Society for A...
সংরক্ষণ করুন:
| সংস্থা লেখক: | |
|---|---|
| অন্যান্য লেখক: | , , |
| বিন্যাস: | Livre numérique |
| ভাষা: | Anglais |
| প্রকাশিত: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| মালা: | Lecture notes in computer science. Lecture notes in artificial intelligence
1501 |
| বিষয়গুলি: | |
| অনলাইন ব্যবহার করুন: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| টীকা: |
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, 9th international conference, ALT ±98, Otzenhausen, Germany, October 8-10, 1998, proceedings, Michael M. Richter, C.H. Smith, R. Wiehagen ... [et al.], 1998, Berlin, Springer, 1 vol. (438 p.), Lecture notes in computer science, 3-540-65013-X • Algorithmic Learning Theory, Texte imprimé, 9783662164655 |
সূচিপত্রের সারণি:
- Editors Introduction
- Editors Introduction
- Inductive Logic Programming and Data Mining
- Scalability Issues in Inductive Logic Programming
- Inductive Inference
- Learning to Win Process-Control Games Watching Game-Masters
- Closedness Properties in EX-Identification of Recursive Functions
- Learning via Queries
- Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries
- Cryptographic Limitations on Parallelizing Membership and Equivalence Queries with Applications to Random Self-Reductions
- Learning Unary Output Two-Tape Automata from Multiplicity and Equivalence Queries
- Computational Aspects of Parallel Attribute-Efficient Learning
- PAC Learning from Positive Statistical Queries
- Prediction Algorithns
- Structured Weight-Based Prediction Algorithms
- Inductive Logic Programming
- Learning from Entailment of Logic Programs with Local Variables
- Logical Aspects of Several Bottom-Up Fittings
- Learnability of Translations from Positive Examples
- Analysis of Case-Based Representability of Boolean Functions by Monotone Theory
- Learning Formal Languages
- Locality, Reversibility, and Beyond: Learning Languages from Positive Data
- Synthesizing Learners Tolerating Computable Noisy Data
- Characteristic Sets for Unions of Regular Pattern Languages and Compactness
- Finding a One-Variable Pattern from Incomplete Data
- A Fast Algorithm for Discovering Optimal String Patterns in Large Text Databases
- Inductive Inference
- A Comparison of Identification Criteria for Inductive Inference of Recursive Real-Valued Functions
- Predictive Learning Models for Concept Drift
- Learning with Refutation
- Comparing the Power of Probabilistic Learning and Oracle Identification Under Monotonicity Constraints
- Learning Algebraic Structures from TextUsing Semantical Knowledge
- Inductive Logic Programming
- Lime: A System for Learning Relations
- Miscellaneous
- On the Sample Complexity for Neural Trees
- Learning Sub-classes of Monotone DNF on the Uniform Distribution
- Using Attribute Grammars for Description of Inductive Inference Search Space
- Towards the Validation of Inductive Learning Systems
- Consistent Polynomial Identification in the Limit.