Machine Learning Approaches #machinelearningtechniques #mltbcs055

# ๐ŸŒˆ Machine Learning Approaches โ€” AKTU BCS-055

๐Ÿค– Machine Learning Approaches

AKTU BCS-055 โ€” Unit I

Artificial Neural Network โ€ข Clustering โ€ข Reinforcement Learning โ€ข Decision Tree โ€ข Bayesian Network โ€ข SVM โ€ข Genetic Algorithm

๐Ÿ“Œ Introduction

Machine Learning can be implemented using different approaches depending on the
type of problem, available data, and desired output.

A Machine Learning Approach is a method or technique used by a machine
learning system to learn patterns from data and make predictions or decisions.

๐Ÿง  Major Machine Learning Approaches

No. Approach Main Idea
1 Artificial Neural Network Learns using interconnected artificial neurons.
2 Clustering Groups similar data points together.
3 Reinforcement Learning Learns through actions, rewards and penalties.
4 Decision Tree Learning Uses a tree of decisions for prediction.
5 Bayesian Networks Represents probabilistic relationships.
6 Support Vector Machine Finds an optimal separating hyperplane.
7 Genetic Algorithm Uses evolutionary operations to find good solutions.

1๏ธโƒฃ Artificial Neural Network (ANN)

An Artificial Neural Network is a computational model inspired by the
structure and functioning of biological neurons in the human brain.

$$
\boxed{\text{Input Layer} \rightarrow \text{Hidden Layer(s)}
\rightarrow \text{Output Layer}}
$$

๐Ÿ”น Basic Structure

๐ŸŸก Input Neurons
โžก๏ธ
๐Ÿ”ต Hidden Neurons
โžก๏ธ
๐ŸŸข Output Neuron

Each neuron receives inputs, applies weights and an activation function, and
produces an output.

$$
z = \sum_{i=1}^{n}w_i x_i+b
$$

$$
y=f(z)
$$

Example: Cat vs Dog image classification, handwriting recognition,
speech recognition.

2๏ธโƒฃ Clustering

Clustering is an unsupervised learning approach in which similar data
objects are grouped into clusters.

$$
\boxed{\text{Similar Objects} \rightarrow \text{Same Cluster}}
$$

๐Ÿ”น Example

๐Ÿ”ต ๐Ÿ”ต ๐Ÿ”ต ย ย ย ย  ๐Ÿ”ด ๐Ÿ”ด ๐Ÿ”ด ย ย ย ย  ๐ŸŸข ๐ŸŸข ๐ŸŸข

A clustering algorithm automatically discovers groups without requiring
predefined class labels.

๐Ÿ“Œ Popular Algorithm

$$
\boxed{\text{K-Means Clustering}}
$$

In K-Means, data points are assigned to the nearest centroid and the centroids
are repeatedly updated.

3๏ธโƒฃ Reinforcement Learning

Reinforcement Learning is a learning approach in which an agent interacts
with an environment
and learns from rewards and penalties.

๐Ÿค– Agent
โžก๏ธ ACTION โžก๏ธ
๐ŸŒ Environment

๐ŸŒ
โžก๏ธ REWARD โžก๏ธ
๐Ÿค–

$$
\boxed{
\text{Agent}
\xrightarrow{\text{Action}}
\text{Environment}
\xrightarrow{\text{Reward}}
\text{Agent}
}
$$

๐Ÿ“Œ Example

A robot learns how to reach a destination. A successful action receives a
positive reward, while an undesirable action may receive a penalty.

4๏ธโƒฃ Decision Tree Learning

A Decision Tree is a supervised learning approach that makes predictions by
applying a sequence of decision rules.

๐ŸŒณ Example Decision Tree

$$
\begin{array}{c}
\boxed{\text{Age > 30?}}\
\diagdown \qquad \diagup\
\text{YES} \qquad \text{NO}\
\downarrow \qquad \downarrow\
\boxed{\text{Class A}}
\qquad
\boxed{\text{Class B}}
\end{array}
$$

๐Ÿ”น Components

  • ๐ŸŒฑ Root Node โ€” first decision.
  • ๐ŸŒฟ Internal Nodes โ€” additional decisions.
  • ๐ŸŒณ Branches โ€” outcomes of decisions.
  • ๐Ÿƒ Leaf Nodes โ€” final prediction.

