Foundations of Statistical Algorithms

Regular price €192.20
Quantity:
In stock with our UK publisher. 14-28 days
Delivery/Collection within 10-20 working days
14 days return policy Shipping & Delivery
A01=Claus Weihs
A01=Olaf Mersmann
A01=Uwe Ligges
Age Group_Uncategorized
Age Group_Uncategorized
algorithmic verification
Author_Claus Weihs
Author_Olaf Mersmann
Author_Uwe Ligges
automatic-update
Category1=Non-Fiction
Category=PBT
Category=TQ
Category=UMB
computational statistics
COP=United States
Delivery_Delivery within 10-20 working days
eq_bestseller
eq_computing
eq_isMigrated=0
eq_isMigrated=2
eq_nobargain
eq_non-fiction
iterative methods
Language_English
large data analysis
PA=Available
parallelized computation
Price_€100 and above
PS=Active
scalable algorithm design for researchers
softlaunch
statistical model assessment

Product details

  • ISBN 9781439878859
  • Weight: 960g
  • Dimensions: 156 x 234mm
  • Publication Date: 09 Dec 2013
  • Publisher: Taylor & Francis Inc
  • Publication City/Country: US
  • Product Form: Hardback
  • Language: English
Secure checkout Fast Shipping Easy returns

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.

Weihs, Claus; Mersmann, Olaf ; Ligges, Uwe

More from this author