Book Image

MATLAB for Machine Learning - Second Edition

By : Giuseppe Ciaburro
Book Image

MATLAB for Machine Learning - Second Edition

By: Giuseppe Ciaburro

Overview of this book

Discover why the MATLAB programming environment is highly favored by researchers and math experts for machine learning with this guide which is designed to enhance your proficiency in both machine learning and deep learning using MATLAB, paving the way for advanced applications. By navigating the versatile machine learning tools in the MATLAB environment, you’ll learn how to seamlessly interact with the workspace. You’ll then move on to data cleansing, data mining, and analyzing various types of data in machine learning, and visualize data values on a graph. As you progress, you’ll explore various classification and regression techniques, skillfully applying them with MATLAB functions. This book teaches you the essentials of neural networks, guiding you through data fitting, pattern recognition, and cluster analysis. You’ll also explore feature selection and extraction techniques for performance improvement through dimensionality reduction. Finally, you’ll leverage MATLAB tools for deep learning and managing convolutional neural networks. By the end of the book, you’ll be able to put it all together by applying major machine learning algorithms in real-world scenarios.
Table of Contents (17 chapters)
Free Chapter
1
Part 1: Getting Started with Matlab
4
Part 2: Understanding Machine Learning Algorithms in MATLAB
9
Part 3: Machine Learning in Practice

Understanding hierarchical clustering

Hierarchical clustering is a method of clustering that creates a hierarchy or tree-like structure of clusters. It iteratively merges or splits clusters based on the similarity or dissimilarity between data points. The resulting structure is often represented as a dendrogram, which visualizes the relationships and similarities among the data points.

There are two main types of hierarchical clustering:

  • Agglomerative hierarchical clustering: This starts with each data point considered as an individual cluster and progressively merges similar clusters until all data points belong to a single cluster. At the beginning, each data point is treated as a separate cluster, and in each iteration, the two most similar clusters are merged into a larger cluster. This process continues until all data points are in one cluster. The merging process is guided by a distance or similarity measure, such as a Euclidean distance or correlation.
  • Divisive...