Scribd
Upload
597 views6 pages

Mcq's On Unit V

This document contains 25 multiple choice questions about machine learning concepts covered in Unit 5, including: 1) Bayesian classifiers try to find an optimum classification of examples using probabilistic theory. 2) Decision trees generate if-then rules to perform classification. 3) Classification rules are extracted from decision trees. 4) Clusters group similar objects that differ significantly from other objects. 5) Inference is the process of calculating a probability distribution of interest using a Bayesian network. 6) Bayesian networks have nodes and links that form the structural specification.

Uploaded by

bigbang
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
597 views6 pages

Mcq's On Unit V

This document contains 25 multiple choice questions about machine learning concepts covered in Unit 5, including: 1) Bayesian classifiers try to find an optimum classification of examples using probabilistic theory. 2) Decision trees generate if-then rules to perform classification. 3) Classification rules are extracted from decision trees. 4) Clusters group similar objects that differ significantly from other objects. 5) Inference is the process of calculating a probability distribution of interest using a Bayesian network. 6) Bayesian networks have nodes and links that form the structural specification.

Uploaded by

bigbang
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

MCQ’S ON UNIT V

1. Bayesian classifiers is

A A class of learning algorithm that tries to find an optimum classification of a set of examples
. using the probabilistic theory.

B Any mechanism employed by a learning system to constrain the search space of a hypothesis
.
C An approach to the design of learning algorithms that is inspired by the fact that when people
. encounter new situations, they often explain them by reference to familiar experiences,
adapting the explanations to fit the new situation.

D None of these
.
Ans:A

2. Tree/ Rule based classification algorithm generate …….. rule to perform the classification

A. If- then
B. WHILE
C. Do while
D. Switch
Ans: A

3. In Data mining, classification rules are extracted from ..............


A. Data
B. Information
C. Decision Tree
D. Database
Ans: C

4. Cluster is------------------
A. Group on a training data set to transform or simplify data in order to prepare it for a
machine-learning algorithm
B. Group of similar objects that differ significantly from other objects.
C. Symbolic representation of facts or ideas from which information can potentially be
extracted
D. Both a and b
Ans: B

5. Bayesian Belief Network is also known as ?

A. belief network
B. decision network
C. Bayesian model
D. All of the above
Ans: D

6.  Bayesian Network consist of ?


MCQ’S ON UNIT V

A. 2
B. 3
C. 4
D. 5
Ans: A

7. Thegeneralized form of Bayesian network that represents and


solve decision problems under uncertain knowledge is known as
an?
A. Directed Acyclic Graph
B. Table of conditional probabilities
C. Influence diagram
D. None of the above
Ans:C

8. How many component does Bayesian network have?


A. 2
B. 3
C. 4
D. 5
Ans: A

9. The Bayesian network graph does not contain any cyclic graph.
Hence, it is known as a 
A. DCG
B. DAG
C. CAG
D. SAG
Ans: B

10. In a Bayesian network variable is?

A. continuous 
B. discrete
C. Both A and B
D. None of the above
Ans:C

11. If we have variables x1, x2, x3,....., xn, then the probabilities of a
MCQ’S ON UNIT V

different combination of x1, x2, x3.. xn, are known as?


A. Table of conditional probabilities
B. Causal Component
C. Actual numbers
D. Joint probability distribution
Ans: D

12. The nodes and links form the structure of the Bayesian network,
and we call this the ?
A. structural specification
B. multi-variable nodes
C. Conditional Linear Gaussian distributions
D. None of the above
Ans: A

13. Which of the following are used for modeling times series and
sequences?
A. Decision graphs
B. Dynamic Bayesian networks
C. Value of information
D. Parameter tuning
Ans: B

14. How many terms are required for building a bayes model?

A. 1
B. 2
C. 3
D. 4
Ans: C

15. What does the bayesian network provides?

A. Complete description of the domain


B. Partial description of the domain
C. Complete description of the problem
D. None of the above
MCQ’S ON UNIT V

Ans:A

16. ____________
is the process of calculating a probability distribution
of interest e.g. P(A | B=True), or P(A,B|C, D=True).
A. Diagnostics 
B. Supervised anomaly detection
C. Inference
D. Prediction 
Ans: C

17. To which does the local structure is associated?

A. Hybrid
B. Dependant
C. Linear
D. None of the above
Ans:C

18. Which of the following distance metric can not be used in k-NN?
A) Manhattan
B) Minkowski
C) Tanimoto
D) Jaccard
E) Mahalanobis
F) All can be used 
Ans: F

19. Which of the following distance measure do we use in case of categorical


variables in k-NN?

1. Hamming Distance
2. Euclidean Distance
3. Manhattan Distance

A) 1
B) 2
C) 3
D) 1 and 2
E) 2 and 3
F) 1,2 and 3
Ans: A

20. When you find noise in data which of the following option would you
MCQ’S ON UNIT V

consider in k-NN?

A) I will increase the value of k


B) I will decrease the value of k
C) Noise can not be dependent on value of k
D) None of these

Ans: A

21. Which of the following statements is true for k-NN classifiers?

A) The classification accuracy is better with larger values of k


B) The decision boundary is smoother with smaller values of k
C) The decision boundary is linear
D) k-NN does not require an explicit training step

Ans: D

22. A _________ is a decision support tool that uses a tree-like graph or model of
decisions and their possible consequences, including chance event outcomes,
resource costs, and utility.
a) Decision tree
b) Graphs
c) Trees
d) Neural Networks

Ans: A

23. Which one of the following statements about the K-means clustering is
incorrect?

a. The goal of the k-means clustering is to partition (n) observation into (k)
clusters

b. K-means clustering can be defined as the method of quantization

c. The nearest neighbor is the same as the K-means

d. All of the above

Ans: C

24.  Which of the following statement is true about the classification?

a. It is a measure of accuracy
MCQ’S ON UNIT V

b. It is a subdivision of a set

c. It is the task of assigning a classification

d. None of the above

Ans: B

25. Which one of the following can be defined as the data object which
does not comply with the general behavior (or the model of available
data)?

a. Evaluation Analysis

b. Outliner Analysis

c. Classification

d. Prediction

Ans: B

You might also like