Book Image

Mastering Machine Learning with Spark 2.x

By : Malohlava, Tellez, Max Pumperla
Book Image

Mastering Machine Learning with Spark 2.x

By: Malohlava, Tellez, Max Pumperla

Overview of this book

The purpose of machine learning is to build systems that learn from data. Being able to understand trends and patterns in complex data is critical to success; it is one of the key strategies to unlock growth in the challenging contemporary marketplace today. With the meteoric rise of machine learning, developers are now keen on finding out how can they make their Spark applications smarter. This book gives you access to transform data into actionable knowledge. The book commences by defining machine learning primitives by the MLlib and H2O libraries. You will learn how to use Binary classification to detect the Higgs Boson particle in the huge amount of data produced by CERN particle collider and classify daily health activities using ensemble Methods for Multi-Class Classification. Next, you will solve a typical regression problem involving flight delay predictions and write sophisticated Spark pipelines. You will analyze Twitter data with help of the doc2vec algorithm and K-means clustering. Finally, you will build different pattern mining models using MLlib, perform complex manipulation of DataFrames using Spark and Spark SQL, and deploy your app in a Spark streaming environment.
Table of Contents (9 chapters)
3
Ensemble Methods for Multi-Class Classification

Basic graph theory

Before diving into Spark GraphX and its applications, we will first define graphs on a basic level and explain what properties they may come with and what structures are worth studying in our context. Along the way of introducing these properties, we will give more concrete examples of graphs that we consider in everyday life.

Graphs

To formalize the notion of a graph briefly sketched in the introduction, on a purely mathematical level, a graph G = (V, E) can be described as a pair of vertices V and edges E, as follows:

V = {v1, ..., vn}

E = {e1, ..., em}

We call the element vi in V a vertex and ei in E an edge, where each edge connecting two vertices v1 and v2 is, in fact, just a pair of vertices, that...