Sign In Start Free Trial
Account

Add to playlist

Create a Playlist

Modal Close icon
You need to login to use this feature.
  • Mastering Java Machine Learning
  • Toc
  • feedback
Mastering Java Machine Learning

Mastering Java Machine Learning

By : Kamath, Krishna Choppella
3.4 (9)
close
Mastering Java Machine Learning

Mastering Java Machine Learning

3.4 (9)
By: Kamath, Krishna Choppella

Overview of this book

Java is one of the main languages used by practicing data scientists; much of the Hadoop ecosystem is Java-based, and it is certainly the language that most production systems in Data Science are written in. If you know Java, Mastering Machine Learning with Java is your next step on the path to becoming an advanced practitioner in Data Science. This book aims to introduce you to an array of advanced techniques in machine learning, including classification, clustering, anomaly detection, stream learning, active learning, semi-supervised learning, probabilistic graph modeling, text mining, deep learning, and big data batch and stream machine learning. Accompanying each chapter are illustrative examples and real-world case studies that show how to apply the newly learned techniques using sound methodologies and the best Java-based tools available today. On completing this book, you will have an understanding of the tools and techniques for building powerful machine learning models to solve data science problems in just about any domain.
Table of Contents (13 chapters)
close
10
A. Linear Algebra
12
Index

Graph concepts

Next, we will briefly revisit the concepts from graph theory and some of the definitions that we will use in this chapter.

Graph structure and properties

A graph is defined as a data structure containing nodes and edges connecting these nodes. In the context of this chapter, the random variables are represented as nodes, and edges show connections between the random variables.

Formally, if X = {X1, X2,….Xk} where X1, X2,….Xk are random variables representing the nodes, then there can either be a directed edge belonging to the set e, for example, between the nodes given by Graph structure and properties or an undirected edge Graph structure and properties, and the graph is defined as a data structure Graph structure and properties. A graph is said to be a directed graph when every edge in the set e between nodes from set X is directed and similarly an undirected graph is one where every edge between the nodes is undirected as shown in Figure 1. Also, if there is a graph that has both directed and undirected edges, the notation of Graph structure and properties represents an edge...

Unlock full access

Continue reading for free

A Packt free trial gives you instant online access to our library of over 7000 practical eBooks and videos, constantly updated with the latest in tech
bookmark search playlist download font-size

Change the font size

margin-width

Change margin width

day-mode

Change background colour

Close icon Search
Country selected

Close icon Your notes and bookmarks

Delete Bookmark

Modal Close icon
Are you sure you want to delete it?
Cancel
Yes, Delete