Probability and statistics for computer science (Record no. 34069)

000 -LEADER
fixed length control field a
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 250711b xxu||||| |||| 00| 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783319877884
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 004.0727
Item number FOR
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Forsyth, David
245 ## - TITLE STATEMENT
Title Probability and statistics for computer science
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Name of publisher, distributor, etc Springer,
Date of publication, distribution, etc 2018.
Place of publication, distribution, etc Cham :
300 ## - PHYSICAL DESCRIPTION
Extent xxiv, 367 p. ;
Other physical details ill., (Chifly col.),
Dimensions 28 cm.
365 ## - TRADE PRICE
Price amount 49.99
Price type code
Unit of pricing 100.40
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc Includes index.
520 ## - SUMMARY, ETC.
Summary, etc This textbook is aimed at computer science undergraduates late in sophomore or early in junior year, supplying a comprehensive background in qualitative and quantitative data analysis, probability, random variables, and statistical methods, including machine learning. With careful treatment of topics that fill the curricular needs for the course, Probability and Statistics for Computer Science features: • A treatment of random variables and expectations dealing primarily with the discrete case. • A practical treatment of simulation, showing how many interesting probabilities and expectations can be extracted, with particular emphasis on Markov chains. • A clear but crisp account of simple point inference strategies (maximum likelihood; Bayesian inference) in simple contexts. This is extended to cover some confidence intervals, samples and populations for random sampling with replacement, and the simplest hypothesis testing. • A chapter dealing with classification, explaining why it’s useful; how to train SVM classifiers with stochastic gradient descent; and how to use implementations of more advanced methods such as random forests and nearest neighbors. • A chapter dealing with regression, explaining how to set up, use and understand linear regression and nearest neighbors regression in practical problems. • A chapter dealing with principal components analysis, developing intuition carefully, and including numerous practical examples. There is a brief description of multivariate scaling via principal coordinate analysis. • A chapter dealing with clustering via agglomerative methods and k-means, showing how to build vector quantized features for complex signals. Illustrated throughout, each main chapter includes many worked examples and other pedagogical elements such as boxed Procedures, Definitions, Useful Facts, and Remember This (short tips). Problems and Programming Exercises are at the end of each chapter, with a summary of what the reader should know. Instructor resources include a full set of model solutions for all problems, and an Instructor's Manual with accompanying presentation slides. This textbook is aimed at computer science undergraduates late in sophomore or early in junior year, supplying a comprehensive⡣kground in qualitative and quantitative data analysis, probability, random variables, and statistical methods, including machine learning. With careful treatment of topics that fill the curricular needs for the course, Probability and Statistics for Computer Science楡tures: ࠁ treatment of random variables and expectations dealing primarily with the discrete case. ࠁಡctical treatment of simulation, showing how many interesting probabilities and expectations can be extracted, with particular emphasis onrkov chains. ࠁ clear but crisp account of simple point inference strategies (maximum likelihood;⡹yesian inference) in simple contexts. This is extended to cover some confidence intervals, samples and populations for random sampling with replacement, and the simplest hypothesis testing. ࠁ chapter dealing with classification, explaining why its useful; how to train SVM classifiers with stochastic gradient descent; and how to use implementations of more advanced methods㵣h as⡮dom forests and nearest neighbors. ࠁ chapter dealing with regression, explaining how to set up, use and understand linear regression and nearest neighbors regression in practical problems. ࠁ chapter dealing with principal components analysis, developing intuition carefully, and including numerous practical examples. There is a brief description of multivariate scaling via principal coordinate analysis. ࠁ chapter dealing with clustering via agglomerative methods and k-means, showing how to build vector quantized features for complex signals. Illustrated throughout, each main chapter includes many worked examples and other pedagogical elements such as boxed Procedures, Definitions, Useful Facts, and Remember This (short tips). Problems and Programming Exercises are at the end of each chapter, with a summary of what the reader should know. ɮstructor resources includeᠦull set of model solutions forᬬಯblems, and an Instructor's Manual with accompanying presentation slides.
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer Science
Topical term or geographic name as entry element Statistical Methods
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme
Item type Books
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Permanent location Current location Date acquired Source of acquisition Cost, normal purchase price Full call number Barcode Date last seen Koha item type
          DAU DAU 2025-05-26 KB 5019.00 004.0727 FOR 035592 2025-07-11 Books

Powered by Koha