☑ MCQ PRACTICE

Data Mining Unit 4

Practice objective questions for quick revision and examination preparation. Try answering each question before revealing the answer.

📚 Data Mining
📖 Unit 4
🎯 MCQs
1
Clustering is a_________________________________
A Group of similar objects that differ significantly from other objects
B Operations on a data to transform data in order to prepare it for a data mining algorithm
C Symbolic representation of facts from which information can potentially be extracted
D None
Correct Answer Group of similar objects that differ significantly from other objects
2
Clustering is a type of ______ learning technique.
A Supervised
B Semi-supervised
C Unsupervised
D Reinforcement
Correct Answer Unsupervised
3
The main goal of clustering is to identify ______ in the data.
A Noise
B Patterns or relationships
C Outliers
D Dependencies
Correct Answer Patterns or relationships
4
In clustering, data points within the same cluster are ______.
A Dissimilar
B Similar
C Random
D Opposite
Correct Answer Similar
5
Which of the following is a partitioning-based clustering method?
A K-Means
B DBSCAN
C Hierarchical
D Grid-based
Correct Answer K-Means
6
In the K-Means algorithm, each cluster is represented by a ______.
A Node
B Centroid
C Point
D Median
Correct Answer Centroid
7
K-Means clustering aims to minimize the sum of ______ between data points and their clusters.
A Angles
B Distances
C Correlations
D Weights
Correct Answer Distances
8
The K-Medoids algorithm is also known as ______.
A PAM (Partitioning Around Medoids)
B LAM (Local Assignment of Medoids)
C CAM (Cluster Assignment Method)
D RAM (Random Assignment Method)
Correct Answer PAM (Partitioning Around Medoids)
9
In K-Medoids, the cluster center is always a ______.
A Mean
B Data point
C Hypothetical point
D Zero point
Correct Answer Data point
10
Which of the following clustering methods uses a tree-like structure?
A Grid-based
B Hierarchical
C Density-based
D Partitioning
Correct Answer Hierarchical
11
The tree-like structure formed in hierarchical clustering is called a ______.
A Graph
B Dendrogram
C Lattice
D Chain
Correct Answer Dendrogram
12
Agglomerative clustering follows a ______ approach.
A Top-down
B Bottom-up
C Random
D Sequential
Correct Answer Bottom-up
13
Divisive hierarchical clustering follows a ______ approach.
A Top-down
B Bottom-up
C Random
D Iterative
Correct Answer Top-down
14
DBSCAN algorithm groups data based on ______.
A Density
B Similarity
C Probability
D Gradient
Correct Answer Density
15
The parameter "ε (epsilon)" in DBSCAN defines ______.
A Number of clusters
B Distance threshold (radius)
C Learning rate
D Number of iterations
Correct Answer Distance threshold (radius)
16
In DBSCAN, MinPts parameter defines ______.
A Minimum distance
B Minimum number of neighbors
C Maximum distance
D Maximum density
Correct Answer Minimum number of neighbors
17
In DBSCAN, points that do not belong to any cluster are called ______.
A Core points
B Border points
C Noise points
D Dense points
Correct Answer Noise points
18
Outlier analysis helps in identifying data points that ______.
A Follow a trend
B Differ from the majority
C Have maximum density
D Are similar to others
Correct Answer Differ from the majority
19
Which of the following is a density-based clustering algorithm?
A K-Means
B K-Medoids
C DBSCAN
D Hierarchical
Correct Answer DBSCAN
20
The technique used to find the distance between two clusters in hierarchical clustering is called ______.
A Aggregation method
B Linkage method
C Proximity measure
D Distance method
Correct Answer Linkage method

Fill in the Blanks

21 Clustering groups similar data points together based on their ______.
Correct Answer Features
22 K-Means is a ______-based clustering algorithm.
Correct Answer Centroid
23 In K-Means, the number of clusters (k) must be ______ before execution.
Correct Answer Predetermined
24 The K-Medoids algorithm is designed to handle ______ data.
Correct Answer Outlier
25 The hierarchical clustering output is represented using a ______.
Correct Answer Dendrogram
26 The two main types of hierarchical clustering are ______ and ______.
Correct Answer Agglomerative, Divisive
27 DBSCAN uses two parameters: ______ and ______.
Correct Answer Epsilon (ε), MinPts
28 In DBSCAN, a point with at least MinPts within its epsilon neighborhood is called a ______ point.
Correct Answer Core
29 Data points that deviate significantly from the dataset are called ______.
Correct Answer Outliers
30 In distance-based clustering, the most commonly used distance measure is ______ distance.
Correct Answer Euclidean
← Back to All MCQs