5๏ธโƒฃ Bayesian Networks

A Bayesian Network is a probabilistic graphical model that represents
relationships between variables using a directed acyclic graph (DAG).

๐ŸŒง๏ธ Rain
โžก๏ธ
๐Ÿ’ง Wet Road

 

๐ŸŒง๏ธ Rain
โžก๏ธ
๐Ÿš— Traffic

๐Ÿ“Œ Bayesโ€™ Theorem

$$
\boxed{
P(A|B)=
\frac{P(B|A)P(A)}
{P(B)}
}
$$

Bayesian Networks are useful when uncertainty and probabilistic relationships
are important.

6๏ธโƒฃ Support Vector Machine (SVM)

Support Vector Machine is a supervised learning algorithm mainly used for
classification. It finds a separating hyperplane that maximizes the margin
between classes.

๐Ÿ”ต ๐Ÿ”ต ๐Ÿ”ต
โ”‚

๐Ÿ”ด ๐Ÿ”ด ๐Ÿ”ด

๐Ÿ“Œ Maximum Margin

$$
\boxed{
\text{Best Hyperplane}
======================

\text{Maximum Separation Margin}
}
$$

For a linear classifier:

$$
\boxed{
w^Tx+b=0
}
$$

The decision rule can be written as:

$$
f(x)=
\operatorname{sign}(w^Tx+b)
$$

โญ Support Vectors

The data points closest to the separating hyperplane are called
support vectors. They play an important role in determining the optimal
hyperplane.

7๏ธโƒฃ Genetic Algorithm

A Genetic Algorithm is an optimization technique inspired by the process of
natural evolution.

๐Ÿงฌ Population
โฌ‡๏ธ
๐Ÿ† Selection
โฌ‡๏ธ
๐Ÿ”€ Crossover
โฌ‡๏ธ
๐Ÿงฌ Mutation
โฌ‡๏ธ
โœจ Better Population

๐Ÿ”น Chromosome Representation

$$
101101
$$

Each chromosome represents a possible solution.

๐Ÿ”น Crossover

Suppose two parent chromosomes are:

$$
P_1=101|110
$$

$$
P_2=110|001
$$

After crossover:

$$
C_1=101|001
$$

$$
C_2=110|110
$$

๐Ÿ”น Mutation

A small random change may occur:

$$
101101
\quad\longrightarrow\quad
101001
$$

Thus, the algorithm searches for better solutions over successive generations.

๐Ÿ“Š Quick Comparison โ€” AKTU Exam Point of View

Approach Learning Type Key Idea
ANN Supervised / Unsupervised Neurons and weighted connections
Clustering Unsupervised Grouping similar objects
Reinforcement Learning Reward-based Agent learns through interaction
Decision Tree Supervised Decision rules and branches
Bayesian Network Probabilistic Conditional dependencies
SVM Supervised Maximum-margin separation
Genetic Algorithm Optimization Evolutionary search

๐ŸŽฏ AKTU BCS-055 Exam Point

Question: Explain the different approaches of Machine Learning.

Answer: Machine Learning can use several approaches to learn patterns
and make decisions. Important approaches include:

  1. Artificial Neural Network
  2. Clustering
  3. Reinforcement Learning
  4. Decision Tree Learning
  5. Bayesian Networks
  6. Support Vector Machine
  7. Genetic Algorithm

For an examination answer, write the definition, working principle,
important components, and one suitable example
of each approach.

๐Ÿง  Quick Memory Trick

๐Ÿง  ANN โ†’ Neurons
๐Ÿ”ต Clustering โ†’ Groups
๐Ÿค– Reinforcement โ†’ Rewards
๐ŸŒณ Decision Tree โ†’ Decisions
๐ŸŽฒ Bayesian โ†’ Probability
๐Ÿ“ SVM โ†’ Maximum Margin
๐Ÿงฌ Genetic Algorithm โ†’ Evolution

๐Ÿš€ PostNetwork Academy

Machine Learning โ€ข Artificial Intelligence โ€ข Data Science

AKTU BCS-055 โ€” Machine Learning Notes

Learn โ†’ Visualize โ†’ Practice โ†’ Master

ยฉPostnetwork-All rights reserved. ย  ย