filmov
tv
Find S: Learn to solve Find S algorithm problems in Hindi (EASY)
Показать описание
Hope you all understand my explanation:)
The algo:
1. Initialize h to the most specific hypothesis in H
2. For each positive training instance x
For each attribute, constraint ai in h
If the constraint ai is satisfied by x
then do nothing
Else
replace ai in h by the next more general constraint that is satisfied by x
3. Output the hypothesis h
The algo:
1. Initialize h to the most specific hypothesis in H
2. For each positive training instance x
For each attribute, constraint ai in h
If the constraint ai is satisfied by x
then do nothing
Else
replace ai in h by the next more general constraint that is satisfied by x
3. Output the hypothesis h
0:06:09
0:06:06
0:09:18
0:07:32
0:03:24
0:12:27
0:01:00
0:06:15
0:00:48
0:05:04
0:09:58
0:00:25
0:06:34
0:00:15
0:01:01
0:02:04
0:03:03
0:00:30
0:00:24
0:00:27
0:05:50
0:23:20
0:00:29
0:04:27