Algorithmic Learning Theory: 6th International Workshop, ALT '95, Fukuoka, Japan, October 18 - 20, 1995. Proceedings

by Klaus P. Jantke (Editor), Takeshi Shinohara (Editor), Thomas Zeugmann (Editor)

Overview

This book constitutes the refereed proceedings of the 6th International Workshop on Algorithmic Learning Theory, ALT '95, held in Fukuoka, Japan, in October 1995.

The book contains 21 revised full papers selected from 46 submissions together with three invited contributions. It covers all current areas related to algorithmic learning theory, in particular the theory of machine learning, design and analysis of learning algorithms, computational logic aspects, inductive inference, learning via queries, artificial and biologicial neural network learning, pattern recognition, learning by analogy, statistical learning, inductive logic programming, robot learning, and gene analysis.

Product Details

ISBN-13:	9783540604549
Publisher:	Springer Berlin Heidelberg
Publication date:	11/10/1995
Series:	Lecture Notes in Computer Science , #997
Edition description:	1995
Pages:	324
Product dimensions:	6.10(w) x 9.25(h) x 0.36(d)

Table of Contents

Grammatical inference: An old and new paradigm.- Efficient learning of real time one-counter automata.- Learning strongly deterministic even linear languages from positive examples.- Language learning from membership queries and characteristic examples.- Learning unions of tree patterns using queries.- Inductive constraint logic.- Incremental learning of logic programs.- Learning orthogonal F-Horn formulas.- Learning nested differences in the presence of malicious noise.- Learning sparse linear combinations of basis functions over a finite domain.- Inferring a DNA sequence from erroneous copies (abstract).- Machine induction without revolutionary paradigm shifts.- Probabilistic language learning under monotonicity constraints.- Noisy inference and oracles.- Simulating teams with many conjectures.- Complexity of network training for classes of Neural Networks.- Learning ordered binary decision diagrams.- Simple PAC learning of simple decision lists.- The complexity of learning minor closed graph classes.- Technical and scientific issues of KDD (or: Is KDD a science?).- Analogical logic program synthesis algorithm that can refute inappropriate similarities.- Reflecting and self-confident inductive inference machines.- On approximately identifying concept classes in the limit.- Application of kolmogorov complexity to inductive inference with limited memory.