Introduction to Machine

Learning
Why “Learn”?

• Machine learning is programming computers to optimize a

performance criterion using example data or past experience.
• Learning is used when:
• Human expertise does not exist (navigating on Mars),
• Humans are unable to explain their expertise (speech recognition)
• Solution changes in time (routing on a computer network)
• Solution needs to be adapted to particular cases (user biometrics)

2
What We Talk About When We Talk
About“Learning”
• Learning general models from a data of particular examples
• Data is cheap and abundant (data warehouses, data marts);
knowledge is expensive and scarce.
• Example in retail: Customer transactions to consumer behavior:
People who bought “Da Vinci Code” also bought “The Five People You Meet in
Heaven” (www.amazon.com)
• Build a model that is a good and useful approximation to the data.

3
Data Mining/KDD
Definition := “KDD is the non-trivial process of
identifying valid, novel, potentially useful, and
ultimately understandable patterns in data”
Applications:
• Retail: Market basket analysis, Customer relationship management (CRM)
• Finance: Credit scoring, fraud detection
• Manufacturing: Optimization, troubleshooting
• Medicine: Medical diagnosis
• Telecommunications: Quality of service optimization
• Bioinformatics: Motifs, alignment
• Web mining: Search engines
• ...

4
 What is Machine Learning?
Machine Learning
Study of algorithms that improve their performance at some task with
experience
Optimize a performance criterion using example data or past
experience.
Role of Statistics: Inference from a sample
Role of Computer science: Efficient algorithms to
Solve the optimization problem
Representing and evaluating the model for inference

5
 Growth of Machine Learning
Machine learning is preferred approach to
Speech recognition, Natural language processing
Computer vision
Medical outcomes analysis
Robot control
Computational biology
This trend is accelerating
Improved machine learning algorithms
Improved data capture, networking, faster computers
Software too complex to write by hand
New sensors / IO devices
Demand for self-customization to user, environment
It turns out to be difficult to extract knowledge from human expertsfailure of expert
systems in the 1980’s.

Alpydin & Ch. Eick: ML Topic1 6

Applications

• Association Analysis
• Supervised Learning
• Classification
• Regression/Prediction
• Unsupervised Learning
• Reinforcement Learning

7
Learning Associations
• Basket analysis:
P (Y | X ) probability that somebody who buys X also buys Y where X and
Y are products/services.

Example: P ( chips | beer ) = 0.7

Market-Basket transactions
TID Items
1 Bread, Milk
2 Bread, Diaper, Beer, Eggs
3 Milk, Diaper, Beer, Coke
4 Bread, Milk, Diaper, Beer
5 Bread, Milk, Diaper, Coke
 Classification

• Example: Credit scoring

• Differentiating between
low-risk and high-risk
customers from their
income and savings

Discriminant: IF income > θ1 AND savings > θ2

THEN low-risk ELSE high-risk

Model 9
Classification: Applications

• Aka Pattern recognition

• Face recognition: Pose, lighting, occlusion (glasses, beard), make-up,
hair style
• Character recognition: Different handwriting styles.
• Speech recognition: Temporal dependency.
• Use of a dictionary or the syntax of the language.
• Sensor fusion: Combine multiple modalities; eg, visual (lip image) and
acoustic for speech
• Medical diagnosis: From symptoms to illnesses
• Web Advertizing: Predict if a user clicks on an ad on the Internet.

10
Face Recognition

Training examples of a person

Test images

11
Prediction: Regression

• Example: Price of a used car

• x : car attributes
y : price y = wx+w0
y = g (x | θ)
g ( ) model,
θ parameters

12
Supervised Learning: Uses
Example: decision trees tools that create rules
• Prediction of future cases: Use the rule to predict the output for
future inputs
• Knowledge extraction: The rule is easy to understand
• Compression: The rule is simpler than the data it explains
• Outlier detection: Exceptions that are not covered by the rule, e.g.,
fraud

13
Unsupervised Learning

• Learning “what normally happens”

• No output
• Clustering: Grouping similar instances
• Other applications: Summarization, Association Analysis
• Example applications
• Customer segmentation in CRM
• Image compression: Color quantization
• Bioinformatics: Learning motifs

14
Reinforcement Learning

• Topics:
• Policies: what actions should an agent take in a particular situation
• Utility estimation: how good is a state (used by policy)
• No supervised output but delayed reward
• Credit assignment problem (what was responsible for the outcome)
• Applications:
• Game playing
• Robot in a maze
• Multiple agents, partial observability, ...

15
Resources: Datasets

• UCI Repository: http://www.ics.uci.edu/~mlearn/MLRepository.html

• UCI KDD Archive: http://kdd.ics.uci.edu/summary.data.application.html
• Statlib: http://lib.stat.cmu.edu/
• Delve: http://www.cs.utoronto.ca/~delve/

16
Classification: A programming task
Classification: Definition
• Given a collection of records (training set )
• Each record contains a set of attributes, one of the attributes is the
class.
• Find a model for class attribute as a function of the values of other
attributes.
• Goal: previously unseen records should be assigned a class as
accurately as possible.
• A test set is used to determine the accuracy of the model. Usually,
the given data set is divided into training and test sets, with training
set used to build the model and test set used to validate it.
Illustrating Classification Task
Tid Attrib1 Attrib2 Attrib3 Class Learning
No
1 Yes Large 125K
algorithm
2 No Medium 100K No
3 No Small 70K No
4 Yes Medium 120K No
Induction
5 No Large 95K Yes
6 No Medium 60K No
7 Yes Large 220K No Learn
8 No Small 85K Yes Model
9 No Medium 75K No
10 No Small 90K Yes
Model
10

Training Set
Apply
Tid Attrib1 Attrib2 Attrib3 Class Model
11 No Small 55K ?
12 Yes Medium 80K ?
13 Yes Large 110K ? Deduction
14 No Small 95K ?

15 No Large 67K ?
10

Test Set
Examples of Classification Task

• Predicting tumor cells as benign or malignant

• Classifying credit card transactions

as legitimate or fraudulent

• Classifying secondary structures of protein

as alpha-helix, beta-sheet, or random
coil

• Categorizing news stories as finance,

weather, entertainment, sports, etc
Classification Using Distance
• Place items in class to which they are “closest”.
• Must determine distance between an item and a class.
• Classes represented by
• Centroid: Central value.
• Medoid: Representative point.
• Individual points
• Algorithm: KNN
K Nearest Neighbor (KNN):
• Training set includes classes.
• Examine K items near item to be classified.
• New item placed in class with the most number of close items.
• O(q) for each tuple to be classified. (Here q is the size of the training
set.)
KNN
K-NN metrics
K-NN metrics
Linear Regression

We want to find the best line (linear function

y=f(X)) to explain the data.
y

X
Linear Regression
Home work

• https://towardsdatascience.com/machine-learning-made-simple-
with-excel-1bffd7901502