Which of the following uses merging approach?

Hierarchical clustering
OPartitional clustering
O Density-based clustering

O None of the above

which of the following is correct regarding Knn algorithm *

The algorithm does more computation on train time.

The algorithm does more computationon test time.

Computation time is equal for both.

O hlem.
Depends on the nature of the problem. W

Which of the following clustering algorithm follows a top to bottom approach?

Divisible

OKmeans
O Agglomerative

All of the above

Which algorithm does not require a dendrogram?

O Divisible

Kmeans
O Agglomerative

OAll of the above

What is a dendrogram?*

Hierarchical structure
O diagram structure

graph structure
O none

What is Decision Tree?*

O Flow-Chart
Structure in which internal node represents test on an attribute, each branch
O represents outcome of test and each leaf node represents class label

FlowChart & Structure in which internal node represents test on an attribute, each
branch represents outcome of test and each leaf node represents class label
 Decision trees are also known as CART. What is CART?

Classification and Regression Trees

O Customer Analysis and Research Tool

Communication Access Real-time Translation

O Computerized Automatic Rating Technique

Naive Bayes algorithm is based on. and used for solving classification
problems

Bayes Theorem

OCandidate elimination algorithm

O EM algorithm

O None of the above

Can we use a decision tree for both Regressions as well as Classification?

TRUE
OFALSE
Clear selection
 None of the above
O

well Classification?
Can we use a decision tree for both Regressions as as

TRUE
FALSE
Clear selection

Information gain is required to decide

Which feature to split on at every step in buildinthe tree.

O Possible combinations of variables.

O No. of possible branches.

O All of the above

Clear form
Submit

ever submit passwords thtough Google Forms

This form was created inside of Vishwakanma nstutite ot nfomation Techmotay ReuMt ADNE

Google Forms