Академический Документы
Профессиональный Документы
Культура Документы
Basic Concepts
Joakim Nivre
Uppsala University and Vaxjo University, Sweden
E-mail: nivre@msi.vxu.se
Machine Learning 1(24)
Machine Learning
Rationale:
1. For many problems, there is no known method for computing
the desired output from a set of inputs.
2. For other problems, computation according to the known
correct method may be too expensive.
Machine Learning 2(24)
Well-Posed Learning Problems
Examples:
1. Learning to classify chemical compounds
2. Learning to drive an autonomous vehicle
3. Learning to play bridge
4. Learning to parse natural language sentences
Machine Learning 3(24)
Designing a Learning System
We assume:
1. An instance is represented as a tuple of attributes
a
1
= v
1
, . . . , a
n
= v
n
).
2. A hypothesis is represented as a conjunction of constraints on
instance attributes.
3. Possible constraints are a
i
= v (specifying a single value),
? (any value is acceptable), and (no value is acceptable).
Machine Learning 13(24)
A Simple Concept Learning Task
Instance attributes:
1. Capitalized: Yes, No.
2. Sentence-initial: Yes, No.
3. Contains hyphen: Yes, No.
Training examples: Yes, No, No), 1), No, No, No), 0), . . .)
Machine Learning 14(24)
Concept Learning as Search
h
j
g
h
k
if and only if (x X)[(h
k
(x) = 1) (h
j
(x) = 1)]
h
j
>
g
h
k
if and only if (h
j
g
h
k
) (h
k
,
g
h
j
)
Machine Learning 15(24)
Algorithm 1: Find-S
Why prefer the most specic hypothesis (in the latter case)?
Output G and S.
Machine Learning 18(24)
Example: Candidate Elimination
Initialization:
G = ?, ?, ?)
S = , , )
G = ?, ?, ?)