Database - Data Mining

101. Which of the following is not a clustering approach?

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


102. Given six points with the following attributes:

Pointx coordinatey coordinate
p10.40050.5306
p20.21480.3854
p30.34570.3156
p40.26520.1875
p50.07890.4139
p60.45480.3022
Table: X-Y coordinates of six points.
 p1p2p3p4p5p6
p10.00000.23570.22180.36880.34210.2347
p20.23570.00000.14830.20420.13880.2540
p30.22180.14830.00000.15130.28430.1100
p40.36880.20420.15130.00000.29320.2216
p50.34210.13880.28430.29320.00000.3921
p60.23470.25400.11000.22160.39210.0000
Table: Distance Matrix for Six Points
Which of the following clustering representations and dendrogram depicts the use of MIN or Single link proximity fucntion in hierarchical clustering:

  • Option : A
  • Explanation :
    For the single link or MIN version of hierarchical clustering, the proximity of two clusters is defined to be the minimum of the distance between any two points in the different clusters. For instance, from the table, we see that the distance between points 3 and 6 is 0.11, and that is the height at which they are joined into one cluster in the dendrogram. As another example, the distance between clusters {3, 6} and {2, 5} is given by dist({3, 6}, {2, 5}) = min(dist(3, 2), dist(6, 2), dist(3, 5), dist(6, 5)) = min(0.1483, 0.2540, 0.2843, 0.3921) = 0.1483.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


103. Which of the following clustering algorithms is the most sensitive to outliers?

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


104. State whether the statement is True/False:
k-NN algorithm does more computation on test time rather than train time.

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


105. Suppose we are using dimensionality reduction as pre-processing technique, i.e, instead of using all the features, we reduce the data to k dimensions with PCA. And then use these PCA projections as our features. Which of the following statements is correct?

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *