Consider figure below. Answer the following questions related to DBSCAN. Assume that we use the Euclidean distance between points in DBSCAN, and that radius is = 2 and threshold for a point

to be in 1.

2. 3.

4. 5.

the core is to have at least = 3 neighbors within the radius.

5. Show the density-based clusters and the noise points 10 9 8 6 0 tu 0 3 12 3 4567 89 10 11 12 13 14 15 1617