Learning Algorithms Theory and Applications - S. Lakshmivarahan - 图书 - Springer-Verlag New York Inc. - 9780387906409 - 1981年11月2日
如封面与标题不符,以标题为准

Learning Algorithms Theory and Applications Softcover Reprint of the Original 1st Ed. 1981 edition

价格
元 376
不含税

远程仓调货

预计送达时间 年7月8日 - 年7月20日
添加至iMusic心愿单

Learning constitutes one of the most important phase of the whole psychological processes and it is essential in many ways for the occurrence of necessary changes in the behavior of adjusting organisms. In a broad sense influence of prior behavior and its consequence upon subsequent behavior is usually accepted as a definition of learning. Till recently learning was regarded as the prerogative of living beings. But in the past few decades there have been attempts to construct learning machines or systems with considerable success. This book deals with a powerful class of learning algorithms that have been developed over the past two decades in the context of learning systems modelled by finite state probabilistic automaton. These algorithms are very simple iterative schemes. Mathematically these algorithms define two distinct classes of Markov processes with unit simplex (of suitable dimension) as its state space. The basic problem of learning is viewed as one of finding conditions on the algorithm such that the associated Markov process has prespecified asymptotic behavior. As a prerequisite a first course in analysis and stochastic processes would be an adequate preparation to pursue the development in various chapters.


280 pages, biography

介质类型 图书     Paperback Book   (平装胶订图书)
已发行 1981年11月2日
ISBN13 9780387906409
出版商 Springer-Verlag New York Inc.
页数 280
商品尺寸 155 × 235 × 16 mm   ·   421 g
语言 英语  

Mere med samme udgiver