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
A
Supervised
B
Semi-supervised
C
Unsupervised
D
Reinforcement
Correct Answer
Unsupervised
A
Noise
B
Patterns or relationships
C
Outliers
D
Dependencies
Correct Answer
Patterns or relationships
A
Dissimilar
B
Similar
C
Random
D
Opposite
Correct Answer
Similar
A
K-Means
B
DBSCAN
C
Hierarchical
D
Grid-based
Correct Answer
K-Means
A
Node
B
Centroid
C
Point
D
Median
Correct Answer
Centroid
A
Angles
B
Distances
C
Correlations
D
Weights
Correct Answer
Distances
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)
A
Mean
B
Data point
C
Hypothetical point
D
Zero point
Correct Answer
Data point
A
Grid-based
B
Hierarchical
C
Density-based
D
Partitioning
Correct Answer
Hierarchical
A
Graph
B
Dendrogram
C
Lattice
D
Chain
Correct Answer
Dendrogram
A
Top-down
B
Bottom-up
C
Random
D
Sequential
Correct Answer
Bottom-up
A
Top-down
B
Bottom-up
C
Random
D
Iterative
Correct Answer
Top-down
A
Density
B
Similarity
C
Probability
D
Gradient
Correct Answer
Density
A
Number of clusters
B
Distance threshold (radius)
C
Learning rate
D
Number of iterations
Correct Answer
Distance threshold (radius)
A
Minimum distance
B
Minimum number of neighbors
C
Maximum distance
D
Maximum density
Correct Answer
Minimum number of neighbors
A
Core points
B
Border points
C
Noise points
D
Dense points
Correct Answer
Noise points
A
Follow a trend
B
Differ from the majority
C
Have maximum density
D
Are similar to others
Correct Answer
Differ from the majority
A
K-Means
B
K-Medoids
C
DBSCAN
D
Hierarchical
Correct Answer
DBSCAN
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