Computational learning theory : an introduction

Bibliographic Information

Computational learning theory : an introduction

Martin Anthony & Norman Biggs

(Cambridge tracts in theoretical computer science, 30)

Cambridge University Press, 1997, c1992

1st pbk. ed. (with corrections)

Search this Book/Journal
Note

Bibliographical references: p. [143]-149

Includes index

Description and Table of Contents

Description

Computational learning theory is a subject which has been advancing rapidly in the last few years. The authors concentrate on the probably approximately correct model of learning, and gradually develop the ideas of efficiency considerations. Finally, applications of the theory to artificial neural networks are considered. Many exercises are included throughout, and the list of references is extensive. This volume is relatively self contained as the necessary background material from logic, probability and complexity theory is included. It will therefore form an introduction to the theory of computational learning, suitable for a broad spectrum of graduate students from theoretical computer science and mathematics.

Table of Contents

  • 1. Concepts, hypotheses, learning algorithms
  • 2. Boolean formulae and representations
  • 3. Probabilistic learning
  • 4. Consistent algorithms and learnability
  • 5. Efficient learning I
  • 6. Efficient learning II
  • 7. The VC dimension
  • 8. Learning and the VC dimension
  • 9. VC dimension and efficient learning
  • 10. Linear threshold networks.

by "Nielsen BookData"

Related Books: 1-1 of 1
Details
  • NCID
    BA31132123
  • ISBN
    • 0521599229
  • Country Code
    uk
  • Title Language Code
    eng
  • Text Language Code
    eng
  • Place of Publication
    Cambridge ; New York
  • Pages/Volumes
    157 p.
  • Size
    25 cm
  • Classification
  • Subject Headings
  • Parent Bibliography ID
Page Top