Foundations of statistical algorithms : with references to R packages / Claus Weihs, Olaf Mersmann, Uwe Ligges
Material type: TextBoca Raton : CRC Press, 2014Description: xxv, 473 pages : illustrations 24 cmContent type:- text
- unmediated
- volume
- 9781439878859
- QA 276.4 .W428 2014
Item type | Current library | Call number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|
Reference | Aklatang Emilio Aguinaldo-Information Resource Center Reference | QA 276.4 .W428 2014 (Browse shelf(Opens below)) | Not for loan | 3AEA2014009209 |
Browsing Aklatang Emilio Aguinaldo-Information Resource Center shelves, Shelving location: Reference Close shelf browser (Hides shelf browser)
No cover image available | No cover image available | |||||||
QA 276.12 .Sa34 2015 100 questions (and answers) about statistics / | QA 276.14 .Ev27 2010 The Cambridge dictionary of statistics / | QA 276.2 .M139 2014 McGraw-Hill's 500 statistics questions : ace your college exams. | QA 276.4 .W428 2014 Foundations of statistical algorithms : with references to R packages / | QA 402.5 .C733 2010 Combinatorial optimization / | QA 431 .P768 2008 Handbook of integral equations / | QA 445.2 .G676 2003 The facts on file geometry handbook. / |
A Chapman & Hall Book.
Includes bibliography and index.
2) Emphasizes recurring themes in all statistical algorithms: Computation, Assessment and Verification, Iteration, Intuition, Randomness, Repetition and Parallelization, and Scalability
3) Discusses two topics not included in other books: systematic verification and scalability
4) Contains examples, exercises, and selected solutions in each chapter
5) Offers access to a supplementary website.
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. It Features:1) Covers historical development as this is clarifies the evolution of more powerful statistical algorithms
Reviewing the historical development of basic algorithms to illuminate the evolution of today's more powerful statistical algorithms, this comprehensive textbook emphasizes recurring themes in all statistical algorithms including computation, assessment and verification, iteration, intuition, randomness, repetition and parallelization, and scalability. Unique in scope, it touches on topics not usually covered in similar books, namely, systematic verification and the scaling of many established techniques to very large databases. Broadly accessible, it offers examples, exercises, and selected solutions in each chapter as well as access to a supplementary website.
There are no comments on this title.