Introduction To Machine Learning

Module 1

Course Title: Machine Learning With Big Data

Course Code : CSA4019
Course Credit : 3
Course Type : LP
History of Machine Learning
Before some years (about 40-50 years), machine learning was science fiction, but today it is the part of our
daily life. Machine learning is making our day to day life easy from self-driving cars to Amazon virtual
assistant "Alexa". However, the idea behind machine learning is so old and has a long history. Below some
milestones are given which have occurred in the history of machine learning:
The early history of Machine Learning (Pre-1940):
• 1834: In 1834, Charles Babbage, the father of the computer, conceived a device that could be programmed
with punch cards. However, the machine was never built, but all modern computers rely on its logical
structure.
• 1936: In 1936, Alan Turing gave a theory that how a machine can determine and execute a set of
instructions.

The era of stored program computers:

• 1940: In 1940, the first manually operated computer, "ENIAC" was invented, which was the first electronic
general-purpose computer. After that stored program computer such as EDSAC in 1949 and EDVAC in
1951 were invented.
• 1943: In 1943, a human neural network was modeled with an electrical circuit. In 1950, the scientists
started applying their idea to work and analyzed how human neurons might work.

Computer machinery and intelligence:

• 1950: In 1950, Alan Turing published a seminar paper, "Computer Machinery and Intelligence," on the
topic of artificial intelligence. In his paper, he asked, "Can machines think?"
Machine intelligence in Games:
• 1952: Arthur Samuel, who was the pioneer of machine learning, created a program that helped an IBM
computer to play a checkers game. It performed better more it played.
• 1959: In 1959, the term "Machine Learning" was first coined by Arthur Samuel.

Machine Learning from theory to reality

• 1959: In 1959, the first neural network was applied to a real-world problem to remove echoes over phone
lines using an adaptive filter.
• 1985: In 1985, Terry Sejnowski and Charles Rosenberg invented a neural network NETtalk, which was able
to teach itself how to correctly pronounce 20,000 words in one week.
• 1997: The IBM's Deep blue intelligent computer won the chess game against the chess expert Garry
Kasparov, and it became the first computer which had beaten a human chess expert.

The first "AI" winter:

• The duration of 1974 to 1980 was the tough time for AI and ML researchers, and this duration was called
as AI winter.
• In this duration, failure of machine translation occurred, and people had reduced their interest from AI,
which led to reduced funding by the government to the researches.
Machine Learning at 21st century

• 2006: In the year 2006, computer scientist Geoffrey Hinton has given a new name to neural network
research as "deep learning," and nowadays, it has become one of the most trending technologies.
• 2012: In 2012, Google created a deep neural network which learned to recognize the image of
humans and cats in YouTube videos.
• 2014: In 2014, the Chatbot "Eugen Goostman" cleared the Turing Test. It was the first Chabot who
convinced the 33% of human judges that it was not a machine.
• 2014: DeepFace was a deep neural network created by Facebook, and they claimed that it could
recognize a person with the same precision as a human can do.
• 2016: AlphaGo beat the world's number second player Lee sedol at Go game. In 2017 it beat the
number one player of this game Ke Jie.
• 2017: In 2017, the Alphabet's Jigsaw team built an intelligent system that was able to learn
the online trolling. It used to read millions of comments of different websites to learn to stop online
trolling.
Machine Learning at present:
Now machine learning has got a great advancement in its research, and it is present everywhere around
us, such as self-driving cars, Amazon Alexa, Chatbots, and many more. It
includes Supervised, unsupervised, and reinforcement learning with
clustering, classification, decision tree, SVM algorithms, etc.
Modern machine learning models can be used for making various predictions, including; weather
prediction, disease prediction, stock market analysis, etc.
 Machine Learning is said as a subset of artificial intelligence that is mainly concerned with the development
of algorithms which allow a computer to learn from the data and past experiences on their own. The term
machine learning was first introduced by Arthur Samuel in 1959. We can define it in a summarized way as:

A machine has the ability to learn if it can improve its performance by gaining more data.

How does Machine Learning work

