Gain insights into machine learning concepts, implement and compare algorithms with scikit-learn, and explore supervised learning, clustering, regression, SVMs, autoencoders, and ensemble learning with practical projects using Python.

ml.tar.gz

Playground

Playground-SPA

Complexity CH-1

regulizer CH-1

regulizer CH-1-S

regulizer ch1_v2

complexity ch1_v2

code_widget

ST_kernel_trick-LIVE

python

pytorch

ST_Autoencoders

code_widget_torchsummary

code_widget_tqdm

SPA_tqdm

AE_multiple

SPA_server

Implementation of NN

c1l3

Implementation of NN-copy

This course focuses on core concepts, algorithms, and machine learning techniques. It explores the fundamentals, implements algorithms from scratch, and compares the results with scikit-learn, the Python machine learning library. This course contains examples, theoretical knowledge, and codes for various ML algorithms.

You’ll start by learning the essentials of machine learning and its applications. Then, you’ll learn about supervised learning, clustering, and constructing a bag of visual words project, followed by generalized linear regression, support vector machines, logistic regression, ensemble learning, and principal component analysis. You’ll also learn about autoencoders and variational autoencoders and end with three exciting projects.

By the end, you’ll have a solid understanding of machine learning and its algorithms, hands-on experience implementing such algorithms and applying them to different problems, and an understanding of how each algorithm works with the provided examples.

Fundamentals of Machine Learning: A Pythonic Introduction

# $K$-means algorithm

For a given dataset and value of $k$, $k$-means clustering has the following steps:

1. Choose some value of $k$ such that $k\ge2$, if it’s not given already.

2. Choose $k$ number of centroids, randomly.

3. Find the similarity score of each data point with respect to each centroid.

4. Based on the similarity score, assign each data point its centroid.

5. From these new groupings, find new centroids by taking the mean of all data points of a cluster.

6. Repeat steps 3 to 5 until the difference between old and new centroids is negligible.

If the steps above seem unclear, don't worry. We’re going to show each step in an example with an illustration.


# Dry running the example

Let's say we have the following dataset:



Practice the k-means algorithm with a step-by-step walkthrough example in this lesson.





K-Means: Walk-Through Example

Practice the k-means algorithm with a step-by-step walkthrough example in this lesson.

Course Overview

Supervised Learning

Clustering

Project: Bag of Visual Words

Generalized Linear Regression

Face Recognition Using Kernel Linear Discriminant

Support Vector Machine

Logistic Regression

Ensemble Learning

Early Stage Diabetes Prediction Using Ensemble Learning

Decoding Dimensions: PCA and Autoencoders

Image Reconstruction Using PCA

Image Colorization using Autoencoders

Colorful Face Generation with VAEs

Appendix

Wrapping Up

K-Means Walk-Through Example

$K$ -means algorithm

Dry running the example