Algorithmic Learning Theory

丛 书 名：Lecture Notes in Computer Science

版本说明：1

作     者：Sanjay Jain Frank Stephan Rémi Munos Thomas Zeugmann 

I S B N：(纸本) 9783642409349 

出 版 社：Springer Berlin  Heidelberg 

出 版 年：1000年

页      数：XVIII, 397页

主 题 词：Artificial Intelligence Mathematical Logic and Formal Languages Algorithm Analysis and Problem Complexity Computation by Abstract Devices Logics and Meanings of Programs Pattern Recognition 

摘      要：This book constitutes the proceedings of the 24th International Conference on Algorithmic Learning Theory, ALT 2013, held in Singapore in October 2013, and co-located with the 16th International Conference on Discovery Science, DS 2013. The 23 papers presented in this volume were carefully reviewed and selected from 39 submissions. In addition the book contains 3 full papers of invited talks. The papers are organized in topical sections named: online learning, inductive inference and grammatical inference, teaching and learning from queries, bandit theory, statistical learning theory, Bayesian/stochastic learning, and unsupervised/semi-supervised learning.