A Machine Learning system learns from historical data, builds the prediction models, and whenever it
receives new data, predicts the output for it. The accuracy of predicted output depends upon the amount
of data, as the huge amount of data helps to build a better model which predicts the output more accurately.
Steps in Machine Learning process
Some more examples of tasks that are best solved by using a learning algorithm
• Recognizing patterns:
– Facial identities or facial expressions
– Handwritten or spoken words
Sample Applications (Sector specific)
– Medical images
• Web search

• Generating patterns: • Computational biology

– Generating images or motion sequences • Finance

• E-commerce
• Recognizing anomalies:
• Space exploration
– Unusual credit card transactions
• Robotics
– Unusual patterns of sensor readings in a nuclear power plant
• Information extraction

• Prediction: • Social networks

– Future stock prices or currency exchange rates • Debugging software

• [Your favorite area]
Features of Machine Learning:
• Machine learning uses data to detect various patterns in a given dataset.
• It can learn from past data and improve automatically.
• It is a data-driven technology.
• Machine learning is much similar to data mining as it also deals with the huge amount of the data.

The importance of machine learning can be easily understood by its uses cases, Currently, machine learning
is used in self-driving cars, cyber fraud detection, face recognition, and friend suggestion by
Facebook, etc. Various top companies such as Netflix and Amazon have build machine learning models that
are using a vast amount of data to analyze the user interest and recommend product accordingly.

Following are some key points which show the importance of Machine Learning:
• Rapid increment in the production of data
• Solving complex problems, which are difficult for a human
• Decision making in various sector including finance
• Finding hidden patterns and extracting useful information from data.
Classification of Machine Learning
At a broader level, machine learning can be classified into three types:

1. Supervised learning

– Given: training data + desired outputs (labelled)

2. Unsupervised learning

– Given: training data + a few desired outputs (unlabeled)

3. Reinforcement learning

– Rewards from sequence of actions

1) Supervised Learning

• Supervised learning is a type of machine learning method in which we provide sample of labeled data

to the machine learning system in order to train it, and on that basis, it predicts the output.

• The system creates a model using labeled data to understand the datasets and learn about each

data, once the training and processing are done then we test the model by providing a sample data to

check whether it is predicting the exact output or not.

• The goal of supervised learning is to map input data with the output data.

• The supervised learning is based on supervision, and it is the same as when a student learns things in

the supervision of the teacher. The example of supervised learning is spam filtering.

Supervised learning can be grouped further in two categories of algorithms:

• Classification
• Regression
How does supervised machine learning work?

• Supervised machine learning requires the data scientist to train the algorithm with both labeled

inputs and desired outputs.

Supervised learning algorithms are good for the following tasks:

• Binary classification: Dividing data into two categories.

• Multi-class classification: Choosing between more than two types of answers.

• Regression modeling: Predicting continuous values.

• Ensembling: Combining the predictions of multiple machine learning models to produce an accurate

prediction.
Some of the popular supervised learning algorithms are:
1. Linear Regression: It is a simple algorithm used for regression tasks. It models the relationship between the input
features and the target variable using a linear function.
2. Logistic Regression: This algorithm is used for binary classification problems. It models the probability of an input
belonging to a certain class using a logistic function.
3. Decision Trees: Decision trees are versatile algorithms that can be used for both classification and regression tasks. They
create a flowchart-like structure to make decisions based on the input features.
4. Random Forest: Random Forest is an ensemble learning method that combines multiple decision trees to make
predictions. It is robust and can handle high-dimensional data with complex relationships.
5. Support Vector Machines (SVM): SVM is a powerful algorithm for both classification and regression tasks. It finds an
optimal hyperplane that separates different classes in the input space.
6. k-Nearest Neighbors (k-NN): k-NN is a non-parametric algorithm that makes predictions based on the k closest training
examples in the feature space. It can be used for both classification and regression.
7. Neural Networks: Neural networks are a versatile class of algorithms inspired by the human brain. They consist of
interconnected nodes (neurons) organized in layers and can handle complex patterns and large datasets.
jnjnlSDNF
2) Unsupervised Learning

