Kizspy | Question: 30
(Choose 1 answer)
Which of the following statements correctly defines the strengths of the DBSCAN algorithm?
A. No need to specify the number of clusters (cf. K-means), allows for noise, and can handle arbitrary-shaped
clusters.
B. Do well with different density, works with just one parameter, the n_clu defines itself.
C. The algorithm will find the outliers first, draw regular shapes, works faster than other algorithms.
D. The algorithm is computationally intensive, it is sensitive to outliers, and it requires few hyperparameters to
be tuned.
