(Choose 1 answer)
How do we define the core points when we use the DBSCAN algorithm?
A. A point that has more than n_clu neighbors in their E-neighborhood.
B. An E-neighbor point than has fewer than n_clu neighbors itself.
C. A point that has no points in its E-neighborhood.
D. A point that has the same amount of n_clu neighbors within and outside the E-neighborhood
Q: 13
