Kernel Methods and Machine Learning

Nonfiction, Computers, Advanced Computing, Engineering, Computer Vision, General Computing, Health & Well Being, Medical
Cover of the book Kernel Methods and Machine Learning by S. Y. Kung, Cambridge University Press
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: S. Y. Kung ISBN: 9781139861892
Publisher: Cambridge University Press Publication: April 17, 2014
Imprint: Cambridge University Press Language: English
Author: S. Y. Kung
ISBN: 9781139861892
Publisher: Cambridge University Press
Publication: April 17, 2014
Imprint: Cambridge University Press
Language: English

Offering a fundamental basis in kernel-based learning theory, this book covers both statistical and algebraic principles. It provides over 30 major theorems for kernel-based supervised and unsupervised learning models. The first of the theorems establishes a condition, arguably necessary and sufficient, for the kernelization of learning models. In addition, several other theorems are devoted to proving mathematical equivalence between seemingly unrelated models. With over 25 closed-form and iterative algorithms, the book provides a step-by-step guide to algorithmic procedures and analysing which factors to consider in tackling a given problem, enabling readers to improve specifically designed learning algorithms, build models for new applications and develop efficient techniques suitable for green machine learning technologies. Numerous real-world examples and over 200 problems, several of which are Matlab-based simulation exercises, make this an essential resource for graduate students and professionals in computer science, electrical and biomedical engineering. Solutions to problems are provided online for instructors.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

Offering a fundamental basis in kernel-based learning theory, this book covers both statistical and algebraic principles. It provides over 30 major theorems for kernel-based supervised and unsupervised learning models. The first of the theorems establishes a condition, arguably necessary and sufficient, for the kernelization of learning models. In addition, several other theorems are devoted to proving mathematical equivalence between seemingly unrelated models. With over 25 closed-form and iterative algorithms, the book provides a step-by-step guide to algorithmic procedures and analysing which factors to consider in tackling a given problem, enabling readers to improve specifically designed learning algorithms, build models for new applications and develop efficient techniques suitable for green machine learning technologies. Numerous real-world examples and over 200 problems, several of which are Matlab-based simulation exercises, make this an essential resource for graduate students and professionals in computer science, electrical and biomedical engineering. Solutions to problems are provided online for instructors.

More books from Cambridge University Press

Cover of the book Understanding the Leitmotif by S. Y. Kung
Cover of the book Monkeys on the Edge by S. Y. Kung
Cover of the book Eigenvalues, Multiplicities and Graphs by S. Y. Kung
Cover of the book The Cambridge Companion to Don DeLillo by S. Y. Kung
Cover of the book Constitutionalism of the Global South by S. Y. Kung
Cover of the book Classical Dynamics by S. Y. Kung
Cover of the book Mosaics in the Medieval World by S. Y. Kung
Cover of the book Rationality in Economics by S. Y. Kung
Cover of the book Bilingual Figurative Language Processing by S. Y. Kung
Cover of the book Planetary Tectonics by S. Y. Kung
Cover of the book Fundamentals of Wireless Communication by S. Y. Kung
Cover of the book Love's Enlightenment by S. Y. Kung
Cover of the book The Skew-Normal and Related Families by S. Y. Kung
Cover of the book The Verb Phrase in English by S. Y. Kung
Cover of the book The Spanish Atlantic World in the Eighteenth Century by S. Y. Kung
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy