This book provides an introduction to how to use our software to create models. We focus on a dialect of R called the tidyverse that is designed to be a better interface for common tasks using R. If you’ve never heard of or used the tidyverse, Chapter 2 provides an introduction. In this book, we demonstrate how the tidyverse can be used to produce high quality models. The tools used to do this are referred to as the tidymodels packages
This book covers the building blocks of the most common methods in machine learning. This set of methods is like a toolbox for machine learning engineers. Those entering the field of machine learning should feel comfortable with this toolbox so they have the right tool for a variety of tasks.
There are substantial public health benefits gained through successfully alerting individuals and relevant public health institutions of a person’s exposure to a communicable disease. Contact tracing techniques have been applied to epidemiology for centuries, traditionally involving a manual process of interview and follow-up. This is time-consuming, difficult, and dangerous work. Manual processes are also open to incomplete information because they rely on individuals being willing and able to remember and report all contact possibilities.
I wrote this book because: • ML is not a recipe. It is not a matter of knowing the syntax and mechanics of various software packages.• ML is an art, not a science. (Hence the title of this book). • One does not have to be a math whiz or know advanced math in orer to use ML effectively, but one does need to understand the concepts well — the Why? and How? of ML methods
By the end of this you will have had a whirlwind tour of the very tip of the data visualization best-practices iceberg. We will go over a broad range of topics generally applicable to data science usecases but not dive too deep into any single one. One thing to keep in mind the whole time is none of this is absolutely set in stone, most often in the real world you have to bend or break some of these rules to do what you want.
Data Structures Succinctly Part 2 is your concise guide to skip lists, hash tables, heaps, priority queues, AVL trees, and B-trees. As with the first book, you’ll learn how the structures behave, how to interact with them, and their performance limitations. Starting with skip lists and hash tables, and then moving to complex AVL trees and B-trees, author Robert Horvick explains what each structure’s methods and classes are, the algorithms behind them, and what is necessary to keep them valid.
Data Structures Succinctly Part 1 is your first step to a better understanding of the different types of data structures, how they behave, and how to interact with them. Starting with simple linked lists and arrays, and then moving to more complex structures like binary search trees and sets, author Robert Horvick explains what each structure’s methods and classes are and the algorithms behind them. Horvick goes a step further to detail their operational and resource complexity, ensuring that you have a clear understanding of what using a specific data structure entails.
