COMPUTER SCIENCE AND ENGINEERING
MACHINE LEARNING
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
considers both positive and negative samples
|
|
|
considers only positive samples
|
|
|
includes version space
|
|
|
No way to determine whether the hypothesis is consistent or not.
|
Detailed explanation-1: -The Find-S algorithm only considers the positive examples and eliminates negative examples. For each positive example, the algorithm checks for each attribute in the example. If the attribute value is the same as the hypothesis value, the algorithm moves on without any changes.
Detailed explanation-2: -• Consistent hypothesis: a concept c that evaluates to T on all positive examples and to F on all negatives.
Detailed explanation-3: -FIND-S outputs a hypothesis from H, that is consistent with the training examples, this is just one of many hypotheses from H that might fit the training data equally well. The key idea in the Candidate-Elimination algorithm is to output a description of the set of all hypotheses consistent with the training examples.
Detailed explanation-4: -FIND S Algorithm is used to find the Maximally Specific Hypothesis.