or
Sign in to turn on 1-Click ordering.
or
Amazon Prime Free Trial required. Sign up when you check out. Learn More
More Buying Choices
Have one to sell? Sell yours here
Computational Learning Theory (Cambridge Tracts in Theoretical Computer Science)
 
 
Tell the Publisher!
I'd like to read this book on Kindle

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Computational Learning Theory (Cambridge Tracts in Theoretical Computer Science) [Paperback]

M. H. G. Anthony (Author), N. Biggs (Author)
4.0 out of 5 stars  See all reviews (2 customer reviews)

List Price: $39.99
Price: $36.75 & this item ships for FREE with Super Saver Shipping. Details
You Save: $3.24 (8%)
  Special Offers Available
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
In Stock.
Ships from and sold by Amazon.com. Gift-wrap available.
Want it delivered Monday, February 6? Choose One-Day Shipping at checkout. Details
Textbook Student FREE Two-Day Shipping for students on millions of items. Learn more

Formats

Amazon Price New from Used from
Hardcover --  
Paperback $36.75  

Book Description

March 13, 1997 0521599229 978-0521599221
Computational learning theory is one of the first attempts to construct a mathematical theory of a cognitive process. It has been a field of much interest and rapid growth in recent years. This text provides a framework for studying a variety of algorithmic processes, such as those currently in use for training artificial neural networks. The authors concentrate on an approximate model for learning and gradually develop the ideas of efficiency considerations. Finally, they consider applications of the theory to artificial neural networks. An abundance of exercises and an extensive list of references round out the text. This volume provides a comprehensive review of the topic, including information drawn from logic, probability, and complexity theory. It forms a solid introduction to the theory of comptutational learning suitable for a broad spectrum of graduate students from theoretical computer science to mathematics.

Special Offers and Product Promotions

  • Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)

Customers Who Viewed This Item Also Viewed


Editorial Reviews

Review

."..a welcome addition to the limited range of literature on computational learning theory, and it should perform a useful service in alerting a wider audience to this interesting and lively area..." Mathematical reviews --This text refers to an out of print or unavailable edition of this title.

Book 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.

Product Details

  • Paperback: 172 pages
  • Publisher: Cambridge University Press (March 13, 1997)
  • Language: English
  • ISBN-10: 0521599229
  • ISBN-13: 978-0521599221
  • Product Dimensions: 9.7 x 6.8 x 0.4 inches
  • Shipping Weight: 13.4 ounces (View shipping rates and policies)
  • Average Customer Review: 4.0 out of 5 stars  See all reviews (2 customer reviews)
  • Amazon Best Sellers Rank: #2,282,077 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

 

Customer Reviews

2 Reviews
5 star:    (0)
4 star:
 (2)
3 star:    (0)
2 star:    (0)
1 star:    (0)
 
 
 
 
 
Average Customer Review
4.0 out of 5 stars (2 customer reviews)
 
 
 
 
Share your thoughts with other customers:
Most Helpful Customer Reviews

1 of 1 people found the following review helpful:
4.0 out of 5 stars Very short but good introduction to the field, August 16, 2000
This review is from: Computational Learning Theory (Cambridge Tracts in Theoretical Computer Science) (Paperback)
This book gives a good introduction to the mathematical modeling of cognition and does so with a level of mathematics that is very accessible to a typical graduate student in computer science or psychology. The book could have been written using tools from measure theory but luckily it was not for a book at an introductory level. The concept of probably approximately correct is introduced early on in the third chapter of the book with efficient learning given later on in Chapter 5. Chapter 7, the best chapter of the book, discusses the idea of VC dimension, which has had many applications, such as network stability and optimization. VC dimension plays the pre-dominant theme in the rest of the book, with the book ending with an application to neural networks. There are short problem sets at the end of the chapters, and these are useful for more understanding of the concepts in the book. A very interesting book and worth the price.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No


0 of 2 people found the following review helpful:
4.0 out of 5 stars Simple introduction, September 18, 2001
By A Customer
provide a good and easy to understand introduction to the subject
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No

Share your thoughts with other customers: Create your own review
 
 
 
Only search this product's reviews



Inside This Book (learn more)
First Sentence:
There are many types of acitivity which are commonly known as 'learning'. Read the first page
Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
consistent learning algorithm, optimal sample complexity, polynomial representation size, shortest monomial, pac learning algorithm, potential learnability, boolean perceptron, linear threshold network, pac property, finite hypothesis space, threshold machine, randomised algorithm, standard learning algorithm, running time polynomial, given training sample, boolean spaces, binomial numbers, pac learnable, linear threshold function, output hypotheses, real hypothesis, computation nodes, output hypothesis, consistent algorithm, consistent hypothesis
Key Phrases - Capitalized Phrases (CAPs): (learn more)
Sauer's Lemma, Proof Suppose, Computational Learning Theory, Proof Let, Complexity Theory
New!
Books on Related Topics | Concordance | Text Stats
Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Search Inside This Book:

Citations (learn more)
This book cites 21 books:
See all 21 books this book cites
 
100 books cite this book:
See all 100 books citing this book



What Other Items Do Customers Buy After Viewing This Item?


Suggested Tags from Similar Products

 (What's this?)
Be the first one to add a relevant tag (keyword that's strongly related to this product).
 

Your tags: Add your first tag
 

Sell a Digital Version of This Book in the Kindle Store

If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store. Learn more

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 


Active discussions in related forums
Search Customer Discussions
Search all Amazon discussions
   
Related forums


Listmania!


Create a Listmania! list

So You'd Like to...


Create a guide


Look for Similar Items by Category


Look for Similar Items by Subject