ii) In the DBSCAN algorithm, if two border points A and B are within Eps distance from each other, both A and B must be in the same cluster. T OR F Answer:

Explain how to do Breadth First Search, with an example.

Which statement best describes k-means cluster analysis?   Question 9 options:   It is the process of organizing observations into distinct groups based on a measure of similarity or dissimilarity.   It is the process of agglomerating observations into a series of nested groups based on a measure of similarity or dissimilarity.   It is the process of reducing the number of variables to consider in data-mining.    It is the process of estimating the value of a continuous outcome variable.

In the DBSCAN clustering algorithm, consider three border points A, B, and C. The numbers of other points within Eps distance from A, B, and C are 7, 2, and 5, respectively. What is the minimum possible value for the minpoints parameter of the DBSCAN algorithm?