Machine Learning BITS
Machine Learning BITS
A ___is said to be correct if each its assertion is a truthful statement about the world [ ]
6. Prolog-EBG for each positive examples in Pos that is not covered by learned rules, do [ ]
i. Explain ii. Analyze iii. Refine
A) i & ii B) i & iii C) i & iii D) All the above
7. The two stages of____________ first creates an artificial neural network that perfectly fits
domain theory and second to use back propagation algorithm [ ]
A) Learn-one- Rule B) Inductive C) KBANN algorithm D) None of the above
8. The control policy from any initial state, chooses actions that __________ the reward
accumulated overtime by the agent [ ]
A) Zero B) One C) Minimize D) Maximize
9. Genetic operators can be [ ]
i. Single-point crossover ii. Multi-point crossover iii. Uniform crossover
A) i & ii B) i & iii C) i & iii D) All the above
16. The Practical applicability of the ___________ algorithm is restricted by its requirement
that the domain theory be correct and complete
19. __________________________ learns sequentially a set of rules that together cover the
full set of positive rules.
20. The K-Nearest Neighbor the distance between two instances 𝑥𝑖 and 𝑥𝑗 is defined to
𝑑(𝑥𝑖 , 𝑥𝑖 ) is_______________________________________.
Which of the following statements is/are true about “Type-1” and “Type-2” errors?