Taken literally, the title "All of Statistics" is an exaggeration. But in spirit, the title is apt, as the book does cover a much broader range of topics than a typical introductory book on mathematical statistics. This book is for people who want to learn probability and statistics quickly. It is suitable for graduate or advanced undergraduate students in computer science, mathematics, statistics, and related disciplines. The book includes modern topics like non-parametric curve estimation, bootstrapping, and classification, topics that are usually relegated to follow-up courses. The reader is presumed to know calculus and a little linear algebra. No previous knowledge of probability and statistics is required. Statistics, data mining, and machine learning are all concerned with collecting and analysing data.

In a manner accessible to beginning undergraduates, An Invitation to Modern Number Theory introduces many of the central problems, conjectures, results, and techniques of the field, such as the Riemann Hypothesis, Roth's Theorem, the Circle Method, and Random Matrix Theory. Showing how experiments are used to test conjectures and prove theorems, the book allows students to do original work on such problems, often using little more than calculus (though there are numerous remarks for those with deeper backgrounds). It shows students what number theory theorems are used for and what led to them and suggests problems for further research. Steven Miller and Ramin Takloo-Bighash introduce the problems and the computational skills required to numerically investigate them, providing background material (from probability to statistics to Fourier analysis) whenever necessary. They guide students through a variety of problems, ranging from basic number theory, cryptography, and Goldbach's Problem, to the algebraic structures of numbers and continued fractions, showing connections between these subjects and encouraging students to study them further. In addition, this is the first undergraduate book to explore Random Matrix Theory, which has recently become a powerful tool for predicting answers in number theory. Providing exercises, references to the background literature, and Web links to previous student research projects, An Invitation to Modern Number Theory can be used to teach a research seminar or a lecture class.

This book is based on the view that cognitive skills are best acquired by solving challenging, non-standard probability problems. Many puzzles and problems presented here are either new within a problem solving context (although as topics in fundamental research they are long known) or are variations of classical problems which follow directly from elementary concepts. A small number of particularly instructive problems is taken from previous sources which in this case are generally given. This book will be a handy resource for professors looking for problems to assign, for undergraduate math students, and for a more general audience of amateur scientists.

Class-tested and coherent, this textbook teaches classical and web information retrieval, including web search and the related areas of text classification and text clustering from basic concepts. It gives an up-to-date treatment of all aspects of the design and implementation of systems for gathering, indexing, and searching documents; methods for evaluating systems; and an introduction to the use of machine learning methods on text collections. All the important ideas are explained using examples and figures, making it perfect for introductory courses in information retrieval for advanced undergraduates and graduate students in computer science. Based on feedback from extensive classroom experience, the book has been carefully structured in order to make teaching more natural and effective. Slides and additional exercises (with solutions for lecturers) are also available through the book's supporting website to help course instructors prepare their lectures.

Describes basic principles and recent developments in approximate query processing. It focuses on four key synopses: random samples, histograms, wavelets, and sketches. It considers issues such as accuracy, space and time efficiency, optimality, practicality, range of applicability, error bounds on query answers, and incremental maintenance.

An authoritative, up-to-date graduate textbook on machine learning that highlights its historical context and societal impacts Patterns, Predictions, and Actions introduces graduate students to the essentials of machine learning while offering invaluable perspective on its history and social implications. Beginning with the foundations of decision making, Moritz Hardt and Benjamin Recht explain how representation, optimization, and generalization are the constituents of supervised learning. They go on to provide self-contained discussions of causality, the practice of causal inference, sequential decision making, and reinforcement learning, equipping readers with the concepts and tools they need to assess the consequences that may arise from acting on statistical decisions. Provides a modern introduction to machine learning, showing how data patterns support predictions and consequential actions Pays special attention to societal impacts and fairness in decision making Traces the development of machine learning from its origins to today Features a novel chapter on machine learning benchmarks and datasets Invites readers from all backgrounds, requiring some experience with probability, calculus, and linear algebra An essential textbook for students and a guide for researchers