Foundations of Statistical Algorithms

With References to R Packages

Claus Weihs, Olaf Mersmann, Uwe Ligges

$126

Paperback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

Chapman & Hall/CRC
19 June 2019

Probability & statistics; Mathematical & statistical software

Series: Chapman & Hall/CRC Computer Science & Data Analysis

A new and refreshingly different approach to presenting the foundations of statistical algorithms, Foundations of Statistical Algorithms: With References to R Packages reviews the historical development of basic algorithms to illuminate the evolution of today’s more powerful statistical algorithms. It emphasizes recurring themes in all statistical algorithms, including computation, assessment and verification, iteration, intuition, randomness, repetition and parallelization, and scalability. Unique in scope, the book reviews the upcoming challenge of scaling many of the established techniques to very large data sets and delves into systematic verification by demonstrating how to derive general classes of worst case inputs and emphasizing the importance of testing over a large number of different inputs.

Broadly accessible, the book offers examples, exercises, and selected solutions in each chapter as well as access to a supplementary website. After working through the material covered in the book, readers should not only understand current algorithms but also gain a deeper understanding of how algorithms are constructed, how to evaluate new algorithms, which recurring principles are used to tackle some of the tough problems statistical programmers face, and how to take an idea for a new method and turn it into something practically useful.

By: Claus Weihs, Olaf Mersmann, Uwe Ligges
Imprint: Chapman & Hall/CRC
Country of Publication: United Kingdom
Dimensions: Height: 234mm, Width: 156mm,
Weight: 760g
ISBN: 9780367379094
ISBN 10: 0367379090
Series: Chapman & Hall/CRC Computer Science & Data Analysis
Pages: 474
Publication Date: 19 June 2019
Audience: Professional and scholarly , Undergraduate
Format: Paperback
Publisher's Status: Active

Introduction. Computation. Verification. Iteration. Deduction of Theoretical Properties. Randomization. Repetition. Scalability and Parallelization. Bibliography. Index.

Weihs, Claus; Mersmann, Olaf ; Ligges, Uwe