Algorithmic Learning Theory: 21st International Conference, ALT 2010, Canberra, Australia, October 6-8, 2010. Proceedings | SpringerLink
Skip to main content

Algorithmic Learning Theory

21st International Conference, ALT 2010, Canberra, Australia, October 6-8, 2010. Proceedings

  • Conference proceedings
  • © 2010

Overview

  • unique visibility, state-of-the-art survey,
  • fast-track conference proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 6331)

Part of the book sub series: Lecture Notes in Artificial Intelligence (LNAI)

Included in the following conference series:

Conference proceedings info: ALT 2010.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book JPY 7149
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

This volume contains the papers presented at the 21st International Conf- ence on Algorithmic Learning Theory (ALT 2010), which was held in Canberra, Australia, October 6–8, 2010. The conference was co-located with the 13th - ternational Conference on Discovery Science (DS 2010) and with the Machine Learning Summer School, which was held just before ALT 2010. The tech- cal program of ALT 2010, contained 26 papers selected from 44 submissions and ?ve invited talks. The invited talks were presented in joint sessions of both conferences. ALT 2010 was dedicated to the theoretical foundations of machine learning and took place on the campus of the Australian National University, Canberra, Australia. ALT provides a forum for high-quality talks with a strong theore- cal background and scienti?c interchange in areas such as inductive inference, universal prediction, teaching models, grammatical inference, formal languages, inductive logic programming, query learning, complexity of learning, on-line learning and relative loss bounds, semi-supervised and unsupervised learning, clustering,activelearning,statisticallearning,supportvectormachines,Vapnik- Chervonenkisdimension,probablyapproximatelycorrectlearning,Bayesianand causal networks, boosting and bagging, information-based methods, minimum descriptionlength,Kolmogorovcomplexity,kernels,graphlearning,decisiontree methods, Markov decision processes, reinforcement learning, and real-world - plications of algorithmic learning theory. DS 2010 was the 13th International Conference on Discovery Science and focused on the development and analysis of methods for intelligent data an- ysis, knowledge discovery and machine learning, as well as their application to scienti?c knowledge discovery. As is the tradition, it wasco-located and held in parallel with Algorithmic Learning Theory.

Similar content being viewed by others

Keywords

Table of contents (32 papers)

  1. Editors’ Introduction

  2. Regular Contributions

    1. Statistical Learning

    2. Grammatical Inference and Graph Learning

    3. Probably Approximately Correct Learning

    4. Query Learning and Algorithmic Teaching

Other volumes

  1. Algorithmic Learning Theory

Editors and Affiliations

  • Research School of Information Sciences and Engineering, Australian National University and NICTA, Canberra, Australia

    Marcus Hutter

  • Department of Mathematics, National University of Singapore, Singapore, Republic of Singapore

    Frank Stephan

  • Department of Computer Science, University of London, Royal Holloway, Egham, Surrey, UK

    Vladimir Vovk

  • Division of Computer Science, Hokkaido University, , ,, Japan

    Thomas Zeugmann

Bibliographic Information

Publish with us