ExamVeda
Login
Home
1
. . . . . . . . provides some built-in datasets that can be used for testing purposes.
Discuss
Answer & Solution
Answer: Option A
No explanation is given for this question. Let's Discuss on Board
2
The leaf nodes of a model tree are
Discuss
Answer & Solution
Answer: Option C
No explanation is given for this question. Let's Discuss on Board
3
The parameter . . . . . . . . allows specifying the percentage of elements to put into the test/training set
Discuss
Answer & Solution
Answer: Option C
No explanation is given for this question. Let's Discuss on Board
4
How do you handle missing or corrupted data in a dataset?
Discuss
Answer & Solution
Answer: Option D
No explanation is given for this question. Let's Discuss on Board
5
What is the naive assumption in a Naive Bayes Classifier.
Discuss
Answer & Solution
Answer: Option D
No explanation is given for this question. Let's Discuss on Board
6
Data used to optimize the parameter settings of a supervised learner model.
Discuss
Answer & Solution
Answer: Option D
No explanation is given for this question. Let's Discuss on Board
7
In a real problem, you should check to see if the SVM is separable and then include slack variables if it is not separable.
Discuss
Answer & Solution
Answer: Option B
No explanation is given for this question. Let's Discuss on Board
8
We usually use feature normalization before using the Gaussian kernel in SVM. What is true about feature normalization?
1. We do feature normalization so that new feature will dominate other
2. Some times, feature normalization is not feasible in case of categorical variables
3. Feature normalization always helps when we use Gaussian kernel in SVM
Discuss
Answer & Solution
Answer: Option B
No explanation is given for this question. Let's Discuss on Board
9
The minimum time complexity for training an SVM is O(n2). According to this fact, what sizes of datasets are not best suited for SVM's?
Discuss
Answer & Solution
Answer: Option A
No explanation is given for this question. Let's Discuss on Board
10
This clustering algorithm initially assumes that each data instance represents a single cluster.
Discuss
Answer & Solution
Answer: Option A
Solution:
Agglomerative clustering is a type of hierarchical clustering technique.

Initially, each data instance is considered as a separate cluster.

Clusters are merged step by step based on a defined similarity measure.

This process continues until all data points form a single cluster or meet a stopping criterion.

Key Point: It is a bottom-up approach to clustering.