Skip to main content
SpringerLink
Log in

Algorithmic Learning Theory

8th International Workshop, ALT '97, Sendai, Japan, October 6-8, 1997. Proceedings

  • Conference proceedings
  • © 1997

Overview

Editors:
  1. Ming Li
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Akira Maruoka
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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

Included in the following conference series:

Conference proceedings info: ALT 1997.

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

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • 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

Table of contents (30 papers)

  1. Front Matter

    Download chapter PDF

  2. Program error detection/correction: Turning PAC learning into Perfect learning

    • Manuel Blum
    Pages 1-1

  3. Team learning as a game

    • Andris Ambainis, Kalvis ApsÄ«tis, RÅ«siņš freivalds, William Gasarch, Carl H. Smith
    Pages 2-17

  4. Inferability of recursive real-valued functions

    • Eiju Hirowatari, Setsuo Arikawa
    Pages 18-31

  5. Learning of R.E. Languages from good examples

    • Sanjay Jain, Steffen Lange, Jochen Nessel
    Pages 32-47

  6. Identifiability of subspaces and homomorphic images of zero-reversible languages

    • Satoshi Kobayashi, Takashi Yokomori
    Pages 48-61

  7. On exploiting knowledge and concept use in learning theory

    • Leonard Pitt
    Pages 62-84

  8. Partial occam's razor and its applications

    • Carlos Domingo, Tatsuie Tsukiji, Osamu Watanabe
    Pages 85-99

  9. Derandomized learning of boolean functions

    • Meera Sitharam, Timothy Straney
    Pages 100-115

  10. Learning DFA from simple examples

    • Rajesh Parekh, Vasant Honavar
    Pages 116-131

  11. PAC learning under helpful distributions

    • François Denis, Rémi Gilleron
    Pages 132-145

  12. PAC learning using Nadaraya-Watson estimator based on orthonormal systems

    • Hongzhu Qiao, Nageswara S. V. Rao, V. Protopopescuz
    Pages 146-160

  13. Monotone extensions of boolean data sets

    • Endre Borosl, Toshihide Ibaraki, Kazuhisa Makino
    Pages 161-175

  14. Classical Brouwer-Heyting-Kolmogorov interpretation

    • Masahiko Sato
    Pages 176-196

  15. Inferring a system from examples with time passage

    • Yasuhito Mukouchi
    Pages 197-211

  16. Polynomial time inductive inference of regular term tree languages from positive data

    • Satoshi Matsumoto, Yukiko Hayashi, Takayoshi Shoudai
    Pages 212-227

  17. Synthesizing noise-tolerant language learners

    • John Case, Sanjay Jain, Arun Sharma
    Pages 228-243

  18. Effects of Kolmogorov complexity present in inductive inference as well

    • Andris Ambainis, Kalvis ApsÄ«tis, Cristian Calude, RÅ«siņš Freivalds, Marek Karpinski, Tomas Larfeldt et al.
    Pages 244-259

  19. Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries

    • Thomas Erlebach, Peter Rossmanith, Hans Stadtherr, Angelika Steger, Thomas Zeugmann
    Pages 260-276

  20. Oracles in Σ 2 p are sufficient for exact learning

    • Johannes Köbler, Wolfgang Lindner
    Pages 277-290
Back to top

Other volumes

  1. Algorithmic Learning Theory

Keywords

About this book

This book constitutes the refereed proceedings of the 8th International Workshop on Algorithmic Learning Theory, ALT'97, held in Sendai, Japan, in October 1997.
The volume presents 26 revised full papers selected from 42 submissions. Also included are three invited papers by leading researchers. Among the topics addressed are PAC learning, learning algorithms, inductive learning, inductive inference, learning from examples, game-theoretical aspects, decision procedures, language learning, neural algorithms, and various other aspects of computational learning theory.

Bibliographic Information

  • Book Title: Algorithmic Learning Theory

  • Book Subtitle: 8th International Workshop, ALT '97, Sendai, Japan, October 6-8, 1997. Proceedings

  • Editors: Ming Li, Akira Maruoka

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/3-540-63577-7

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1997

  • Softcover ISBN: 978-3-540-63577-2Published: 17 September 1997

  • eBook ISBN: 978-3-540-69602-5Published: 08 July 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: XIV, 470

  • Topics: Artificial Intelligence, Mathematical Logic and Formal Languages

Publish with us

Policies and ethics

Back to top

Search

Navigation