Beruflich Dokumente
Kultur Dokumente
com
2. a)
b)
Explain basic decision tree algorithm.
E R
Explain how hypothesis space search is carried in decision tree learning. [12]
3. a)
b)
K
Explain Back propagation algorithm. Mention its limitations.
Discuss a general approach for deriving confidence intervals.
N
[12]
A
4. a) Discuss maximum likelihood hypothesis for predicting probabilities in
Bayesian learning.
R
b) Explain Gibs algorithm. [12]
5. a)
b)
S T
Explain Hypothesis space search in genetic algorithms.
How Genetic Algorithm can be parallelized? [12]
R
6. a) Discuss Explanation-Based learning of search control knowledge.
b)
7. a)
b)
I
How learning can be carried with perfect domain theories?
F
Explain Inductive analytical approaches to learning.
Explain Lazy and Eager learning.
[12]
[12]
*****
www.firstranker.com