• Unsupervised learning is a learning method in which a machine learns without any supervision.

• The training is provided to the machine with the set of data that has not been labeled, classified, or

categorized, and the algorithm needs to act on that data without any supervision.

• The goal of unsupervised learning is to restructure the input data into new features or a group of objects

with similar patterns.

• In unsupervised learning, we don't have a predetermined result. The machine tries to find useful

insights from the huge amount of data.

It can be further classifieds into two categories of algorithms:

• Clustering
• Association
How does unsupervised machine learning work?

• Unsupervised machine learning algorithms do not require data to be labeled. They sift through

unlabeled data to look for patterns that can be used to group data points into subsets.

• Most types of deep learning, including neural networks, are unsupervised algorithms.

Unsupervised learning algorithms are good for the following tasks:

• Clustering: Splitting the dataset into groups based on similarity.

• Anomaly detection: Identifying unusual data points in a data set.

• Association mining: Identifying sets of items in a data set that frequently occur together.

• Dimensionality reduction: Reducing the number of variables in a data set.

Some of the popular unsupervised learning algorithms are:
1. Clustering Algorithms:
1. K-means: It partitions the data into k clusters based on the similarity of the feature vectors.
2. Hierarchical Clustering: It creates a tree-like structure (dendrogram) to represent the relationships between data
points, forming clusters at different levels of the tree.
2. Dimensionality Reduction Algorithms:
1. Principal Component Analysis (PCA): It finds a lower-dimensional representation of the data by identifying the
directions of maximum variance.
2. Auto-encoders: These are neural network architectures that learn to encode and decode the data, effectively
reducing its dimensionality while preserving important features.
3. Anomaly Detection Algorithms:
1. Isolation Forest: It identifies anomalies in the data by isolating instances that are easier to separate from the rest.
2. One-Class SVM: It learns the boundary of normal data points and detects anomalies as data points lying outside.
Association Rule Learning:
3. Apriori Algorithm: It discovers frequent item sets in transactional data and generates association rules based on the
presence of these item sets.
3) Reinforcement Learning

• Reinforcement learning is a feedback-based learning method, in which a learning agent gets a

reward for each right action and gets a penalty for each wrong action.

• The agent learns automatically with these feedbacks and improves its performance. In

reinforcement learning, the agent interacts with the environment and explores it.

• The goal of an agent is to get the most reward points, and hence, it improves its performance.

• The robotic dog, which automatically learns the movement of his arms, is an example of

Reinforcement learning.

Other Examples:
– Credit assignment problem
– Game playing
– Robotics
– Balance a pole on your hand
Some of the common reinforcement learning algorithms:

1.Q-Learning: Q-Learning is a model-free RL algorithm that learns an action-value function called Q-function. It uses a

table or a function approximator to estimate the value of taking a particular action in a given state.

2.Deep Q-Network (DQN): DQN is an extension of Q-Learning that uses deep neural networks to estimate the Q-function.

It can handle high-dimensional state spaces and has been successfully applied to complex tasks in Atari games.

3.Policy Gradient Methods: Policy gradient methods directly learn a parameterized policy that maps states to actions.

They use gradient ascent to update the policy parameters based on the expected cumulative rewards.

4.Proximal Policy Optimization (PPO): PPO is a policy optimization algorithm that iteratively updates a policy by

maximizing a surrogate objective function. It aims to strike a balance between policy updates and avoiding large policy

changes.

5.Deep Deterministic Policy Gradient (DDPG): DDPG is an algorithm that combines deep neural networks with

deterministic policy gradient methods. It is primarily used for continuous action spaces.
Example
What is a Machine Learning Model?
• A mathematical model with parameters that map input to output

• Machine Learning models can be understood as a program that has been trained to find
patterns within new data and make predictions.

• These models are represented as a mathematical function that takes requests in the form
of input data, makes predictions on input data, and then provides an output in response.
 Building vs. Applying Model
