Algorithmic learning theory. 10th international conference, ALT '99, Tokyo, Japan, December 6--8, 1999. Proceedings (Q1960339)

The articles of mathematical interest will be reviewed individually. The preceding conference (9th, 1998) has been indicated (see Zbl 0898.00031). Indexed articles: \textit{Yamanishi, Kenji}, Extended stochastic complexity and minimax relative loss analysis, 26-38 [Zbl 0949.68075] \textit{Watanabe, Sumio}, Algebraic analysis for singular statistical estimation, 39-50 [Zbl 0949.68126] \textit{Fukumizu, Kenji}, Generalization error of linear neural networks in unidentifiable cases, 51-62 [Zbl 0949.68127] \textit{Wiedermann, Jiří}, The computational limits to the cognitive power of the neuroidal tabula rasa, 63-76 [Zbl 0949.68128] \textit{Balcázar, José L.; Castro, Jorge; Guijarro, David; Simon, Hans-Ulrich}, The consistency dimension and distribution-dependent learning from queries (Extended abstract), 77-92 [Zbl 0949.68076] \textit{Mitchell, Andrew; Scheffer, Tobias; Sharma, Arun; Stephan, Frank}, The VC-dimension of subclasses of pattern languages, 93-105 [Zbl 0949.68092] \textit{Evgeniou, Theodoros; Pontil, Massimiliano}, On the \(V_\gamma\) dimension for regression in reproducing kernel Hilbert spaces, 106-117 [Zbl 0949.68129] \textit{Lange, Steffen; Grieser, Gunter}, On the strength of incremental learning, 118-131 [Zbl 0951.68127] \textit{Rossmanith, Peter}, Learning from random text, 132-144 [Zbl 0949.68130] \textit{Watson, Phil}, Inductive learning with corroboration, 145-156 [Zbl 0949.68131] \textit{Hirata, Kouichi}, Flattening and implication, 157-168 [Zbl 0949.68042] \textit{Sasaki, Yutaka}, Induction of logic programs based on \(\psi\)-terms, 169-181 [Zbl 0949.68043] \textit{Nock, Richard}, Complexity in the case against accuracy: When building one function-free Horn clause is as hard as any, 182-193 [Zbl 0949.68077] \textit{Morita, Nobuhiro; Haraguchi, Makoto; Okubo, Yoshiaki}, A method of similarity-driven knowledge revision for type specializations, 194-205 [Zbl 0955.68107] \textit{Bshouty, Nader H.; Eiron, Nadav; Kushilevitz, Eyal}, PAC learning with nasty noise, 206-218 [Zbl 0956.68518] \textit{Cheung, Dennis}, Learning real polynomials with a Turing machine, 231-240 [Zbl 0949.68078] \textit{Domingo, Carlos}, Faster near-optimal reinforcement learning: Adding adaptiveness to the \(E^3\) algorithm, 241-251 [Zbl 0955.68092] \textit{Rifkin, Ryan; Pontil, Massimiliano; Verri, Alessandro}, A note on support vector machine degeneracy, 252-263 [Zbl 0949.68079] \textit{Nessel, Jochen}, Learnability of enumerable classes of recursive functions from ``typical'' examples, 264-275 [Zbl 0947.03059] \textit{Stephan, Frank; Zeugmann, Thomas}, On the uniform learnability of approximations to non-recursive functions, 276-290 [Zbl 0947.03060] \textit{Hermo, Montserrat; Lavín, Víctor}, Learning minimal covers of functional dependencies with queries, 291-300 [Zbl 0955.68040] \textit{Dalmau, Víctor}, Boolean formulas are hard to learn for most gate bases, 301-312 [Zbl 0955.68093] \textit{Guijarro, David; Tarui, Jun; Tsukiji, Tatsuie}, Finding relevant variables in PAC model with membership queries, 313-322 [Zbl 0955.68094] \textit{Kalnishkan, Yuri}, General linear relations among different types of predictive complexity, 323-334 [Zbl 0952.68069] \textit{Takimoto, Eiji; Warmuth, Manfred K.}, Predicting nearly as well as the best pruning of a planar decision graph, 335-346 [Zbl 0952.68127] \textit{Goldman, Sally A.; Kwek, Stephen S.}, On learning unions of pattern languages and tree patterns, 347-363 [Zbl 0949.68132]