Reference no: EM131466982
Question One
The following decision tree has been created for loan approval.
a. Convert this tree to if then rules
b. Using the following testing data:
i. Predict the class of each record (0.25)
Income range of applicant Criminal record Years in present job Makes credit card payments
|
|
Income range of applicant
|
Criminal record
|
Years in present job
|
Makes credit card payments
|
Class
|
Prediction
|
|
1
|
$25K
|
no
|
6
|
no
|
loan
|
|
|
2
|
$40K
|
yes
|
2
|
yes
|
loan
|
|
|
3
|
$80K
|
no
|
7
|
yes
|
No loan
|
|
|
4
|
$55K
|
no
|
8
|
no
|
No loan
|
|
ii. Calculate the accuracy of this model.
iii. Interpret the obtained result
iv. How we can improve the performance of the obtained model?
Question Two
Compare neural networks and SVM techniques. What do they have in common and what are the major differences?
Question Three
We can represent a data set as a collection of object nodes and a collection of attribute nodes, where there is a link between each object and each attribute, and where the weight of that link is the value of the object for that attribute. For sparse data, if the value is 0, the link is omitted. Bipartite clustering attempts to partition this graph into disjoint clusters, where each cluster consists of a set of object nodes and a set of attribute nodes. The objective is to maximize the weight of links between the object and attribute nodes of a cluster, while minimizing the weight of links between object and attribute links in different clusters. This type of clustering is also known as co-clustering since the objects and attributes are clustered at the same time.
a) How is bipartite clustering (co-clustering) different from clustering the sets of objects and attributes separately?
b) Are there any cases in which these approaches yield the same clusters?
https://www.dropbox.com/sh/qja219g4oy39h4s/AAB2_L83RbUOWAYG3bT0lIhna?dl=0