Building Classification Model • Training Phase
• Adjust model parameters
• Use training data
• Testing Phase
• Apply learned model
• Use new data
Classification Algorithms

• k-NN (K nearest neighbors)

CART algorithm
• Decision tree ID3 algorithm

• Naïve bayes
K-Nearest Neighbor(KNN) Algorithm for Machine Learning
• K-Nearest Neighbour is one of the simplest Machine Learning algorithms based on Supervised Learning
technique.
• K-NN algorithm assumes the similarity between the new case/data and available cases and put the new case
into the category that is most similar to the available categories.
• K-NN algorithm stores all the available data and classifies a new data point based on the similarity. This
means when new data appears then it can be easily classified into a well suite category by using K- NN
algorithm.
• K-NN algorithm can be used for Regression as well as for Classification but mostly it is used for the
Classification problems.
• K-NN is a non-parametric algorithm, which means it does not make any assumption on underlying data.
• It is also called a lazy learner algorithm because it does not learn from the training set immediately instead it
stores the dataset and at the time of classification, it performs an action on the dataset.
• KNN algorithm at the training phase just stores the dataset and when it gets new data, then it classifies that
data into a category that is much similar to the new data.
How does K-NN work?
The K-NN working can be explained on the basis of the below
algorithm:

Step-1: Select the number K of the neighbors

Step-2: Calculate the Euclidean distance of K number of neighbors
Step-3: Take the K nearest neighbors as per the calculated Euclidean
distance.
Step-4: Among these k neighbors, count the number of the data
points in each category.
Step-5: Assign the new data points to that category for which the
number of the neighbor is maximum.
Step-6: Our model is ready.
K-NN (K Nearest Neighbor)

• Simple classification technique

• Label sample based on its neighbors How kNN Works?

What is k?
• Value of k determines number of closest neighbors to consider

Using k Nearest Neighbors

Decision Tree Classification Algorithm
• Decision Tree is a Supervised learning technique that can be used for both classification and Regression problems,
but mostly it is preferred for solving Classification problems.
• It is a tree-structured classifier, where internal nodes represent the features of a dataset, branches represent the
decision rules and each leaf node represents the outcome.
• In a Decision tree, there are two nodes, which are the Decision Node and Leaf Node. Decision nodes are used to
make any decision and have multiple branches, whereas Leaf nodes are the output of those decisions and do not
contain any further branches.
• The decisions or the test are performed on the basis of features of the given dataset.
• It is a graphical representation for getting all the possible solutions to a problem/decision based on given
conditions.
• It is called a decision tree because, similar to a tree, it starts with the root node, which expands on further
branches and constructs a tree-like structure.
• In order to build a tree, we use the (Classification And Regression Tree) CART algorithm, which stands for
Classification and Regression Tree algorithm.
 Why use Decision Trees?
• There are various algorithms in Machine learning, so choosing the best algorithm for the given dataset and problem is
the main point to remember while creating a machine learning model. Below are the two reasons for using the
Decision tree:
• Decision Trees usually mimic human thinking ability while making a decision, so it is easy to understand.
• The logic behind the decision tree can be easily understood because it shows a tree-like structure.

Decision Tree Terminologies

• Root Node: Root node is from where the decision tree
starts. It represents the entire dataset, which further gets
divided into two or more homogeneous sets.
• Leaf Node: Leaf nodes are the final output node, and the
tree cannot be segregated further after getting a leaf node.
• Splitting: Splitting is the process of dividing the decision
node/root node into sub-nodes according to the given
conditions.
• Branch/Sub Tree: A tree formed by splitting the tree.
• Pruning: Pruning is the process of removing the unwanted
branches from the tree.
• Parent/Child node: The root node of the tree is called the
parent node, and other nodes are called the child nodes.
 Example for ID3 algorithm

Comparison between ID3 and CART:

