求书 An Introduction to Computational Learning Theory

相似文件 换一批

是 否 +2 论坛币

k人 参与回答

经管之家送您一份

应届毕业生专属福利!

求职就业群

赵安豆老师微信：zhaoandou666

经管之家联合CDA

送您一个全额奖学金名额~ !

立即领取

感谢您参与论坛问题回答

经管之家送您两个论坛币！

+2 论坛币

求书
An Introduction to Computational Learning Theory
Please refer to
http://mitpress.mit.edu/catalog/ ... ttype=2&tid=7334
http://www.amazon.com/Introduction-Computational-Learning-Theory/dp/0262111934

An Introduction to Computational Learning Theory
Michael J. Kearns and Umesh V. Vazirani


希望有人能够提供。

谢谢...

Rgds
JIA

扫码加我 拉你入群

请注明：姓名-公司-职位

以便审核进群资格，未注明则拒绝

分享0 收藏2 回帖

关键词：introduction Computation troduction Learning earning

good luck!

多谢！！！
但是，可是，但可是，可但是...

这个attachment怎么不是.pdf啊？
有什么方法可以转一下么？

怎么又是mit

我真是找了好久才找到，多谢楼主了，非常感激！

5# idiotisme 经验值不够不能下载  真麻烦

这个论坛的积分制度真是恶心

Product Description
Emphasizing issues of computational efficiency, Michael Kearns and Umesh Vazirani introduce a number of central topics in computational learning theory for researchers and students in artificial intelligence, neural networks, theoretical computer science, and statistics. Computational learning theory is a new and rapidly expanding area of research that examines formal models of induction with the goals of discovering the common methods underlying efficient learning algorithms and identifying the computational impediments to learning. Each topic in the book has been chosen to elucidate a general principle, which is explored in a precise formal setting. Intuition has been emphasized in the presentation to make the material accessible to the nontheoretician while still providing precise arguments for the specialist. This balance is the result of new proofs of established theorems, and new presentations of the standard proofs. The topics covered include the motivation, definitions, and fundamental results, both positive and negative, for the widely studied L. G. Valiant model of Probably Approximately Correct Learning; Occam's Razor, which formalizes a relationship between learning and data compression; the Vapnik-Chervonenkis dimension; the equivalence of weak and strong learning; efficient learning in the presence of noise by the method of statistical queries; relationships between learning and cryptography, and the resulting computational limitations on efficient learning; reducibility between learning problems; and algorithms for learning finite automata from active experimentation.
About the Author
Michael J. Kearns is a Member of Technical Staff at AT&T Bell Laboratoies in Murray Hill, New Jersey. Umesh V. Vazirani is an Associate Professor of Computer Science at the University of California at Berkeley.
Product Details

    * Hardcover: 221 pages
    * Publisher: The MIT Press (August 15, 1994)
    * Language: English
    * ISBN-10: 0262111934
    * ISBN-13: 978-0262111935
    * Product Dimensions: 9.3 x 7.4 x 0.7 inches

抱歉，您的 论坛币 不足，无法下载。  真tm恶心

asdfasdfasdfasdf