Algorithmic Learning Theory 9th International Conference, ALT’98, Otzenhausen, Germany, October 8–10, 1998 Proceedings /
Algorithmic Learning Theory 9th International Conference, ALT’98, Otzenhausen, Germany, October 8–10, 1998 Proceedings / [electronic resource] :
edited by Michael M. Richter, Carl H. Smith, Rolf Wiehagen, Thomas Zeugmann.
- 1st ed. 1998.
- XI, 444 p. 1 illus. online resource.
- Lecture Notes in Artificial Intelligence, 1501 2945-9141 ; .
- Lecture Notes in Artificial Intelligence, 1501 .
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.
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
9783540497301
10.1007/3-540-49730-7 doi
Computer science.
Artificial intelligence.
Machine theory.
Algorithms.
Theory of Computation.
Artificial Intelligence.
Formal Languages and Automata Theory.
Algorithms.
QA75.5-76.95
004.0151
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.
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
9783540497301
10.1007/3-540-49730-7 doi
Computer science.
Artificial intelligence.
Machine theory.
Algorithms.
Theory of Computation.
Artificial Intelligence.
Formal Languages and Automata Theory.
Algorithms.
QA75.5-76.95
004.0151