Algorithmic Learning Theory

9th International Conference, ALT’98, Otzenhausen, Germany, October 8–10, 1998 Proceedings

Michael M. Richter, Carl H. Smith, Rolf Wiehagen, Thomas Zeugmann (Herausgeber)

Buch | Softcover

XI, 444 Seiten

1998 | 1. Softcover reprint of the original 1st ed. 1998
Springer Berlin (Verlag)
978-3-540-65013-3 (ISBN)

Artikel merken

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 Arti cial Intelligence (JSAI) and the University of Kaiserslautern. Thirty-four papers on all aspects of algorithmic learning theory and related areas were submitted, all electronically. Twenty-six papers were accepted by the program committee based on originality, quality, and relevance to the theory of machine learning. Additionally, three invited talks presented by Akira Maruoka of Tohoku University, Arun Sharma of the University of New South Wales, and Stefan Wrobel from GMD, respectively, were featured at the conference. We would like to express our sincere gratitude to our invited speakers for sharing with us their insights on new and exciting developments in their areas of research. This conference is the ninth in a series of annual meetings established in 1990. The ALT series focuses on all areas related to algorithmic learning theory including (but not limited to): the theory of machine learning, the design and analysis of learning algorithms, computational logic of/for machine discovery, inductive inference of recursive functions and recursively enumerable languages, learning via queries, learning by arti cial and biological neural networks, pattern recognition, learning by analogy, statistical learning, Bayesian/MDL estimation, inductive logic programming, robotics, application of learning to databases, and gene analyses.

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.

Erscheint lt. Verlag	23.9.1998
Reihe/Serie	Lecture Notes in Artificial Intelligence
Reihe/Serie	Lecture Notes in Computer Science
Zusatzinfo	XI, 444 p. 1 illus.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	585 g
Themenwelt	Informatik ► Theorie / Studium ► Algorithmen
Themenwelt	Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik
Schlagworte	Algorithm analysis and problem complexity • Algorithmic Learning • algorithms • Automat • Automata • boolean function • Complexity • Databases • Data Mining • formal language • Formal Languages • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Inductive Inference • Inductive Logic Programming • Knowledge • Künstliche Intelligenz • learning • Learning theory • Logic • Maschinelles Lernen • programming • Racter • Variable
ISBN-10	3-540-65013-X / 354065013X
ISBN-13	978-3-540-65013-3 / 9783540650133
Zustand	Neuware