Naïve Bayes Classifier Algorithm
• Naïve Bayes algorithm is a supervised learning algorithm, which is based on Bayes theorem and used for solving
classification problems.
• It is mainly used in text classification that includes a high-dimensional training dataset.
• Naïve Bayes Classifier is one of the simple and most effective Classification algorithms which helps in building the fast
machine learning models that can make quick predictions.
• It is a probabilistic classifier, which means it predicts on the basis of the probability of an object.
• Some popular examples of Naïve Bayes Algorithm are spam filtration, Sentimental analysis, and classifying articles.

Bayes' Theorem:
• Bayes' theorem is also known as Bayes' Rule or Bayes' law, which is used to determine the probability of a hypothesis
with prior knowledge. It depends on the conditional probability.
The formula for Bayes' theorem is given as:
Where,
P(A|B) is Posterior probability: Probability of hypothesis A on the observed event B.
P(B|A) is Likelihood probability: Probability of the evidence given that the probability of a hypothesis is true.
P(A) is Prior Probability: Probability of hypothesis before observing the evidence.
P(B) is Marginal Probability: Probability of Evidence.
Working of Naïve Bayes' Classifier:

Working of Naïve Bayes' Classifier can be understood with the help of the below example:

Suppose we have a dataset of weather conditions and corresponding target variable "Play". So using this dataset
we need to decide that whether we should play or not on a particular day according to the weather conditions.
So to solve this problem, we need to follow the below steps:

• Convert the given dataset into frequency tables.

• Generate Likelihood table by finding the probabilities of given features.

• Now, use Bayes theorem to calculate the posterior probability.

What is clustering?
What do we need for clustering?
Cluster Evaluation
Inter-cluster cohesion (compactness)
- Cohesion measures how near the data points in a cluster are to the cluster centroid
- Sum of squared error (SSE) is a commonly used measure
Inter-cluster separation (isolation)
- Separation means that different cluster centroids should be far away from one another
Underfitting Model

The model is under fitting if it’s too simple that it cannot reflect the complexity of the
training dataset.
We can overcome under fitting by:
• Increasing the complexity of the model
• Training the model for a longer period
of time (more epochs) to reduce error

Here we are trying to fit the non-linear data with

Linear model, which shows underfitting.
Ex: asking a car driver to drive a truck
Overfitting Model
Model is overfitting data when it memorizes all the specific details of the training data
and fails to generalize
• Overfitting models tends to perform very well on the training dataset but poorly on
any new datasets (testing data).
• Machine learning is the art of creating models
that are able to generalize and avoid
memorization.
Overfitting:
• Overfitting occurs when a machine learning model performs very well on the training data
but fails to generalize to unseen data.
• It happens when a model becomes too complex and starts to memorize the noise and
outliers present in the training data, rather than learning the underlying patterns.
• As a result, the model becomes overly sensitive to the training data and fails to make
accurate predictions on new instances.
Signs of overfitting include:
• Very low or zero training error but high test error.
• Model capturing noise or outliers in the training data.
• High variance and unstable performance on different subsets of data.
• Overfitting can be caused by various factors, such as using a complex model with too many parameters,
having insufficient or noisy training data, or not using proper regularization techniques.
 Generalization
• When we train a machine learning model, we don’t just want it to learn to model the training data.

We want it to generalize to data it hasn’t seen before.

• Fortunately, there’s a very convenient way to measure an algorithm’s generalization performance: we

measure its performance on a held-out test set, consisting of examples it hasn’t seen before.

• If an algorithm works well on the training set but fails to generalize, we say it is overfitting.

• Improving generalization (or preventing overfitting) in neural nets is still somewhat of a dark art.
 Generalized Model
Model that performs well during training (on new dataset that have never seen before) is
considered the best model (goal)

• Generalization refers to the ability of a machine

learning model to perform well on unseen or
new data that it hasn't been trained on. In
other words, a model with good generalization
is able to learn and capture underlying
patterns, trends, and relationships from the
training data and apply them to make accurate
predictions on new, unseen instances.
• The goal of machine learning is to build models
that generalize well.
 Overfitting

Overfitting
Generalization & Overfitting
Errors in Classification
Success: Output = Target
• Error: Output != Target
• Error rate = Error = Misclassification Error
• # errors / # samples = % error

Errors in Classification
Thank You!