The Beginning
- Created by: Tenel Ka
- Created on: 25-06-17 16:16
I | W | D | A | T | A | I | H | M | O | R | E | G | E | N | E | R | A | L | R | L |
X | Y | I | T | F | I | N | D | S | A | L | G | O | R | I | T | H | M | L | U | X |
L | F | G | M | Y | T | U | Y | D | H | F | I | S | K | W | P | P | T | M | Y | G |
N | T | U | C | Q | G | T | S | A | F | M | K | I | J | V | W | Y | F | S | N | R |
A | Q | W | M | C | Q | P | F | F | S | F | S | E | Y | W | B | B | O | W | J | V |
F | U | F | K | C | D | A | A | L | Y | E | J | K | W | O | J | D | S | E | M | F |
Y | G | L | I | S | T | T | H | E | E | L | I | M | I | N | A | T | E | I | G | L |
G | Y | H | D | T | Y | E | X | N | A | G | T | Q | X | U | S | Q | R | G | D | I |
V | T | U | J | D | E | C | I | S | I | O | N | T | R | E | E | S | D | H | Y | T |
P | U | I | W | N | A | J | T | L | P | L | M | O | S | H | D | N | X | T | G | R |
I | X | Q | R | K | R | Q | B | D | N | W | L | I | F | O | B | U | X | U | B | T |
W | U | R | I | N | D | U | C | T | I | V | E | B | I | A | S | Q | L | P | U | T |
F | C | O | N | C | E | P | T | L | E | A | R | N | I | N | G | X | V | D | I | A |
Y | J | D | E | S | I | G | N | C | H | O | I | C | E | S | P | H | K | A | I | W |
U | M | Q | O | K | C | R | B | W | H | J | E | H | E | L | H | I | A | T | P | H |
L | Q | J | L | E | A | R | N | I | N | G | S | Y | S | T | E | M | L | E | H | D |
A | T | E | A | B | W | C | A | E | C | T | I | E | M | R | I | E | Y | R | D | W |
C | O | M | P | L | A | I | N | T | S | T | O | F | I | N | D | S | G | U | Y | C |
T | R | I | V | Q | A | W | T | Y | N | F | H | J | V | W | T | J | X | L | X | X |
U | J | X | O | E | E | G | W | E | M | U | F | P | J | O | R | U | K | E | I | I |
U | V | J | N | F | U | N | J | R | F | G | J | I | U | F | X | D | D | H | H | V |
Clues
- -> to obtain VS, Start with H, for each x in D and for each h in H: if h doesn't match c(x): Remove. (4, 3, 9)
- Dc ^xi >> L(xi, Dc) (>> inductive inference) (8, 6, 1)
- experience type, target function, learning algorithm, representation (6, 7)
- iff all instances classified positive by h1 are also classifies positive by h2 (4, 7)
- Initialize to most specific. For each positive training instance: if attribute constraint doesn't satisfy: Generalize it. (4, 1, 9)
- learn discrete valued target functions, disjunction of conjunction of attribute values, writeble as set of rules (8, 5)
- minimal set of assertions B such that: for all xi € X: B ^Dc ^xi |= L(xi, Dc) (|= deductive inference) (9, 4)
- only takes positive examples, might miss the concept, inconsisteny in training data isn't detected, might miss different solutions (10, 2, 4, 1)
- search in the space of hypotheses H for the ypothesis best fitting the example (7, 8)
- Select exp. at random. Calculate with learned function on current weights. Calculate error. Update weights w1 + epsilon*feature1*error (3, 6, 6, 4)
Comments
No comments have yet been made