Machine Learning
Machine Learning
a)Greedily learn a decision tree using the ID3 algorithm and draw
the tree.
b) (i) Write the learned concept for Martian as a set of conjunctive
rules (e.g., if
(green=Y and legs=2 and height=T and smelly=N), then Martian;
else if ... then Martian;...; else Human).
(ii) The solution of part
b)i) above uses up to 4 attributes in each conjunction. Find a set of
conjunctive rules using only 2 attributes per conjunction that still
results in zero error in the training set. Can this simpler hypothesis
be repres
ented by a decision tree of depth 2? Justify.
2.
● Naive Bayes:
1)
2)
● REGRESSION:
2.
3.
The sales of a company (in million dollars) for each year are
shown in the table below.
x (year) 2005 2006 2007 2008 2009
y (sales) 12 19 29 37 45
1.
3.
4.Design a two layer network of perceptron to implement XOR
and AND gates.
● SVM:
1.
● PCA:
● Q-Learning: