Algorithmic Learning Theory Book

	String pattern discovery	1
	Applications of regularized least squares to classification problems	14
	Probabilistic inductive logic programming	19
	Hidden Markov modelling techniques for haplotype analysis	37
	Learning, logic, and probability : a unified view	53
	Learning languages from positive data and negative counterexamples	54
	Inductive inference of term rewriting systems from positive data	69
	On the data consumption benefits of accepting increased uncertainty	83
	Comparison of query learning and gold-style learning in dependence of the hypothesis space	99
	Learning r-of-k functions by boosting	114
	Boosting based on divide and merge	127
	Learning boolean functions in AC[superscript 0] on attribute and classification noise	142
	Decision trees : more theoretical justification for practical algorithms	156
	Application of classical nonparametric predictors to learning conditionally I.I.D. data	171
	Complexity of pattern classes and Lipschitz property	181
	On kernels, margins, and low-dimensional mappings	194
	Estimation of the data region using extreme-value distributions	206
	Maximum entropy principle in non-ordered setting	221
	Universal convergence of semimeasures on individual random sequences	234
	A criterion for the existence of predictive complexity for binary games	249
	Full information game with gains and losses	264
	Prediction with expert advice by following the perturbed leader for general weights	279
	On the convergence speed of MDL predictions for Bernoulli sequences	294
	Relative loss bounds and polynomial-time predictions for the K-LMS-NET algorithm	309
	On the complexity of working set selection	324
	Convergence of a generalized gradient selection approach for the decomposition method	338
	Newton diagram and stochastic complexity in mixture of binomial distributions	350
	Learnability of relatively quantified generalized formulas	365
	Learning languages generated by elementary formal systems and its application to SH languages	380
	New revision algorithms	395
	The subsumption lattice and query learning	410
	Learning of ordered tree languages with height-bounded variables using queries	425
	Learning tree languages from positive examples and membership queries	440
	Learning content sequencing in an educational environment according to student needs	454
	Statistical learning in digital wireless communications	464
	A BP-based algorithm for performing Bayesian inference in large perceptron-type networks	479
	Approximate inference in probabilistic models	494