Chapter#02 Inrtoduction To Machine Learning

Download as pdf or txt
Download as pdf or txt
You are on page 1of 21

CHAPTER#02

INTRODUCTION TO MACHINE
LEARNING

COURSE INSTRUCTORS:
 DR. MUHAMMAD NASEEM
 ENGR. FARHEEN QAZI
 ENGR. SUNDUS ZEHRA

DEPARTMENT OF SOFTWARE ENGINEERING


SIR SYED UNIVERSITY OF ENGINEERING & TECHNOLOGY
AGENDA

 Why Machine Learning introduces?


 Machine Learning Definitions
 Applications
 Machine Learning Process Flow
 Types of Machine Learning Algorithms
 Summary
WHY MACHINE LEARNING INTRODUCES & WHAT WE
ACHIEVED USING MACHINE LEARNING?

 Data Generation
 Data Analytics
 Patterns
 Algorithm
 When we do not have algorithm?
 When we do not need to learn?
 Learning means approximation?
WHAT IS MACHINE LEARNING?
 It provides systems the ability to automatically learn and improve from
experience without being explicitly programmed.

 “Learning is any process by which a system improves performance


from experience.” - Herbert Simon

Definition by Tom Mitchell (1998):


 Machine Learning is the study of algorithms that
• improve their performance P
• at some task T
• with experience E.
A well-defined learning task is given by <P,T, E>.
WHAT IS MACHINE LEARNING?
APPLICATIONS

 Image processing and Computer Vision


 Face recognition, motion detection & object detection
 Computational biology
 Tumor detection, drug discovery, DNA sequencing
 Energy production
 Price and load forecasting
 Automotive, aerospace, and manufacturing
 predictive maintenance
 Natural Language Processing
 practical speech recognition
 …
WHEN SHOULD YOU USE MACHINE LEARNING
 Hand-written rules and equations are too complex—
 as in face recognition and speech recognition.

 The rules of a task are constantly changing


 as in fraud detection from transaction records.

 The nature of the data keeps changing, and the program


needs to adapt—
 as in automated trading, energy demand forecasting,
and predicting shopping trends.
MACHINE LEARNING PROCESS FLOW
 Identifies relevant data sets and prepares them for analysis.
 Choose the type of machine learning algorithm to use.
 Builds an analytical model based on the chosen algorithm.
 Trains the model on test datasets revising it as needed.
 Run the model to generate scores and other findings.
.
CONTD….
TYPE OF LEARNING ALGORITHMS

 Supervised learning
 Unsupervised learning
 Reinforcement learning
SUPERVISED LEARNING

 It build a mathematical model of a set of data that contains


both the inputs and the desired outputs.

 Data scientists determine which variables, or features, the


model should analyze and use to develop predictions.

 Once training is complete, the algorithm will apply what was


learned to new data.
EXAMPLE:

 Suppose you are given an basket filled with different kinds of


fruits.
 Now the first step is to train the machine with all different
fruits one by one like this
 If shape of object is rounded and depression at top having
color Red then it will be labelled as –Apple.
 If shape of object is long curving cylinder having
color Green-Yellow then it will be labelled as –Banana.
EXAMPLE:

 Now suppose after training the data, you have given a new
separate fruit say Banana from basket and asked to
identify it.
UNSUPERVISED LEARNING

 It do not need to be trained with desired outcome data.


 Suppose it is given an image having both dogs and cats which
have not seen ever.
UNSUPERVISED LEARNING

 Thus machine has no any idea about the features of dogs and
cat so we can’t categorize it in dogs and cats.
 But it can categorize them according to their similarities,
patterns and differences i.e., we can easily categorize the above
picture into two parts.
 First may contain all pics having dogs in it and second part may
contain all pics having cats in it.
 Here you didn’t learn anything before, means no training data
or examples.
UNSUPERVISED LEARNING
SEMI SUPERVISED LEARNING

 It fall somewhere in between supervised and unsupervised


learning
 Since they use both labeled and unlabeled data for training
 Typically a small amount of labeled data and a large amount
of unlabeled data
 Applications
 Speech analysis, web content classification etc.
REINFORCEMENT LEARNING
REINFORCEMENT LEARNING
 Reward feedback in a particular situation.

 To find the best possible behavior or path it should take in a


specific situation.

 Reinforcement learning differs from the supervised learning in a


way that in supervised learning the training data has the answer
key with it so the model is trained with the correct answer itself
whereas in reinforcement learning, there is no answer but the
reinforcement agent decides what to do to perform the given task.

 In the absence of training dataset, it is bound to learn from its


experience.
SUB-TYPE OF LEARNING ALGORITHMS

Machine Learning

Unsupervised
Supervised Learning
Learning

Classification Regression Clustering


SVM, Linear regression,
K mean, Fuzzy, HMM,
Naïve Bayes, Logistic regression
Gaussian Mixture
Nearest Neighbor Decision trees,
Neural Networks
Neural Networks
… …

SUMMARY

 Machine learning (ML) is a relevant, popular topic with


applications spanning many data-driven tasks
 ML spans tasks in inductive reasoning; unlike classic AI, ML
infers general patterns from specific samples
 ML algorithms can be viewed as pattern analyzers—the
patterns they find can be used to make predictions
 Common tasks in ML include regression, classification,
subspace discovery, & clustering
 Learning algorithms face challenges including choosing an
inductive bias, under- & over-fitting, & computational
efficiency

You might also like