TOP
💡 邁向小一的第一步!給孩子一本「查得到自信」的專屬辭典,輕鬆跨越閱讀關卡!🚀
縮小範圍
商品類型
商品定價
出版日期
出版社/品牌
搜尋結果 /

Inductive Inference for Large Scale Text Classification

2
1 / 1
Neural Network Learning:Theoretical Foundations
90 折
出版日:2009/09/03 作者:Martin Anthony  出版社:Cambridge Univ Pr  裝訂:平裝
This book describes theoretical advances in the study of artificial neural networks. It explores probabilistic models of supervised learning problems, and addresses the key statistical and computational questions. Research on pattern classification with binary-output networks is surveyed, including a discussion of the relevance of the Vapnik–Chervonenkis dimension, and calculating estimates of the dimension for several neural network models. A model of classification by real-output networks is developed, and the usefulness of classification with a 'large margin' is demonstrated. The authors explain the role of scale-sensitive versions of the Vapnik–Chervonenkis dimension in large margin classification, and in real prediction. They also discuss the computational complexity of neural network learning, describing a variety of hardness results, and outlining two efficient constructive learning algorithms. The book is self-contained and is intended to be accessible to researchers and gradua
優惠價: 9 2515
無庫存
出版日:1999/11/04 作者:Martin Anthony  出版社:Cambridge Univ Pr  裝訂:精裝
This book describes theoretical advances in the study of artificial neural networks. It explores probabilistic models of supervised learning problems, and addresses the key statistical and computational questions. Research on pattern classification with binary-output networks is surveyed, including a discussion of the relevance of the Vapnik–Chervonenkis dimension, and calculating estimates of the dimension for several neural network models. A model of classification by real-output networks is developed, and the usefulness of classification with a 'large margin' is demonstrated. The authors explain the role of scale-sensitive versions of the Vapnik–Chervonenkis dimension in large margin classification, and in real prediction. They also discuss the computational complexity of neural network learning, describing a variety of hardness results, and outlining two efficient constructive learning algorithms. The book is self-contained and is intended to be accessible to researchers and gradua
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
  • 2
    1

暢銷榜

客服中心

收藏

會員專區