MACHINE LEARNING
Liviu Ciortuz
Department of CS, University of Iaşi, România
1.
Statistical Pattern
Learning Recognition
Statistics Engineering
(model fitting)
4.
Bibliography
0. “Exerciţii de ı̂nvăţare automată”
L. Ciortuz, A. Munteanu E. Bădărău.
Editura Universităţii “Alexandru Ioan Cuza”, Iaşi, Romania, 2017
1. “Machine Learning”
Tom Mitchell. McGraw-Hill, 1997
test/generalization
data
predicted
classification
Inductive Bias
Consider
• a concept learning algorithm L
• the instances X, and the target concept c
• the training examples Dc = {hx, c(x)i}.
• Let L(xi , Dc ) denote the classification assigned to the instance xi by L
after training on data Dc .
Definition:
The inductive bias of L is any minimal set of assertions B such
that
(∀xi ∈ X)[(B ∨ Dc ∨ xi ) ⊢ L(xi , Dc )]
for any target concept c and corresponding training examples Dc .
(A ⊢ B means A logically entails B)
13.
Inductive systems
can be modelled by
equivalent deductive
systems
14.
c h precision: P=
tp
tp + fp
tp
fn tp fp recall (or: sensitivity): R=
tp + fn
F-measure: F = 2 P+R
P × R
tn
specificity: Sp = tn
tn + fp
tp − true positives fp
follout: =
fp − false positives tn + fp
tn − true negatives
fn − false negatives Mathew’s Correlation Coefficient:
tp × tn − fp × fn
MCC = q
(tp + fp)×(tn + fn)×(tp + fn)×(tn + fp)
15.
Lazy learning vs. eager learning algorithms
Eager: generalize before seeing query
◦ ID3, Backpropagation, Naive Bayes, Radial basis function net-
works, . . .
• Must create global approximation
Lazy: wait for query before generalizing
◦ k-Nearest Neighbor, Locally weighted regression, Case based rea-
soning
• Can create many local approximations
Does it matter?
If they use the same hypothesis space H, lazy learners can represent
more complex functions.
E.g., a lazy Backpropagation algorithm can learn a NN which is dif-
ferent for each query point, compared to the eager version of Back-
propagation.
16.
ADDENDA
xxx
20.
ADMINISTRATIVIA
21.
Related courses
• Genetic Algorithms
• Artificial Neural Networks
• Probabilistic programming
◦ Bioinformatics
23.
Grading standards for the ML undergraduate course 2017
(fall semester)
Obiectiv: invatare pe tot parcursul semestrului!
Punctaj
S1 P1 S2 P2 Extras:
Seminar Partial 1 Seminar Partial 2 Seminar special
6p 12p 6p 12p ...
Minim: 2p + 4p Minim: 2p + 4p
Nota = (4 + S1 + P1 + S2 + P2) / 4
Pentru promovare: S1 + P1 + S2 + P2 >= 14
24.
• De imprimat (ALB-NEGRU):
http://profs.info.uaic.ro/∼ciortuz/SLIDES/ml0.pdf
http://profs.info.uaic.ro/∼ciortuz/SLIDES/ml3.pdf
http://profs.info.uaic.ro/∼ciortuz/SLIDES/ml6.pdf
http://profs.info.uaic.ro/∼ciortuz/SLIDES/ml8.pdf
http://profs.info.uaic.ro/∼ciortuz/SLIDES/cluster.pdf
Observaţie (3)
Profesorul responsabil pentru acest curs, Liviu Ciortuz NU va răspunde la email-uri
care pun ı̂ntrebări pentru care raspunsul a fost deja dat
– fie ı̂n aceste slide-uri,
– fie la curs,
– fie ı̂n documentul
http://profs.info.uaic.ro/ ciortuz/ML.what-you-should-know.pdf.
27.
• O carte foarte bună (ı̂n limba engleză), care conţine practic toate noţiunile
din matematica de liceu de care aveţi nevoie la acest curs:
“Mathematics for the International Student” (2012)